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 be a reduced crystallographic root system with positive system , base , and fundamental chamber (Open and closed Weyl chambers). Decompose into its nonempty irreducible components , and put , , and (Unique irreducible decomposition). For each , let be the highest root of (Existence and uniqueness of the highest root, Height and highest root).
(1) Highest-root bounds, componentwise. For each , and for every . For every and , in particular, if , then for every .
(2) Fundamental alcove in an irreducible component. For each define Then is nonempty and is the interior of a bounded geometric simplex. It is an open alcove for the affine wall arrangement of . Its closure is and has exactly facets, on the walls for and .
(3) Reducible and degenerate cases. Under the orthogonal sum , the product is an alcove for the full affine wall arrangement. For , the spanning hypothesis forces ; set , the unique alcove. If a component is of type , then and its factor is ; products of factors are interpreted factorwise. The later thm-cg-affine-alcove-transitivity-presentation-and-length proves that every alcove is a -translate of , so these open translates cover precisely the wall complement. No choice principle is used.
Facts & Assumptions
Given: A finite-dimensional real inner-product space , a reduced crystallographic root system spanning , a positive system with base , and the affine-wall notation of Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group.
The nonempty irreducible components are pairwise orthogonal reduced root systems spanning the orthogonal direct sum ; the empty system occurs only when (Reduced crystallographic Euclidean root system, Reducible and irreducible root systems, Unique irreducible decomposition).
Every positive root has a nonzero nonnegative integral expansion in the simple-root basis, and is a basis of (Positive systems and simple roots, Simple roots form a signed integral basis).
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).
The open Weyl chamber 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 ).
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: , with equality exactly for dependent pairs).
A connected component is the largest connected subset containing each of its points (Connected components, quasicomponents, and totally disconnected spaces).
Distinct simple roots pair nonpositively (Distinct simple roots have nonpositive inner product).
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).
The inner-product norm is homogeneous and satisfies the triangle inequality (The induced length is a norm).
Proof
Given: The data above and, for each nonempty component, its highest root .
Let be the regular vector defining . Its orthogonal projection to has the same nonzero pairings with roots in , so is a positive system on . Its simple roots are : if is a sum of positive roots of , project the equality to each with . Each positive root lies in one component; if exactly one summand lies in , its projection is nonzero, and if both lie in , their sum is nonzero because . Thus neither summand lies outside . Decomposability in is therefore equivalent to decomposability in . Finally, each root in has only coordinates in the basis , so spans ; it is linearly independent as a subset of . Hence the simple-root basis splits into bases of the .
Fix . Write with , not all zero, by [F2]. If its support were proper, then for every , dominance from [F3] and nonpositivity [F7] would give Thus every simple root in is orthogonal to every simple root in , so by [F8] the connected Dynkin graph would be disconnected. Hence , and every . For , the finite set is nonempty. It has a maximal element because it is finite. If for a positive root , then transitivity gives , so and maximality forces . Thus is maximal among all positive roots, and uniqueness of the highest root in [F3] gives . By the root-order definition in [F3], with . For , each , so by [F2] and The dominance inequality is [F3]. If , the displayed bound gives as well.
Fix , write , and define the linear map by . Its kernel is zero: if every coordinate vanishes, then is orthogonal to the basis , hence to all of , and positive definiteness gives . The domain and codomain both have dimension , so is bijective. Its coordinate functionals are continuous by Cauchy–Schwarz, so is open. It is nonempty, since gives a point of it, and it is convex; it is exactly the interior of the closed coordinate simplex below. Its closure is : continuity gives one inclusion; for any in that closed set, put and , where . Then lies in for , and , proving the other inclusion. The closed coordinate simplex is the convex hull of and the standard coordinate vectors , which are affinely independent; its inverse image is therefore a geometric simplex. Every point in the closure is with , so by [F9] its norm is at most . Its barycentric coordinates are and . Each of the equalities or cuts out an -dimensional face; every boundary point satisfies one of these equalities, so these are exactly the facets. These coordinate facets correspond to and .
On , step 1.2 gives for every positive root ; for a negative root it gives . Hence no integer level for meets . For nonempty equal to a singleton or to all components , the set is nonempty, convex, and avoids every wall of the arrangement on . Let be the connected component of that wall complement containing a point . For each simple root in these components, the continuous function has no zero on and is positive at , so its negative and positive preimages cannot both be nonempty, since they would separate ; it therefore stays positive throughout . For each , the function likewise has no zero on and is negative at , so it stays negative. Thus . Since is connected and meets , maximality of the connected component gives , hence . Taking singleton proves that each is an alcove; taking proves that is an alcove for the full arrangement when is nonempty. By [F4] these components are open, as claimed.
If , then by [F1], the wall arrangement is empty, and its complement has the single component . If is of type , its positive roots contain only its simple root , so and the two inequalities defining are exactly . The product statement already established applies independently to every component, including any collection of factors. The proof constructs only finite component decompositions, finite coordinate vectors, and finite sums; no axiom of choice is used.
Depends on
- Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group
- Affine reflections: translation form, involutivity, local finiteness, and $W_a=Q^\vee\rtimes W$
- Existence and uniqueness of the highest root
- Height and highest root
- Reducible and irreducible root systems
- Unique irreducible decomposition
- Positive systems and simple roots
- Simple roots form a signed integral basis
- Open and closed Weyl chambers
- Reduced crystallographic Euclidean root system
- Connected components, quasicomponents, and totally disconnected spaces
- The geometric simplex spanned by affinely independent vertices
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Distinct simple roots have nonpositive inner product
- Irreducibility and connected Dynkin diagrams
- Dynkin diagram with edge multiplicity and arrow convention
- Cartan matrix of a based root system
- The induced length is a norm
Used by
- B-tilde versus C-tilde: the n=2 coincidence and the duality behind the difference Example
- The A₁ affine line: alcoves, translations, and the root versus coroot lattice Example
- The A₂ and B₂ fundamental alcoves: coordinates, corner vectors, and facet types Example
- The extended affine Weyl group and non-trivial alcove stabilizers Example
- The radical vector of A-tilde 2 and its Euclidean slice Example
- Alcove separation, facet reflections, panel types, and triviality of the fundamental alcove stabilizer Lemma
- Crystallographic alcove diagrams: the affine list realized by Weyl types A–G Lemma
- Generic galleries, boundary-fixed disks, and the gallery-move calculus Lemma
- Point stabilizers, vertex residues, and rank-two boundary words Lemma
- Alcove transitivity, the affine Coxeter presentation, and the length function Theorem
- Classification of affine Coxeter diagrams and their Euclidean simplex realization Theorem
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
- P. Magyar, Notes on Schubert classes of a loop group (arXiv:0705.3826) (standard reference, not scraped)
- A. W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., digital edition (standard reference, not scraped)