Alphabeta Math
TheoremStatement: 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 separating-root lemma, the exact facet halfspaces of the added cones, and the spherical convexity 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, 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], fix σ≤Tc, σ≠1, put k=ℓT(σ), and write Pσ={τ1<⋯<τt}. If n=1, set Pσ={τ1} and θ1=τ1; if n≥2, write θ1<⋯<θk as in (4)(iv) of The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]. For τ∈Pσ define μ(τ)±:={x∈V: ±B(x,μ(τ))≥0},c[Pσ]:={∑τ∈Pσλττ:λτ≥0}. For θk≤τi≤τt put Z(σ,τi):=M(σ)∩⋂j=1kμ(θj)+∩⋂j=i+1tμ(τj)−. Then:

(1) The separating-root lemma. If τa,τs∈Pσ satisfy τa≥θk, τs<τa, τs∉{θ1,…,θk} and B(τa,μ(τs))=0, there are τb,τc∈Pσ with τb,τc<τa, B(τb,μ(τa))=B(τc,μ(τa))=0, and B(τb,μ(τs))>0>B(τc,μ(τs)).

(2) The facet induction. For every index i with θk≤τi≤τt, c[X(σ,τi)]=Y(σ,τi)=Z(σ,τi). The cone is full-dimensional in M(σ), closed and convex. Every facet is contained in one of the hyperplanes M(σ)∩μ(θj)⊥ (1≤j≤k) or M(σ)∩μ(τj)⊥ (j>i). Some listed halfspaces may be redundant; only nonredundant active inequalities support facets. This includes rank one and the empty base at the start of the rank induction.

(3) Spherical convexity and intersection. ∣X(σ)∣=Sn−1∩c[X(σ)]=Sn−1∩M(σ)∩⋂j=1kμ(θj)+=Sn−1∩c[Pσ]. This set is spherically convex: the shorter great-circle arc between any two of its points lies in it. For α,β≤Tc, ∣X(α)∩X(β)∣=∣X(α)∣∩∣X(β)∣, using the common-face cone intersections of The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (4).

(4) Limits. This theorem asserts nothing about M(α)∩M(β) for arbitrary α,β≤Tc, the lattice property of [1,c], or X(σ) for σ̸≤Tc. No Choice is used.

Facts & Assumptions

Given: The irreducible finite-type Coxeter system and the bipartite data 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], together with σ≤Tc, σ≠1, k=ℓT(σ) and Pσ={τ1<⋯<τt}.

[F1]

The conditional map μ(v)=−2(C−id)−1v=2(id−C)−1v is defined, C=ρ(c) is a B-isometry, ρi enumerate Φ+ in the global order, and μ(ρi)=μi. 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

[F2]

For each positive root a, μ(a)∈F(R(a)c), B(μ(a),a)=1, and for positive roots a<b in the global order, B(μ(a),b)≥0 while B(μ(b),a)≤0. 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]

[F3]

Wσ={w:M(w)⊆M(σ)} is the finite reflection subgroup whose positive roots are Pσ. Since M(tα)=Rα, this gives Pσ=Φ+∩M(σ). For n≥2 it has a simple system Δ={δ1,…,δk}, every root in Pσ is a nonnegative combination of Δ, and the reordered roots θ1<⋯<θk give a reduced factorization σ=R(θk)⋯R(θ1). The prefix roots ϵj=R(δ1)⋯R(δj−1)δj are positive. The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (4)(i)-(iv) The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)

[F4]

The inversion set is N(w)={α∈Φ+:wα∈Φ−}. For a reduced expression w=s1⋯sm, its prefix roots s1⋯si−1αsi are exactly N(w−1), and are pairwise distinct positive roots. The geometric inversion set N(w) of an element of a Coxeter group The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (2)

[F5]

