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.
In A3 the moved spaces meet in a line, while the root complexes have no common nonempty face
Example
Use the standard model, simple roots, and bipartite Coxeter element of Ordered roots and the mu-dot-root matrix in A3. Put Then:
(i) and . Their lower intervals are exactly Thus their only common lower bound is , so their meet in is .
(ii) and . The complexes are the edges and . Their only common face is the empty face, so , their spherical realizations are disjoint, and
(iii) The moved spaces are and , both two dimensional, and This line contains no root: every root has exactly two nonzero coordinates, whereas every nonzero vector on the displayed line has four. In the standard Euclidean norm the displayed generator has norm , while every root has norm . Hence strictly contains and is not the moved space of any common lower bound.
(iv) The common upper bound is . Thus this example has positive-root cones meeting only at and a nonzero moved-space intersection; intersecting moved spaces does not compute the meet in the absolute interval.
No Choice is used.
Facts & Assumptions
Given: The A3 coordinate model, root order, and reflection convention of Ordered roots and the mu-dot-root matrix in A3. The standard Euclidean norm is denoted ; its half-scaled inner product is the Coxeter form used for unit roots.
In the A3 model, with order , and acts as the coordinate transposition . Ordered roots and the mu-dot-root matrix in A3 The real Coxeter form, its radical, reflections, and form-preserving maps
is the least number of reflections in whose product is , and means . Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator (1)-(2)
The ordered edge relation defines ; and is its full subcomplex on ; and is the union of the positive cones on its faces. The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations (1)-(3)
The root-reflection dictionary identifies each positive-root reflection with the reflection in its normal. The inversion formula , the root-reflection dictionary and strong exchange (1)
Cones on two faces of intersect in the cone on their common face. The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (4)
Proof
In , and are products of two disjoint transpositions but are not themselves transpositions, so each has reflection length . The four-cycle has reflection length : no product of at most two transpositions is a 4-cycle, since a product of two is the identity, a 3-cycle, or two disjoint transpositions. The identities and show that and are reflections (the first is a conjugate of ), hence .
A reflection in this model is a transposition. For , exactly when is a reflection, because and . If or , is the other factor transposition. Any other transposition connects the two pairs and , and is a four-cycle. Thus the only reflections below are and . The same argument with the factor pairs and shows that the only reflections below are and . By the defining length equality, a proper lower element has strictly smaller reflection length, so the two lower intervals are exactly those listed in (i), and their intersection is .
The coordinate action gives and . By [F4]-[F5] and step 2.1, their positive-root sets are respectively and . The reverse products for the ordered pairs are and , so both pairs are edges by [F4]. The vertex sets are disjoint, hence every face of and every face of have common face . By [F6], each corresponding pair of face cones intersects in ; taking the finite unions of these face cones gives . Intersecting with the unit sphere also gives disjoint spherical realizations.
Write a vector of as and a vector of as . Equating coordinates gives , , and , so the intersection is exactly . Every nonzero vector on this line has four nonzero coordinates, whereas every root in [F1] has two; therefore the line contains no root. The standard norm of its displayed generator is and that of each root is . By step 2.1, the meet is , whose moved space is ; thus the moved-space intersection is strictly larger and is not the moved space of any common lower bound. Finally is the asserted common upper bound.
Depends on
- Ordered roots and the mu-dot-root matrix in A3
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
- The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations
- The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma)
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
52 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)