Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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.

The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma)

Statement

With the notation of The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations and the conclusions of The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]:

(1) Factorization criterion. For any strictly increasing tuple a1<a2<⋯<ak of roots in Φ+, including the empty tuple when k=0, ℓT(R(a1)R(a2)⋯R(ak)c)=n−k  ⟺  μ(ai)⋅aj=0for every i>j.

(2) Linear independence and spherical simplices. If F={a1<⋯<ak} is a nonempty simplex of X(c), then a1,…,ak are linearly independent and lie in a common open halfspace, namely {x:B(x,f)>0} for every f∈C∘. Thus c[F] is a pointed simplicial cone and ∣F∣:=c[F]∩Sn−1 is a spherical simplex of dimension k−1. The empty face has c[∅]={0} and ∣∅∣=∅. For any increasing tuple of positive roots, its set is a simplex of X(c) if and only if its reverse product R(ak)⋯R(a1) lies below c in absolute order and has reflection length k.

(3) The complex structure and its dimension. For every σ≤Tc, the full subcomplex X(σ) is a finite simplicial complex of dimension ℓT(σ)−1; in particular X(1)={∅} has dimension −1. Each X(σ,ρ) is a simplicial complex. If Pσ={τ1<⋯<τt}, then X(σ,τi)⊆X(σ,τi+1)(1≤i<t), and the simplices of X(σ,τi+1) not already in X(σ,τi) are exactly the cones B∪{τi+1} over faces B of X(σ,τi) whose vertices all lie in μ(τi+1)⊥. The empty face is allowed as a base, giving the new singleton vertex.

(4) Geometric intersections are common faces. For any two faces F,F′ of X(σ), c[F]∩c[F′]=c[F∩F′]. Consequently, the normalized cone map from the ordinary geometric realization of X(σ) to Sn−1 is an embedding onto ∣X(σ)∣, and this image is a finite union of spherical simplices that pairwise meet in common faces. No Choice is used.

Facts & Assumptions

Given: An irreducible finite-type Coxeter system (W,S) with ∣S∣=n≥1, the bipartite Coxeter element c, its linear action CV=ρ(c), the ordered positive roots Φ+, the vectors μi and map μ of 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]. Let R(a) be the reflection with root normal a, and use the absolute order, moved spaces and positive-cone complexes of The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations.

[F1]

CV−idV is invertible, ρi+n=CVρi, and Φ+={ρ1,…,ρnh/2}. Hence M(c)=V. The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (3)-(4)

[F2]

The map Φ+→T, a↦ta, is a bijection; ρ(ta)=R(a), and distinct positive roots determine distinct reflections. The canonical reflection homomorphism, roots, reflections, and the positive cone (1)-(2) The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)

[F3]

Since W is finite, B is positive definite and every ρ(w) is a B-isometry. Carter's formula gives ℓT(w)=dim⁡M(w)=n−dim⁡F(w) for every w. Absolute order is the partial order defined by reflection-length additivity; it has the triangle inequality and conjugation invariance, and u≤Tv implies M(u)⊆M(v) and F(v)⊆F(u). Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)-(2)

[F5]

Every subspace U⊆M(A) has an orthogonal restriction AU≤OA with moved space U, and every line is the moved space of a unique orthogonal reflection. Carter's formula transfers this restriction order to absolute order for group elements. The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order (3)-(4) Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)

[F6]

Writing a=ρi and using μ(ρi)=μi, one has μ(a)∈F(R(a)c), this fixed space is a line, and μ(a)⋅a=1. Also μi⋅ρj≥0 if i≤j, μi⋅ρj≤0 if i>j within the positive-root range, and μi+t⋅ρi=0 for 1≤t≤n−1. For n=1, CV=−id and μ=id, so R(α1)c=1 has the one-dimensional fixed space V and B(μ(α1),α1)=1; the strict-order sign conditions and the range 1≤t≤n−1 are empty. The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (4) The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (1)-(2)

[F7]