ℓT(w)=dim⁡M(w); absolute order is the reflection-length order; it has the triangle inequality and conjugation invariance; and if u,v≤Tc, then u≤Tv exactly when M(u)⊆M(v). 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)-(3)

[F6]

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

[F7]

For an increasing root tuple a1<⋯<am, its set is a simplex of X(c) exactly when the reverse product R(am)⋯R(a1) lies below c and has reflection length m; every face has independent vertices, and all positive-root vertices lie in a common open halfspace. If Pσ={τ1<⋯<τt}, the prefix complexes are nested and each new simplex at τi+1 is a cone over a face in μ(τi+1)⊥. The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (1)-(3)

[F8]

The ordered complex, its full subcomplexes, cones, and inclusive root prefixes have the definitions of The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations (1)-(3). In particular X(σ,τi) contains precisely the vertices τ1,…,τi.

[F9]

The root-reflection map a↦ta is a bijection from positive roots to reflections; distinct positive roots give distinct reflecting involutions; R(a)x=x−2B(x,a)a has determinant −1 and moved line Ra for unit roots; reflections act on roots by their orthogonal root action; and positive roots have norm one. The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1) The real Coxeter form, its radical, reflections, and form-preserving maps (3) Root sign coherence and the action of simple reflections on positive roots

[F10]

If ℓT(u)=2 and Pu={τ1<⋯<τt}, then {τ1,τt} is a simple system of Pu (so every root in Pu is a nonnegative combination of these endpoints), u=R(τ1)R(τt)=R(τ2)R(τ1)=⋯=R(τt)R(τt−1), and B(τ1,τt)≤0. The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (4)(i),(v)

[F11]

A nonempty simplex cone in X(σ) is pointed and its normalized map is an embedding; cones of two faces intersect in the cone on their common face. The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (2),(4)

[F12]

A finite abstract simplicial complex is closed under taking subsets; an empty face is permitted and has dimension −1. An abstract simplicial complex

[F13]

For a linear map between finite-dimensional vector spaces, dim⁡ker⁡f+dim⁡im⁡f=dim⁡V. Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T

[F14]

A finite-dimensional real inner-product space has induced norm ∥v∥=B(v,v). Real and complex inner-product spaces and their induced length

[F15]

The simple roots are a basis, and the positive roots are exactly the roots with nonnegative simple-root coordinates (the negative roots have nonpositive coordinates). Root sign coherence and the action of simple reflections on positive roots (1)-(2)

Proof

technique · first identify the roots inverted by each interval element; then prove the separating-root statement; finally use a nested rank and root-index induction, transporting each facet normal across the new apex
1.1F3F4

Inversion inside a subinterval. If n=1, (1) is vacuous because Pσ has only its single positive root. Assume n≥2. Fix u≤Tc, u≠1, and let Δu={d1,…,dm} be the simple system of Pu given by [F3]. The item-18 factorization, in its second form with index 1, is u=R(d1)⋯R(dm); it is reduced because ℓT(u)=m. Apply the inversion formula [F4] to the finite Coxeter system Wu with simple system Δu. Its positive roots are exactly Pu, so {α∈Pu:u−1α∈−Pu}={ε1,…,εm}={θ1,…,θm}, where the prefix roots are εj=R(d1)⋯R(dj−1)dj. The action of u preserves M(u), so a root in M(u) is negative in this subsystem exactly when it is negative in the ambient positive system. Thus for α∈Pu∖{θ1,…,θm}, u−1α∈Pu.

1.2F2F3F5F6F7F9F10F15

