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.
Connected propagation spans the component
Statement
Use the arbitrary-rank geometric representation of Coxeter-system, roots, length and weak-order conventions and the orbit definition from Standard parabolic subgroups and parabolic roots. Let , , , , and , with connected-component notation from Connected component notation [I,a]. Vectors have finite support, even if the vertex set is infinite. Then . This assertion does not assume that or is finite.
Facts & Assumptions
Given: the notation and reflection formula of Coxeter-system, roots, length and weak-order conventions, the root orbits of Standard parabolic subgroups and parabolic roots, and as the vertices joined to by finite paths in Connected component notation [I,a]. [F1] The set contains and is -invariant by Outside parabolic roots form an invariant set. [F2] Across a diagram edge , : it is for finite and for infinite .
Proof
Given: the notation and reflection formula of Coxeter-system, roots, length and weak-order conventions, the root orbits of Standard parabolic subgroups and parabolic roots, and as the vertices joined to by finite paths in Connected component notation [I,a]. [F1] The set contains and is -invariant by Outside parabolic roots form an invariant set. [F2] Across a diagram edge , : it is for finite and for infinite .
Goal: Establish the assertion in the Statement.
Proof technique: direct.
Let . By [F1], is -invariant and contains . Fix and choose a path of least length . Such a path has no repeated vertex, so every with belongs to .
Induct along this finite path. If , then by invariance. Subtracting gives . The coefficient is nonzero by [F2], so . Thus every basis vector indexed by lies in , proving .
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.