Every root has B-norm 1; every positive root is a nonzero vector with nonnegative simple-root coordinates; and for every f∈C∘ and a∈Φ+, B(f,a)>0. Root sign coherence and the action of simple reflections on positive roots (1)-(2)

[F8]

For a root normal a of norm 1, R(a)(x)=x−2B(x,a)a; it fixes the codimension-one kernel of B(−,a) and negates a, so its determinant is −1. The real Coxeter form, its radical, reflections, and form-preserving maps (3)

[F9]

For n≥2 and σ≠1, Pσ is the positive-root set of the reflection subgroup Wσ and contains the simple system Δ={δ1,…,δk}. The roots εi=R(δ1)⋯R(δi−1)δi are positive, factor σ=R(εk)⋯R(ε1), and their increasing reordering θ1<⋯<θk has reverse product below c with reflection length k=ℓT(σ). The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (4)(i)-(ii),(iv)

[F10]

X(c) has the ordered pairwise-edge definition, X(σ) and X(σ,ρ) are full subcomplexes with X(σ,τi) on vertices τ1,…,τi, and c[∅]={0}. The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations (1)-(3)

[F11]

An abstract simplicial complex contains the empty simplex and is closed under taking subsets; its geometric realization has the weak topology determined by its finite simplices. An abstract simplicial complex The geometric realization of an abstract simplicial complex

[F12]

A positive-definite Gram matrix with diagonal 1 defines a spherical simplex; for linearly independent unit vectors its cone section of the sphere is a spherical simplex of dimension one less than the number of vertices, and the radial normalization of the Euclidean simplex onto that section is a homeomorphism. Spherical Gram simplices and angular links of Euclidean faces Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (i)-(ii)

[F13]

The vectors βs form the B-dual basis to the simple roots αs, so B(∑sβs,αt)=1 for every t∈S. The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (3)

[F14]

A list is linearly independent exactly when its only vanishing linear combination has all coefficients zero; the empty set is a basis exactly in the zero space. Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis

[F17]

The chamber interior C∘ is the transfer, under v↦B(v,⋅), of the dual chamber interior. The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset

Proof

technique · derive the ordered-factorization test from absolute order and the fixed-space vectors, then use it to identify the faces, their dimensions, and the intersections of their positive cones
1.1F1F2F3F5F8

By [F1], M(c)=V and ℓT(c)=n. For every a∈Φ+, [F2] gives ta with ρ(ta)=R(a), and [F8] gives its moved line Ra. Apply the subspace-restriction theorem [F5] to this line inside M(c); its orthogonal restriction is the unique reflection with normal a, so Carter's formula gives ta≤Tc. Thus every positive-root reflection lies below c.

1.2F2F3F8

Let q=t1⋯tm be a reduced reflection factorization. Each factor tr lies below q: if q=xtry, then trq=(trxtr)y is a product of m−1 reflections, so the triangle inequality forces ℓT(trq)=m−1. If r<s, the product trts has reflection length 2 when tr≠ts: their canonical images are distinct involutions with distinct moved lines, so ρ(tr)ρ(ts)≠I; its determinant is +1, whereas every reflection has determinant −1. Thus trts is neither the identity nor a reflection, and its reflection length is 2. Write q=xtrytsz. Then (trts)−1q=tstrxtrytsz=(tstrxtrts)(tsyts)z, a product of m−2 reflections. The triangle inequality gives the reverse lower bound m−2, so trts≤Tq.

2.1F1F2F3F4F6F8step 1.1step 1.2

Let q:=R(ak)⋯R(a1). If ℓT(R(a1)⋯R(ak)c)=n−k, then ℓT(q)≤k and [F1], [F3] give n=ℓT(c)≤ℓT(q)+ℓT(q−1c)≤k+(n−k)=n. Thus ℓT(q)=k and q≤Tc, so the factorization of q is reduced. For i>j, step 1.2 gives R(ai)R(aj)≤Tq≤Tc. Since R(ai)≤Tc by step 1.1, ℓT(R(ai)c)=n−1; also ℓT(R(aj)R(ai)c)=n−2. Hence R(aj)≤TR(ai)c. By [F2] and [F8] the moved line of R(aj) is Raj; by [F3] and [F4] it lies in M(R(ai)c)=F(R(ai)c)⊥. The vector μ(ai) spans that fixed line by [F6], so μ(ai)⋅aj=0.

