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.
The printed root characterization of a wall-crossing element
PDF p. 10: paragraph after (3.15)
Statement
Let be a Coxeter system indexed by the vertex set . For , let be the subgroup generated by the simple reflections indexed by , let be its associated root set, and put . For a chamber label and , suppose is finite, where is the connected component containing in the Coxeter diagram induced on . Let denote the longest element of a finite , let be defined by , and set and .
The article claims that is the unique element satisfying and . This claim is false as printed: in the rank-one case below, fails the first inclusion.
Statement references
Proof
Given: The rank-one Coxeter system with and generator , and , .
[F1] The standard parabolic subgroup is generated by the simple reflections indexed by ; and . Standard parabolic subgroups and parabolic roots
[F2] The simple root is a nonzero basis vector in the positive cone, and . Also . Coxeter-system, roots, length and weak-order conventions
[F3] A chamber label belongs to when and has minimum length in . Algebraic chamber-label set
[F4] The set is the component containing of the diagram induced on . Connected component notation [I,a]
[F5] For finite , is its longest element; is the permutation satisfying . In particular . Longest parabolic elements and opposition permutation
[F6] The wall-crossing element is , and . Simple wall-crossing elements and maps
Proof technique: direct.
Goal: verify the article's hypotheses in this example and show that its first inclusion fails.
Since , the two cosets in the chamber-label condition are both , and has minimum length in its coset. Thus . The induced diagram has the single vertex , so . The subgroup is finite; is nontrivial because it sends the nonzero vector to its negative. Hence all the stated hypotheses hold.
The longest element of is : the identity has length zero and has length one. Consequently , , and . By the root-set definition, , while . Thus the left side of the first claimed inclusion contains , but its right side is empty. The claimed inclusion, and hence the asserted characterization, fails.
Source notes
The counterexample addresses the formula as printed. It does not establish a general replacement characterization.
Depends on
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, paragraph immediately after (3.15)