The first separator. Write s=R(τs) and a=R(τa). Since B(μ(τs),τa)=0, [F2] and [F6] give τa∈M(sc) and hence a≤Tsc. The distinct reflections s,a have product determinant +1 and nonidentity image, whereas every reflection has determinant −1; hence ℓT(sa)=2. Writing sc=az gives c=saz with 2+ℓT(z)=ℓT(c), so sa≤Tc. Its moved space is contained in M(σ) because both normals lie there, hence [F5] gives sa≤Tσ. The rank-two statement [F10] applied to sa shows that τs and τa are the ordered endpoints of the simple system of Psa. Put τb:=R(τa)τs=τs−2B(τs,τa)τa. The endpoint pairing in [F10] makes this a nonzero nonnegative combination of the endpoints; [F9] says it is a root, and [F15] makes it positive because its simple-root coordinates are nonnegative. The reflection R(τa) preserves M(sa), so τb∈Psa. The endpoints are the least and greatest roots of Psa, hence τs≤τb≤τa; equality τb=τa would imply τs=−τa, so τb<τa. Thus τb∈Pσ as sa≤Tσ. The pair (τb,τa) has reverse product R(τa)R(τb)=sa≤Tc of length 2, so [F7] gives B(μ(τa),τb)=0. Also B(μ(τs),τb)=B(μ(τs),τs−2B(τs,τa)τa)=1>0.

1.3F1F2F14

The linear map and finite facet test. Regard C=ρ(c) as an orthogonal operator. Since C−I is invertible, μ=2(I−C)−1 and μ+μ∗=2(I−C)−1+2(I−C−1)−1=2I, because (I−C−1)−1=−(I−C)−1C. Thus for every unit root x, B(μ(x),x)=1. We will use the following finite polyhedral observation at each induction stage: if a full-dimensional cone in a finite-dimensional space is given by finitely many homogeneous linear inequalities, delete the redundant inequalities. For each remaining inequality g≥0, nonredundancy gives a point satisfying the other inequalities but with g<0; join it to an interior point where every remaining inequality is strict. The segment meets g=0 while all other inequalities remain strict, so g=0 cuts out a facet. Conversely each facet has a relative-interior point where at least one defining inequality is active, and that active hyperplane contains the facet. Hence the cone is the intersection of its active facet halfspaces. This proves the finite facet test without treating a redundant constraint as a facet.

1.4F1F2F3F7F8F9F12

The inclusions and rank base. The root-reflection dictionary and the definition of Wσ give Pσ=Φ+∩M(σ). For n≥2, the wall statement (4)(iii) of item 18 and B(μ(ϵj),ϵj)=1 from [F2] show that μ(ϵj)⋅δl=1 for l=j and 0 otherwise: the wall makes the off-diagonal pairings zero, and ϵj−δj is a combination of earlier simple roots. Thus the restrictions B(μ(ϵj),−)∣M(σ) form the basis dual to Δ. Since the θj are a reordering of the ϵj, the restricted pairing functionals B(μ(θj),−)∣M(σ) are this same dual basis in a different order. Therefore [F3] gives B(μ(θj),τ)≥0 for every τ∈Pσ. For n=1 the same inequalities follow directly from Pσ={θ1}. If τ≤τi and j>i, then τ<τj, so [F2] gives B(μ(τj),τ)≤0. Consequently Y(σ,τi)⊆Z(σ,τi); by definition c[X(σ,τi)]⊆Y(σ,τi). If k=1, then Pσ={θ1}: it is the positive root set on the one-dimensional space M(σ), and unit normalization leaves one positive root. The only eligible prefix is the singleton, c[X(σ,θ1)]=R≥0θ1=M(σ)∩μ(θ1)+, whose sole facet is the origin in μ(θ1)⊥; this includes the empty base X(1)={∅} with cone {0}. Suppose henceforth k≥2, and let i0 be the unique index with τi0=θk.

2.1F1F2F3F4F5F6F7F9

