1 · The essentials
The result concerns whether a mathematical expression is determined entirely by a pattern of order. The objects being compared are portions of ordered mathematical structures. Two such portions can have the same ordering pattern even when they come from different surrounding structures. The manuscript shows that, whenever their patterns match, their associated expressions match too. These expressions are called Kazhdan–Lusztig polynomials, and the statement concerns their equal-parameter version. The repository describes this as resolving the full combinatorial invariance conjecture. The main result has a Lean formalization, although the supplied text does not detail its scope.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine two task charts with different labels but exactly the same pattern of which tasks must precede which others. The result is like saying that an expression attached to each chart depends only on that pattern, not on the labels or the larger project containing the chart.
Why it matters
The result identifies the abstract order of an interval as sufficient information to determine its equal-parameter Kazhdan–Lusztig polynomial. This applies even when the intervals belong to different Coxeter systems. The repository and main abstract describe it as a positive resolution of the full combinatorial invariance conjecture.
2 · Going further
The precise statement concerns Bruhat intervals in arbitrary Coxeter systems. If and are isomorphic as ordered sets, then their equal-parameter Kazhdan–Lusztig polynomials satisfy . The two intervals need not lie in the same Coxeter system: according to the repository summary, the abstract order of the interval determines the polynomial even across different systems.
The main abstract presents this statement as the positive resolution of the full combinatorial invariance conjecture. It states the conclusion but supplies no description of the argument, so no mechanism or intermediate steps can be explained from the provided source. Only the main manuscript is supplied; there is no information about companion manuscripts or their relationship to this result. The main result has a Lean formalization, but the supplied material does not specify the detailed scope of that formalization.
Useful notions
- Ordered sets and intervals
- Isomorphisms of ordered sets
- Coxeter systems and Bruhat order
- Equal-parameter Kazhdan–Lusztig polynomials
What was known before / what is new
Before
The source identifies the question as the full combinatorial invariance conjecture. It provides no account of earlier partial results, so a more detailed history cannot be given from this material.
New
The manuscript shows that isomorphic Bruhat intervals in arbitrary Coxeter systems have identical equal-parameter Kazhdan–Lusztig polynomials. The statement includes comparisons across different Coxeter systems, rather than being restricted to intervals within a single system. The repository describes this as resolving the full conjecture.
Limits and assumptions
The hypothesis is an isomorphism of Bruhat intervals, and the conclusion concerns equal-parameter Kazhdan–Lusztig polynomials. Although the Coxeter systems are arbitrary, the supplied statement does not address other parameter settings. The main result has a Lean formalization; its detailed scope is not specified in the supplied text and should not be assumed to cover additional claims. No remaining open questions or argument details are supplied.
Mini glossary
- Bruhat interval —
- An interval in the Bruhat order of a Coxeter system.
- Order isomorphism —
- A matching between two ordered sets that preserves their ordering relationships in both directions.
- Combinatorial invariance —
- Here, the property that the equal-parameter Kazhdan–Lusztig polynomial depends only on the abstract order of its Bruhat interval.
Keywords : Combinatorial invariance · Bruhat intervals · Kazhdan–Lusztig polynomials
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
Resolves the full combinatorial invariance conjecture: isomorphic Bruhat intervals in arbitrary Coxeter systems have identical equal-parameter Kazhdan–Lusztig polynomials. Thus the abstract order of the interval determines the polynomial, even across different Coxeter systems.
Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.
Manuscripts in this family
Combinatorial invariance of Kazhdan–Lusztig polynomials
24/09/2026We prove that an isomorphism of Bruhat intervals in arbitrary Coxeter systems preserves their equal-parameter Kazhdan–Lusztig polynomials. This resolves the full combinatorial invariance conjecture positively.