How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Simple wall-crossing elements and maps
PDF p. 10: (3.14)–(3.15)
Definition
Let be a Coxeter system indexed by the vertex set , and fix . Write for the subgroup generated by the simple generators indexed by . Let , where is the algebraic chamber-label set: and has minimum length in .
Choose . Put , the vertices of the connected component containing in the Coxeter diagram induced on , and suppose is finite. For each finite standard parabolic , write for its longest element and for the permutation of determined by on its simple roots. Define the simple wall-crossing element and its associated pair by
For fixed , and , this defines on the labels satisfying the stated finiteness condition, with values in , where denotes the set of all subsets of .
Definition references
Justification
The chamber-label definition supplies , its standard parabolics, length and the set . The connected-support definition makes a uniquely determined subset of containing . Since is a subgroup of the finite group , it is finite. The longest-element definition therefore supplies both displayed longest elements and the permutation ; in particular . Thus , , and the displayed rule gives a unique pair in the stated codomain for every input. This justification does not assert that the output pair is a chamber label or that it represents an adjacent chamber.
Depends on
Used by · 24
- The printed root characterization of a wall-crossing element
- Empty-subset wall crossings are simple reflections
- Adjacent chambers and inverse wall-crossing elements
- Wall-crossing notation and Brink–Howlett convention
- Length additivity and the base-chamber half-space
- Finite wall-crossing connectivity
- Simplified wall crossing for a finite parabolic
- Normaliser action on labels, orbits and adjacency
- Chamber paths, concatenation and wall words
- Translation between relative arrangements in the geodesic argument
- Geodesics are exactly length-additive wall words
- A3 doubled adjacency graph
- Universal wall groupoid on relative chambers
- The universal wall groupoid is generated by adjacent crossings
- Standard expressions and their lengths
- Standard expressions correspond to geodesics
- Two-geodesic wall-crossing lemma
- Codimension-two relations
- Ribbon generators lift wall-crossing morphisms
- Assignment from wall crossings to ribbon generators
- Well-defined Deligne-to-ribbon functor and geodesic images
- Intermediate exact sequences and deck morphism in Theorem 6.7
- D4 chamber labels and complete adjacency graph
- Universal wall graph as a groupoid Cayley graph
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.
Sources
- Normalisers of parabolic subgroups of Artin–Tits groups and Tits cone intersections · PDF p. 10, equations (3.14)–(3.15)