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.
Intersection of root subcomplexes and purity under convexity
Statement
Let be an irreducible finite-type Coxeter system, and let be the bipartite Coxeter element with positive-root order, ordered root complex , cones , , and realizations of The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations (1)–(3), The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (3), and Real and complex inner-product spaces and their induced length. The vertices of every face are linearly independent unit positive roots, all in a common open half-space (The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (2)); all spans are taken in (Linear subspace of a vector space). Set , and let be subcomplexes of (An abstract simplicial complex, The geometric realization of an abstract simplicial complex). Then:
(1) Realization of an intersection. If is the subcomplex consisting of simplices common to both, then If and have no common vertex, this reads and .
(2) Purity under convexity. Suppose has at least one vertex. Put and . If is convex, then every maximal simplex of satisfies Under the common-open-half-space condition above, convexity of is equivalent to geodesic convexity of : for any two points of , the shorter great-circle arc between them lies in . Consequently all maximal simplices have dimension , so is pure (all maximal simplices have the same dimension).
(3) Small cases. If consists of one vertex , its unique maximal simplex is and its span is . If has no vertex, then , , and (2) is vacuous.
(4) Limits. The result does not identify with . In particular, it does not determine for and . No Choice is used.
Facts & Assumptions
Given: The bipartite ordered root complex of an irreducible finite-type Coxeter system, and two of its subcomplexes .
The vertex set is finite. Every face has linearly independent unit vertices, these vertices lie in a common open half-space, and for any two faces one has (The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations, The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id, The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (2),(4)).
The empty face is a simplex, subcomplexes are closed under taking faces, and their realizations are the sphere sections of their positive-cone unions (An abstract simplicial complex, The geometric realization of an abstract simplicial complex, The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations (3)).
A finite-dimensional subspace of a normed space is closed (A finite-dimensional normed subspace is closed). For each fixed , is continuous by Cauchy–Schwarz (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
The dimension of a simplex with vertices is ; an independent list spanning a subspace is a basis of that subspace (An abstract simplicial complex, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
Proof
Given: The finite root complex and subcomplexes above. Write and .
(Cone and realization intersections.) If , then for some face and for some face . By [F1], , and is a common face, so . The reverse inclusion follows from . Intersecting this cone equality with gives the realization equality. If there is no common vertex, every common face is empty, so the cone intersection is and its sphere section is empty.
(Closed face cones.) The empty-face cone is and is closed. Let be a nonempty face, , and let be its Gram matrix. For any nonzero coefficient vector , by independence, so is invertible. For , its unique coordinate vector in the basis is , whose coordinates are continuous by [F3]. Hence is the intersection of the closed subspace with the inverse images of the closed half-line under these coordinate maps; it is closed in . Since has finitely many faces, , , and are finite unions or intersections of closed face cones and are closed.
(Cone and spherical convexity.) Every nonzero vector of is a nonnegative combination of positive-root vertices, so the common open-half-space functional in [F1] is strictly positive on it; in particular contains no antipodal pair. If is convex, the segment between any lies in and avoids ; normalizing that segment gives the shorter great-circle arc, so is geodesically convex. Conversely, suppose is geodesically convex. For nonzero , write , with and . If , then . Otherwise the normalized positive combination lies on the shorter arc from to , hence in , so again . Thus is closed under addition and nonnegative scaling, and is convex.
(Full span of each maximal simplex.) Let . Since has a vertex, . Choose a maximal simplex of ; it is nonempty. Suppose is a proper subspace of . The point has strictly positive coordinates in the independent list . The common vertices span by step 1.1, so some common vertex lies outside . For , convexity gives , and . Take for . There are finitely many faces of , so one face has for infinitely many . Along that subsequence , and step 1.2 makes closed; hence . Since , [F1] gives . The coordinates of in the independent family are all strictly positive, so uniqueness of those coordinates forces . Maximality gives , contradicting . Therefore .
(Empty and one-vertex cases; dimensions.) If has no vertex, its sole face is , step 1.1 gives the empty realization, and the nonempty hypothesis of (2) fails. If it has exactly one vertex , its only nonempty face is ; then is a ray, its span is , and the unique maximal simplex spans it. In the general nonempty case, step 2.1 gives for every maximal simplex. By [F4], and ; hence all maximal simplices have the same dimension, as claimed.
The span of equals : every nonzero point of is a positive scalar multiple of its normalization in , and . This also verifies the span formulation for the single-vertex case and completes (2)–(3).
Depends on
- Coxeter elements, the noncrossing interval [1,c], and the Kreweras map w ↦ w⁻¹c
- 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 Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id
- Real and complex inner-product spaces and their induced length
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Linear subspace of a vector space
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- A finite-dimensional normed subspace is closed
- Cauchy–Schwarz: $|\langle u,v\rangle|\leq\lVert u\rVert\lVert v\rVert$, with equality exactly for linearly dependent vectors
- An abstract simplicial complex
- The geometric realization of an abstract simplicial complex
Used by
Dependency tree · two levels
84 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.