The opposite separator. Set τc:=σ−1τs. By [F1], τs∈Pσ; the hypothesis excludes the inversion roots in [F3], so [F4] and step 1.1 imply τc∈Pσ. Put t:=R(τs) and u:=tσ. Write σ=tu0 with additive reflection lengths, so u=u0 and u0−1σ=u0−1tu0 has length 1; hence u≤Tσ. If c=σv is reduced, then tc=u0v and ℓT(tc)=n−1=ℓT(u0)+ℓT(v) because t≤Tσ≤Tc, so also u≤Ttc. The vector μ(τs) is fixed by tc by [F2], hence by u using [F5]-[F6]. Let p be the orthogonal projection of μ(τs) onto M(σ). Its residual lies in F(σ)⊆F(u), so p∈F(u) as well; projection preserves its pairing with τs∈M(σ), giving B(p,τs)=1. Therefore σp=tp=p−2τs. Since στc=τs and σ is an isometry, B(μ(τs),τc)=B(p,τc)=B(σp,τs)=B(p−2τs,τs)=−1. By [F2], if τs<τc then this pairing is nonnegative, and equality of the roots would give 1; thus τc<τs<τa. Since sσ=σR(τc) and sa≤Tσ, one has a≤Tsσ=σR(τc). Write sσ=az with ℓT(z)=k−2. Then σ=azR(τc) and (aR(τc))−1σ=R(τc)zR(τc) has length k−2 by conjugation invariance. The distinct reflections a and R(τc) have product of determinant +1 and this product is nonidentity, so its reflection length is 2; the length equality therefore gives aR(τc)≤Tσ≤Tc. Now [F7] gives B(μ(τa),τc)=0. Together with step 1.2 this proves (1).

2.2F2F3F5F7

Base of the root-index induction. Put σ0:=R(θk)σ=R(θk−1)⋯R(θ1). The prefix {θ1,…,θk−1} is a face of the canonical k-simplex by [F7], so σ0≤Tc and ℓT(σ0)=k−1. The tuple θ1<⋯<θk−1 is eligible for σ0, so [F3]'s componentwise minimality makes its canonical tuple θ1′<⋯<θk−1′ satisfy θj′≤θj for every j. In particular θk−1′<θk, and appending θk to this tuple gives an increasing reduced tuple for σ; componentwise minimality for σ gives θj≤θj′ for j<k. Thus θj′=θj for every j<k. Also M(σ0)=span⁡(θ1,…,θk−1). The dual-basis result of step 1.4 makes B(μ(θk),τ)≥0 for every τ∈Pσ, while root order makes this pairing nonpositive when τ<θk by [F2]; hence every such τ lies in M(σ)∩μ(θk)⊥. This hyperplane has dimension k−1 and contains the independent roots θ1,…,θk−1, so M(σ0)=M(σ)∩μ(θk)⊥. Since θk−1<θk=τi0, the prefix ending at τi0−1 is eligible for σ0. Every τj<θk has B(μ(θk),τj)≥0 by the dual-basis result above and ≤0 by the global order, so these earlier roots lie in M(σ0)=M(σ)∩μ(θk)⊥. Conversely Pσ0⊆Pσ by [F3]. Thus the two prefix vertex sets, and hence their full subcomplexes, agree: F0:=X(σ,τi0−1)=X(σ0,τi0−1). The lower-rank induction gives c[F0]=Z(σ0,τi0−1), a full-dimensional convex cone in L0:=M(σ0) with facet supports restricted from μ(b)⊥ for roots b∈Pσ0.

2.3F1F3F5F6F9F14step 1.3