2.2F2F3F4F5F6F14step 1.2

Conversely, suppose μ(ai)⋅aj=0 for all i>j. The matrix D=(μ(ai)⋅aj)i,j=1k is upper triangular with diagonal 1 by [F6]; therefore both the roots ai and the vectors μ(ai) are linearly independent, so k≤n. For k=0 the conclusion is ℓT(c)=n by [F3], so assume k≥1. Define qk+1=1. Descending on i, assume qi+1:=R(ak)⋯R(ai+1)≤Tc with length k−i. Each factor R(aj), j>i, is below qi+1 by the first claim of step 1.2. Complements reverse order: if u≤Tv≤Tw, transitivity gives u≤Tw; writing v=ux and w=vy with additive reflection lengths then gives ℓT(xy)=ℓT(x)+ℓT(y), and conjugation invariance gives ℓT(y−1xy)=ℓT(x), hence y=v−1w≤Tu−1w=xy. Put v:=qi+1−1c. For every j>i, complement reversal gives v≤TR(aj)c, and [F6] puts μ(aj) in F(R(aj)c)⊆F(v). These k−i independent vectors form a basis of F(v): Carter's formula gives dim⁡F(v)=n−ℓT(v)=n−(n−k+i)=k−i. The assumed zero pairings put ai in F(v)⊥=M(v) by [F4]. Restricting ρ(v) to the line Rai gives the orthogonal reflection R(ai)=ρ(tai) by [F2]; the restriction theorem [F5] and Carter's formula therefore give R(ai)≤Tv. Write v=R(ai)z with ℓT(v)=1+ℓT(z). Then c=qi+1R(ai)z, whose displayed k−i+1+ℓT(z)=n reflection factors force the factorization to be reduced; consequently qi:=qi+1R(ai)≤Tc and ℓT(qi)=k−i+1. At i=1 this yields ℓT(q)=k and ℓT(q−1c)=n−k. This proves (1).

3.1F2F3F6F10F14step 1.2step 2.1step 2.2

For i<j, the two-root instance of (1) says R(aj)R(ai)≤Tc⟺μ(aj)⋅ai=0, since the product of two distinct positive-root reflections has length 2 by step 1.2. If F={a1<⋯<ak} is a simplex, every pair is an edge by [F10], so these pairwise equivalences make D=(μ(ai)⋅aj) upper triangular with diagonal 1. Pairing a vanishing combination ∑jλjaj=0 with each μ(ai) gives Dλ=0; hence every λj=0. Thus the vertices of every nonempty face are linearly independent. Conversely, if the reverse product of an increasing tuple lies below c and has length k, step 1.2 applied to its reduced factorization shows each pair product is below c, so the tuple is a simplex. The empty tuple is the empty simplex by [F10].

4.1F3F7F10F12F13F17step 3.1

Let f0:=∑s∈Sβs, with the dual vectors from [F13]. Then B(f0,αs)=1 for every simple root; since each positive root is a nonzero nonnegative combination of simple roots by [F7], every positive root has positive pairing with f0. Also [F7] gives positive pairing with every f∈C∘ by the chamber transfer [F17]. For a nonempty face F, its independent unit roots have a positive-definite Gram matrix with diagonal 1. By [F12], c[F]∩Sn−1 is the associated spherical simplex of dimension ∣F∣−1. The independence of the cone generators makes c[F] pointed and simplicial. For the empty face, [F10] gives c[∅]={0} and its sphere section is empty.

4.2F1F2F3F8F9F10step 3.1

