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.

Highest-root dominance and the fundamental alcove

Statement

Let Φ⊆E be a reduced crystallographic root system with positive system Φ+, base Δ={αs:s∈S}, and fundamental chamber C:={x∈E:B(x,αs)>0 for every s∈S} (Open and closed Weyl chambers). Decompose Φ into its nonempty irreducible components Φ=⨆i∈IΦi, and put Ei:=span⁡Φi, Δi:=Δ∩Φi, and Φi+:=Φi∩Φ+ (Unique irreducible decomposition). For each i, let θi be the highest root of (Φi,Φi+,Δi) (Existence and uniqueness of the highest root, Height and highest root).

(1) Highest-root bounds, componentwise. For each i, θi=∑s∈Sini,sαs(ni,s∈Z>0),Si:={s∈S:αs∈Φi}, and B(θi,γ)≥0 for every γ∈Φi+. For every x∈C and γ∈Φi+, 0<B(x,γ)≤B(x,θi); in particular, if B(x,θi)<1, then 0<B(x,γ)<1 for every γ∈Φi+.

(2) Fundamental alcove in an irreducible component. For each i define Ai:={x∈Ei:B(x,αs)>0 for every s∈Si, B(x,θi)<1}. Then Ai is nonempty and is the interior of a bounded geometric simplex. It is an open alcove for the affine wall arrangement of Φi. Its closure is Ai‾={x∈Ei:B(x,αs)≥0 for every s∈Si, B(x,θi)≤1}, and has exactly ∣Si∣+1 facets, on the walls Hαs,0 for s∈Si and Hθi,1.

(3) Reducible and degenerate cases. Under the orthogonal sum E=⨁i∈IEi, the product A:=∏i∈IAi is an alcove for the full affine wall arrangement. For Φ=∅, the spanning hypothesis forces E=0; set A=E={0}, the unique alcove. If a component is of type A1, then θi=αs and its factor is Ai={x∈Ei:0<B(x,αs)<1}; products of A1 factors are interpreted factorwise. The later thm-cg-affine-alcove-transitivity-presentation-and-length proves that every alcove is a Wa-translate of A, so these open translates cover precisely the wall complement. No choice principle is used.

Facts & Assumptions

Given: A finite-dimensional real inner-product space (E,B), a reduced crystallographic root system Φ spanning E, a positive system Φ+ with base Δ, and the affine-wall notation of Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group.

[F1]

The nonempty irreducible components Φi are pairwise orthogonal reduced root systems spanning the orthogonal direct sum E=⨁iEi; the empty system occurs only when E=0 (Reduced crystallographic Euclidean root system, Reducible and irreducible root systems, Unique irreducible decomposition).

[F2]

Every positive root has a nonzero nonnegative integral expansion in the simple-root basis, and Δ is a basis of E (Positive systems and simple roots, Simple roots form a signed integral basis).

[F3]

For every nonempty irreducible component there is a unique highest root and it is dominant against every positive root; the root order is defined by nonnegative integral simple-root differences (Existence and uniqueness of the highest root, Height and highest root).

[F4]

The open Weyl chamber C is given by strict positivity on all simple roots; affine alcoves are connected components of the complement of the walls; all alcoves are open (Open and closed Weyl chambers, Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W).

[F5]

The simplex spanned by finitely many affinely independent vertices is their convex hull, with barycentric coordinates; the inner product is positive definite and satisfies Cauchy–Schwarz (The geometric simplex spanned by affinely independent vertices, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F6]

A connected component is the largest connected subset containing each of its points (Connected components, quasicomponents, and totally disconnected spaces).

[F7]

Distinct simple roots pair nonpositively (Distinct simple roots have nonpositive inner product).

[F8]

The Dynkin graph on the simple roots is connected for a nonempty irreducible root system, and two vertices are joined exactly when their inner product is nonzero (Dynkin diagram with edge multiplicity and arrow convention, Cartan matrix of a based root system, Irreducibility and connected Dynkin diagrams).

[F9]

The inner-product norm is homogeneous and satisfies the triangle inequality (The induced length is a norm).

Proof

technique · direct

Given: The data above and, for each nonempty component, its highest root θi.

1.1F1F2algebra

Let v be the regular vector defining Φ+. Its orthogonal projection to Ei has the same nonzero pairings with roots in Φi, so Φi+=Φi∩Φ+ is a positive system on Φi. Its simple roots are Δi=Δ∩Φi: if γ∈Φi+ is a sum γ=β+δ of positive roots of Φ, project the equality to each Ej with j≠i. Each positive root lies in one component; if exactly one summand lies in Ej, its projection is nonzero, and if both lie in Ej, their sum is nonzero because B(v,β+δ)>0. Thus neither summand lies outside Ei. Decomposability in Φi is therefore equivalent to decomposability in Φ. Finally, each root in Φi has only Δi coordinates in the basis Δ, so Δi spans Ei; it is linearly independent as a subset of Δ. Hence the simple-root basis splits into bases Δi of the Ei.

