Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-10-08
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 (W,S) be an irreducible finite-type Coxeter system, and let c be the bipartite Coxeter element with positive-root order, ordered root complex X(c), cones c[F], c[Y], and realizations ∣Y∣=c[Y]∩Sn−1⊂V=RS 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 V (Linear subspace of a vector space). Set c[∅]={0}, and let Y,Z be subcomplexes of X(c) (An abstract simplicial complex, The geometric realization of an abstract simplicial complex). Then:

(1) Realization of an intersection. If Y∩Z is the subcomplex consisting of simplices common to both, then c[Y∩Z]=c[Y]∩c[Z],∣Y∩Z∣=∣Y∣∩∣Z∣. If Y and Z have no common vertex, this reads c[Y]∩c[Z]={0} and ∣Y∩Z∣=∅.

(2) Purity under convexity. Suppose Y∩Z has at least one vertex. Put C=c[Y]∩c[Z] and K=∣Y∣∩∣Z∣. If C is convex, then every maximal simplex F of Y∩Z satisfies span⁡(F)=span⁡(C). Under the common-open-half-space condition above, convexity of C is equivalent to geodesic convexity of K: for any two points of K, the shorter great-circle arc between them lies in K. Consequently all maximal simplices have dimension dim⁡span⁡(C)−1, so Y∩Z is pure (all maximal simplices have the same dimension).

(3) Small cases. If Y∩Z consists of one vertex v, its unique maximal simplex is {v} and its span is span⁡(C)=span⁡(v). If Y∩Z has no vertex, then c[Y∩Z]={0}, ∣Y∩Z∣=∅, and (2) is vacuous.

(4) Limits. The result does not identify span⁡(c[Y]∩c[Z]) with span⁡(c[Y])∩span⁡(c[Z]). In particular, it does not determine M(α)∩M(β) for Y=X(α) and Z=X(β). No Choice is used.

Facts & Assumptions

Given: The bipartite ordered root complex X(c) of an irreducible finite-type Coxeter system, and two of its subcomplexes Y,Z.

[F1]

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 F,F′ one has c[F]∩c[F′]=c[F∩F′] (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)).

[F2]

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)).

[F3]

A finite-dimensional subspace of a normed space is closed (A finite-dimensional normed subspace is closed). For each fixed v∈V, x↦⟨x,v⟩ is continuous by Cauchy–Schwarz (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

Proof

technique · use unique simplex carriers for the cone identity, then use a limit point and finiteness of the face set to prove purity

Given: The finite root complex and subcomplexes Y,Z above. Write C=c[Y]∩c[Z] and K=∣Y∣∩∣Z∣.

1.1F1F2

(Cone and realization intersections.) If x∈c[Y]∩c[Z], then x∈c[F] for some face F∈Y and x∈c[F′] for some face F′∈Z. By [F1], x∈c[F∩F′], and F∩F′ is a common face, so x∈c[Y∩Z]. The reverse inclusion follows from Y∩Z⊆Y,Z. Intersecting this cone equality with Sn−1 gives the realization equality. If there is no common vertex, every common face is empty, so the cone intersection is c[∅]={0} and its sphere section is empty.

1.2F1F3F4algebra

(Closed face cones.) The empty-face cone is {0} and is closed. Let F={v1,…,vm} be a nonempty face, U=span⁡(F), and let G=(⟨vi,vj⟩)i,j be its Gram matrix. For any nonzero coefficient vector a, aTGa=∥∑iaivi∥2>0 by independence, so G is invertible. For x∈U, its unique coordinate vector in the basis F is G−1(⟨x,vj⟩)j, whose coordinates are continuous by [F3]. Hence c[F] is the intersection of the closed subspace U with the inverse images of the closed half-line [0,∞) under these coordinate maps; it is closed in V. Since X(c) has finitely many faces, c[Y], c[Z], and C are finite unions or intersections of closed face cones and are closed.

1.3F1algebra

(Cone and spherical convexity.) Every nonzero vector of C is a nonnegative combination of positive-root vertices, so the common open-half-space functional in [F1] is strictly positive on it; in particular K contains no antipodal pair. If C is convex, the segment between any u,v∈K lies in C and avoids 0; normalizing that segment gives the shorter great-circle arc, so K is geodesically convex. Conversely, suppose K is geodesically convex. For nonzero x,y∈C, write x=ru, y=sv with r,s>0 and u,v∈K. If u=v, then x+y∈C. Otherwise the normalized positive combination (ru+sv)/∥ru+sv∥ lies on the shorter arc from u to v, hence in K, so again x+y∈C. Thus C is closed under addition and nonnegative scaling, and is convex.

2.1F1step 1.1step 1.2algebra

(Full span of each maximal simplex.) Let L=span⁡(C). Since Y∩Z has a vertex, L≠{0}. Choose a maximal simplex F of Y∩Z; it is nonempty. Suppose U:=span⁡(F) is a proper subspace of L. The point x:=∑v∈Fv has strictly positive coordinates in the independent list F. The common vertices span L by step 1.1, so some common vertex q lies outside U. For 0<t≤1, convexity gives xt=(1−t)x+tq∈C, and xt∉U. Take tj=1/j for j≥2. There are finitely many faces of Y∩Z, so one face F′ has xtj∈c[F′] for infinitely many j. Along that subsequence xtj→x, and step 1.2 makes c[F′] closed; hence x∈c[F′]. Since x∈c[F], [F1] gives x∈c[F∩F′]. The coordinates of x in the independent family F are all strictly positive, so uniqueness of those coordinates forces F⊆F′. Maximality gives F=F′, contradicting xtj∉U. Therefore span⁡(F)=L.

3.1F2F4step 1.1step 2.1

(Empty and one-vertex cases; dimensions.) If Y∩Z 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 v, its only nonempty face is {v}; then C=c[{v}] is a ray, its span is span⁡(v), and the unique maximal simplex spans it. In the general nonempty case, step 2.1 gives span⁡(F)=L for every maximal simplex. By [F4], ∣F∣=dim⁡L and dim⁡F=dim⁡L−1; hence all maximal simplices have the same dimension, as claimed.

4.1F1step 3.1∎

The span of K equals L: every nonzero point of C is a positive scalar multiple of its normalization in K, and K⊆C. This also verifies the span formulation for the single-vertex case and completes (2)–(3).

Depends on

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.

Sources