The roots of Pσ lie in M(σ): if a∈Pσ, then ta≤Tσ by definition; [F2] identifies its linear reflection, [F8] gives M(ta)=Ra, and [F3] gives M(ta)⊆M(σ). Thus a face of X(σ) has at most dim⁡M(σ)=ℓT(σ) vertices by step 3.1 and Carter's formula. If σ=1, then Pσ=∅ and X(1)={∅} has dimension −1. If n=1 and σ≠1, the rank-one data give W={1,c}, σ=c, and Pσ={α1}; hence X(σ) has one vertex and dimension 0=ℓT(σ)−1. If n≥2 and σ≠1, [F9] gives Δ={δ1,…,δk}⊆Pσ and εi=R(δ1)⋯R(δi−1)δi. Each R(δj) lies in the reflection subgroup Wσ of [F9], so every εi is a root of that subgroup; its positivity from [F9] puts it in Pσ. Hence the increasing reordering θ1<⋯<θk lies in Pσ. Its reverse product is below c with length k=ℓT(σ) by [F9], so step 3.1 makes it a k-vertex simplex. Therefore dim⁡X(σ)=k−1. Finiteness follows from finiteness of Φ+ in [F1], and the full-subcomplex and X(σ,ρ) claims follow from [F10].

4.3F6F10step 3.1

Let Ki:=X(σ,τi). By [F10], Ki has vertices τ1,…,τi. Any new simplex of Ki+1 must contain the new vertex τi+1. Its other vertices form a face B of Ki, and the two-root criterion of step 3.1 says each such vertex b is joined to τi+1 exactly when μ(τi+1)⋅b=0. Conversely, any face B of Ki with all vertices in this hyperplane gives a simplex B∪{τi+1}. This includes B=∅, proving the cone-over-link description and the nested inclusions.

5.1F6F10step 4.3

Put K0:={∅} and induct on i to prove the cone intersection formula for all faces of Ki. At i=0 both cones equal {0}. Suppose the formula holds at i and consider faces of Ki+1. If both are in Ki, use induction. Otherwise each new face has the form B∪{τi+1} with B∈Ki and every vertex of B orthogonal to μ(τi+1), by step 4.3. For a cone point in such a face, its coefficient on τi+1 is its pairing with μ(τi+1), because μ(τi+1)⋅τi+1=1 by [F6] and its pairings with the base vertices are zero. Every old vertex τj, j≤i, has μ(τi+1)⋅τj≤0 by [F6]. Therefore a cone on an old face intersects a cone with apex τi+1 only where the apex coefficient is zero; there the induction hypothesis identifies the intersection with the cone on the common base face. For two faces both containing the apex, equality of a common cone point gives equality of its apex coefficients after pairing with μ(τi+1), and then equality of the base cone points; induction identifies their base intersection. In each case the intersection is exactly the cone on the common face. Since every face of X(σ) belongs to Kt, this proves the formula in (4).

6.1F1F10F11F12F15F16step 4.1step 4.2step 5.1∎

Define the normalized cone map on a barycentric point of the geometric realization by ι((λv)v∈V(F)):=∑vλvv∥∑vλvv∥B,λv≥0,∑vλv=1. The denominator is nonzero because B(f0,v)>0 for every positive root by step 4.1. Its restriction to each simplex is a homeomorphism onto the corresponding spherical simplex by [F12], and it is continuous globally by the weak-topology definition [F11]. If two such images agree, the two positive combinations lie on the same ray; step 5.1 puts that ray in the cone on the common face, and linear independence of that face plus the barycentric sum-one condition makes the original points equal. Thus ι is a continuous bijection onto ∣X(σ)∣. By [F1] and step 4.2, X(σ) is a finite abstract simplicial complex, so its ordinary realization is compact by [F15]. If A is closed in that realization, [F15] makes A compact; the open-cover argument in [F15] makes ι[A] compact, and it is closed in the Hausdorff sphere by [F15] and [F16]. Thus ι is a closed continuous bijection onto its image and therefore a topological embedding. No Choice is used: the only compactness input is [F15], whose finite-complex proof reduces to finite-dimensional Heine-Borel.

Depends on

Used by

Dependency tree · two levels

156 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