1.2F1F2F3F7F8algebra

Fix i. Write θi=∑s∈Sini,sαs with ni,s∈Z≥0, not all zero, by [F2]. If its support T={s:ni,s>0} were proper, then for every s∈Si∖T, dominance from [F3] and nonpositivity [F7] would give 0≤B(θi,αs)=∑t∈Tni,tB(αt,αs)≤0. Thus every simple root in T is orthogonal to every simple root in Si∖T, so by [F8] the connected Dynkin graph would be disconnected. Hence T=Si, and every ni,s>0. For γ∈Φi+, the finite set Pγ:={η∈Φi+:γ≤η} is nonempty. It has a maximal element η because it is finite. If η≤η′ for a positive root η′, then transitivity gives γ≤η′, so η′∈Pγ and maximality forces η′=η. Thus η is maximal among all positive roots, and uniqueness of the highest root in [F3] gives η=θi. By the root-order definition in [F3], θi−γ=∑s∈Simsαs with ms∈Z≥0. For x∈C, each B(x,αs)>0, so B(x,γ)>0 by [F2] and B(x,θi)−B(x,γ)=∑s∈SimsB(x,αs)≥0. The dominance inequality B(θi,γ)≥0 is [F3]. If B(x,θi)<1, the displayed bound gives B(x,γ)<1 as well.

1.3F2F5F9algebra

Fix i, write n=∣Si∣≥1, and define the linear map Ti:Ei→RSi by Ti(x)s=ni,sB(x,αs). Its kernel is zero: if every coordinate vanishes, then x is orthogonal to the basis Δi, hence to all of Ei, and positive definiteness gives x=0. The domain and codomain both have dimension n, so Ti is bijective. Its coordinate functionals are continuous by Cauchy–Schwarz, so Ai=Ti−1({u:us>0, ∑sus<1}) is open. It is nonempty, since us=1/(2n) gives a point of it, and it is convex; it is exactly the interior of the closed coordinate simplex below. Its closure is Ti−1({u:us≥0, ∑sus≤1}): continuity gives one inclusion; for any u in that closed set, put x=Ti−1(u) and x∗=Ti−1(u∗), where us∗=1/(2n). Then xt=(1−t)x+tx∗ lies in Ai for 0<t≤1, and ∥xt−x∥B=t∥x∗−x∥B→0, proving the other inclusion. The closed coordinate simplex is the convex hull of 0 and the standard coordinate vectors es, which are affinely independent; its inverse image is therefore a geometric simplex. Every point in the closure is ∑susTi−1(es) with 0≤us≤1, so by [F9] its norm is at most ∑s∥Ti−1(es)∥B. Its barycentric coordinates are us and u0=1−∑sus. Each of the n+1 equalities us=0 or u0=0 cuts out an (n−1)-dimensional face; every boundary point satisfies one of these equalities, so these are exactly the facets. These coordinate facets correspond to Hαs,0 and Hθi,1.

2.1F4F6step 1.2step 1.3algebra

On Ai, step 1.2 gives 0<B(x,γ)<1 for every positive root γ∈Φi+; for a negative root −γ it gives −1<B(x,−γ)<0. Hence no integer level Hβ,k for β∈Φi meets Ai. For nonempty J equal to a singleton {i} or to all components I, the set AJ:=∏j∈JAj is nonempty, convex, and avoids every wall of the arrangement on EJ:=⨁j∈JEj. Let DJ be the connected component of that wall complement containing a point x∈AJ. For each simple root αs in these components, the continuous function y↦B(y,αs) has no zero on DJ and is positive at x, so its negative and positive preimages cannot both be nonempty, since they would separate DJ; it therefore stays positive throughout DJ. For each j∈J, the function y↦B(y,θj)−1 likewise has no zero on DJ and is negative at x, so it stays negative. Thus DJ⊆AJ. Since AJ is connected and meets DJ, maximality of the connected component gives AJ⊆DJ, hence AJ=DJ. Taking singleton J proves that each Ai is an alcove; taking J=I proves that A is an alcove for the full arrangement when I is nonempty. By [F4] these components are open, as claimed.

3.1F1step 1.3step 2.1algebra∎

If Φ=∅, then E=0 by [F1], the wall arrangement is empty, and its complement has the single component {0}. If Φi={±αs} is of type A1, its positive roots contain only its simple root αs, so θi=αs and the two inequalities defining Ai are exactly 0<B(x,αs)<1. The product statement already established applies independently to every component, including any collection of A1 factors. The proof constructs only finite component decompositions, finite coordinate vectors, and finite sums; no axiom of choice is used.

Depends on

Used by

Dependency tree · two levels

60 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