Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations

Definition

Let (W,S) be an irreducible Coxeter system of finite type with S finite, n:=∣S∣≥1, and let αi, Ri, c, h, (ρi), (μi), μ, Φ+, ≤T, M and tα be as in 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], so Φ+={ρ1<ρ2<⋯<ρnh/2} in the global order. Write R(α) for the reflection with normal α and Sn−1:={x∈V:B(x,x)=1}.

(1) The complex X(c). Its vertex set is Φ+. For 1≤i<j≤nh/2, join ρi to ρj by an edge exactly when R(ρj)R(ρi)≤Tc. Let X(c) contain the empty simplex and every finite nonempty set of vertices whose every two-element subset is an edge. Thus X(c) is the abstract simplicial complex (An abstract simplicial complex) determined by this ordered edge relation.

(2) The subcomplexes X(σ). For σ≤Tc, put Pσ:={α∈Φ+:tα≤Tσ} and let X(σ) be the full subcomplex of X(c) on the vertex set Pσ. For a positive root ρ in the global order, let X(σ,ρ) be the full subcomplex on vertices in Pσ∩M(σ) that are less than or equal to ρ; thus X(σ,τi) has vertex set {τ1,…,τi} when Pσ={τ1<⋯<τt}.

(3) Positive cones and realizations. Every vertex is a unit vector. For a finite set F of vertices define c[F]:={∑v∈Fλvv:λv≥0},c[∅]:={0}. For a subcomplex Y put c[Y]:=⋃F∈Yc[F] and ∣Y∣:=c[Y]∩Sn−1, its positive-cone realization in the unit sphere. For σ≤Tc and a positive root ρ, write Y(σ,ρ):=c[{τ∈Pσ∩M(σ):τ≤ρ}].

(4) Abstentions. This definition does not assert that c[F] is nondegenerate for each simplex F, that ∣F∣ is a spherical simplex, that the cone realization embeds X(c) or any X(σ), or that these realizations are convex or have dimension ℓT(σ)−1. It also does not assert an equivalence between higher simplex membership and a single full-tuple product condition. No Choice is used.

Depends on

Used by

Dependency tree · two levels

34 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