Transporting the base facets through an apex. The following calculation applies both to the base apex a=θk and to an inductive apex a=τi+1. Let L=M(σ)∩μ(a)⊥=M(R(a)σ), let F be the already established full-dimensional base cone in L, and let a facet of F have support the restriction of μ(b)⊥ for some b∈PR(a)σ⊆L. Put E:=M(σ) and Va:=F+R≥0a. For x∈E, the decomposition x=y+ta, with t=B(x,μ(a)) and y∈L, is unique. Thus x∈Va exactly when t≥0 and y∈F. If a facet of F is given by εB(y,μ(b))≥0 with ε∈{1,−1}, its transported inequality is εB(x,ν)≥0, where ν:=μ(b)−B(μ(b),a)μ(a); it vanishes at a and agrees with μ(b) on L. Since B(μ(a),b)=0 and μ+μ∗=2I, B(μ(b),a)=2B(b,a), so ν=μ(b−2B(b,a)a)=μ(R(a)b). The equality of F with the intersection of its active facet halfspaces therefore gives a finite halfspace presentation of Va in E by B(x,μ(a))≥0 and the transported inequalities; step 1.3 identifies its nonredundant inequalities with its facets. The vector R(a)b is a signed root in M(σ), so its positive representative r belongs to Pσ by [F3]. Thus every non-base facet of Va is a root-wall facet.

2.4F1F2F3F5F6F7F9F10F13F15step 1.1

Inductive root-prefix step. Suppose i≥i0 and Ki:=c[X(σ,τi)]=Z(σ,τi). Put a:=τi+1 and σ′:=R(a)σ. Since R(a)≤Tσ≤Tc, write c=σv with ℓT(v)=n−k and σ=R(a)σ′. Then R(a)c=σ′v; also ℓT(R(a)c)=n−1, since R(a)≤Tc, so σ′≤TR(a)c≤Tc and ℓT(σ′)=k−1. The subspace M(σ′) lies in M(σ) because σ and R(a) preserve M(σ), and it lies in M(R(a)c)=μ(a)⊥ by absolute-order monotonicity. Both M(σ′) and M(σ)∩μ(a)⊥ have dimension k−1: the latter is the kernel of the nonzero functional x↦B(x,μ(a)) on M(σ), which is nonzero on a∈M(σ) since B(a,μ(a))=1. Hence M(σ′)=M(σ)∩μ(a)⊥ and Pσ′=Pσ∩μ(a)⊥. The link base F on the old vertices orthogonal to μ(a) satisfies c[F]=Ki∩μ(a)⊥: all old vertices have nonpositive pairing with μ(a), so a nonnegative combination pairs to zero exactly when it uses only zero-pairing vertices. Thus F=X(σ′,τi). Let ϵ1′,…,ϵk−1′ be the prefix roots for the canonical simple system of σ′. They lie in M(σ′), so B(μ(a),ϵj′)=0. If ϵj′>a, the distinct reflections R(a) and R(ϵj′) have product length 2 by the determinant argument in [F9]. Since R(ϵj′)≤TR(a)c, write R(a)c=R(ϵj′)v with ℓT(v)=n−2; then c=R(a)R(ϵj′)v is reduced, so R(a)R(ϵj′)≤Tc. By [F10] and the increasing order a<ϵj′, this is the endpoint factorization of the rank-two element w:=R(a)R(ϵj′), so B(a,ϵj′)≤0. The root d:=R(a)ϵj′=ϵj′−2B(ϵj′,a)a is a nonzero nonnegative combination of the endpoints; hence has nonnegative simple-root coordinates and is positive by [F15]. Since it lies in M(w), [F3] puts it in Pw; it cannot equal a, since that would imply ϵj′=R(a)a=−a. Thus a<d in the global order. Since a,ϵj′∈M(σ) and R(a) preserves M(σ), this positive root lies in Pσ=Φ+∩M(σ). Now σ′−1ϵj′=σ−1d is negative by step 1.1 applied to σ′, so step 1.1 applied to σ gives d∈{θ1,…,θk}, contradicting d>a≥θk. Hence every ϵj′<a, and therefore θk−1′≤τi. Let b be the last root of Pσ′ at or below τi; it exists since θk−1′ is such a root, and b≥θk−1′. Then F=X(σ′,τi)=X(σ′,b), so lower-rank induction gives c[F]=Z(σ′,b), full-dimensional and convex in L=M(σ′).

3.1F2F3F7step 2.1step 1.3step 1.4step 2.3

