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 Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations
Definition
Let be an irreducible Coxeter system of finite type with finite, , and let , , , , , , , , , and be as in The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id and The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma], so in the global order. Write for the reflection with normal and .
(1) The complex . Its vertex set is . For , join to by an edge exactly when . Let contain the empty simplex and every finite nonempty set of vertices whose every two-element subset is an edge. Thus is the abstract simplicial complex (An abstract simplicial complex) determined by this ordered edge relation.
(2) The subcomplexes . For , put and let be the full subcomplex of on the vertex set . For a positive root in the global order, let be the full subcomplex on vertices in that are less than or equal to ; thus has vertex set when .
(3) Positive cones and realizations. Every vertex is a unit vector. For a finite set of vertices define For a subcomplex put and , its positive-cone realization in the unit sphere. For and a positive root , write
(4) Abstentions. This definition does not assert that is nondegenerate for each simplex , that is a spherical simplex, that the cone realization embeds or any , or that these realizations are convex or have dimension . It also does not assert an equivalence between higher simplex membership and a single full-tuple product condition. No Choice is used.
Depends on
- The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a
- The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id
- The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]
- An abstract simplicial complex
Used by
- In A3 the moved spaces meet in a line, while the root complexes have no common nonempty face Example
- Intersection of root subcomplexes and purity under convexity Lemma
- Moved space of a reversed reflection product with independent normals Lemma
- The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) Lemma
- Finite noncrossing intervals are lattices, independently of the Coxeter element Theorem
- The separating-root lemma, the exact facet halfspaces of the added cones, and the spherical convexity of |X(sigma)| Theorem
Dependency tree · two levels
34 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Thomas Brady and Colum Watt, Lattices in finite real reflection groups (arXiv:math/0501502, 29-page PDF) (standard reference, not scraped)
- Robert Steinberg, Finite reflection groups, Transactions of the American Mathematical Society 91 (1959) 493-504 (AMS free digital archive, 12-page PDF) (standard reference, not scraped)
- Bill Casselman, Essays on Coxeter groups: Coxeter elements in finite Coxeter groups (author-hosted PDF, 12 pages) (standard reference, not scraped)
- Sergey Fomin and Nathan Reading, Root systems and generalized associahedra, IAS/Park City Mathematics Series lecture notes (arXiv:math/0505518) (standard reference, not scraped)