Initial cone and its facets. Let Ki0:=c[X(σ,θk)]. By [F7], Ki0=c[F0]+R≥0θk, so it is a full-dimensional convex cone. The base support is μ(θk)⊥; each other facet has support μ(r)⊥ for a positive root r∈Pσ by step 2.3. It contains the apex, so B(μ(r),θk)=0. If r<θk and r∉{θ1,…,θk}, step 2.1 gives two roots of F0 on opposite sides of μ(r)⊥, contradicting that it supports the cone. Hence every side facet is labelled by a θj or a root r>θk. The θj inequalities have positive sign on Ki0 by [F3], the base apex inequality is positive on θk and zero on F0, and each later-root inequality is nonpositive on all vertices of the prefix. The finite facet test of step 1.3 therefore gives Z(σ,θk)⊆Ki0. With the reverse inclusion from step 1.4, equality holds at i0; the same facet argument records that any other listed halfspace not defining one of these facets is redundant.

3.2F2F3F6F7step 2.1step 1.3step 1.4step 2.3step 2.4

The new prefix is X(σ,τi+1)=X(σ,τi)∪(a∗F) by [F7], so its cone is Ki+1=Ki∪Va with Va=c[F]+R≥0a. Apply step 2.3 to each facet of F; every facet of Va is supported by μ(a)⊥ or by μ(r)⊥ for r∈Pσ. Each side facet contains a, so B(μ(r),a)=0. If r<a and r is not a θ-root, step 2.1 produces two vertices of F on opposite sides of μ(r)⊥, contradicting support. Thus every facet label is a θj, a, or a root r>a. Its containing halfspace is respectively μ(θj)+, μ(a)+, or μ(r)−, by the sign inequalities in [F2]-[F3]. The cone Z(σ,τi+1)∩μ(a)+ satisfies all these facet halfspaces; step 1.3 therefore puts it in Va. Its other half Z(σ,τi+1)∩μ(a)− equals Z(σ,τi)=Ki. Consequently Z(σ,τi+1)⊆Ki+1. The reverse containment follows from step 1.4, proving Ki+1=Z(σ,τi+1). The active-facet list is a subset of the defining inequalities; any omitted or repeated inequality is recorded as redundant.

4.1F7step 1.4step 3.1step 3.2

Endpoint. The induction ends at i=t, where Y(σ,τt)=c[Pσ]. Thus the endpoint equality gives both the full positive-root cone and the claimed intersection with M(σ) and the μ(θj)+ halfspaces.

5.1F7F14step 4.1

Spherical convexity. The cone Z(σ,τt) is convex, and every nonzero vector in it lies in the common open halfspace of the positive roots by [F7]. For unit vectors x,y in its sphere section, write ϕ=arccos⁡B(x,y)<π. If ϕ=0 the arc is constant. Otherwise put e=(y−cos⁡ϕ x)/sin⁡ϕ, so B(e,x)=0 and B(e,e)=1. The shorter great-circle arc is γ(s)=cos⁡(s)x+sin⁡(s)e=sin⁡(ϕ−s)sin⁡ϕx+sin⁡ssin⁡ϕy for 0≤s≤ϕ. Its coefficients are nonnegative, so γ(s) lies in the convex cone and has unit norm. This proves spherical convexity.

6.1F11F12step 4.1∎

Since X(α) and X(β) are full subcomplexes of the finite complex X(c), every face cone of their intersection is a common face. If a point belongs to both c[X(α)] and c[X(β)], it lies in cones c[F] and c[F′] for faces in the respective subcomplexes; [F11] identifies their intersection with c[F∩F′], which lies in the cone of the common subcomplex. Intersecting the resulting cone equality with Sn−1 proves the realization identity in (3). All inductions are finite and use no Choice. The theorem does not assert a meet of moved spaces or the lattice property of [1,c].

Depends on

Used by

Cited to discharge well-definedness by The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations.

Dependency tree · two levels

89 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