Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Alcove separation, facet reflections, panel types, and triviality of the fundamental alcove stabilizer

Statement

Use the affine-wall notation of Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group and let A be the componentwise fundamental alcove from Highest-root dominance and the fundamental alcove. Write Φ=⨆i∈IΦi for its nonempty irreducible components, Si for the simple-root indices in Φi, and θi for the highest root of that component. Put J:=⨆i∈I({0i}⊔Si). For a∈J, let Fi,0i be the facet of A‾ on Hθi,1 and let Fi,s be the facet on Hαs,0 for s∈Si. Write si,0i:=rθi,1 and si,s:=rαs,0. If Φ=∅, take I=J=∅ and A={0}.

For these labels, write Hi,0i:=Hθi,1 and Hi,s:=Hαs,0. For any wall H, write rH for its Euclidean reflection; this is independent of the root-level representation by the uniqueness in Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W.

For alcoves C,C′, define Sep⁡(C,C′) to be the set of affine walls whose two open half-spaces contain the interiors of C,C′ on opposite sides.

(1) Separation. If F is a facet of C‾ on the wall H, then rH(C) is the other alcove adjacent to C across F, and Sep⁡(C,rH(C))={H}. For any three alcoves C,C′,C′′, Sep⁡(C,C′)△Sep⁡(C,C′′)=Sep⁡(C′,C′′), where △ is symmetric difference.

(2) Fundamental stabilizer and types. The stabilizer Stab⁡Wa(A)={g∈Wa:g(A)=A} is trivial; the same holds for U=int⁡(A‾)=A. For each alcove C∈Wa⋅A and each facet F of C‾, there are unique g∈Wa and a∈J such that C=g(A) and F=g(Fa). The index a is the type of F.

(3) Panel rules. If adjacent alcoves C,C′∈Wa⋅A share a facet F, its type computed from either alcove is the same. Every alcove in Wa⋅A has exactly one facet of each type in J. The reflection in the wall of a facet of type a of g(A) is g sa g−1.

These statements include reducible systems: there is one affine label 0i for each nonempty component, not one global highest-root wall. In dimension zero the statements reduce to the single alcove {0} and the empty type set. No axiom of choice is used.

Facts & Assumptions

Given: A finite-dimensional real inner-product space and a supplied reduced crystallographic root system spanning it, with the affine walls, reflections, alcoves, affine reflection group, and fundamental alcove defined above.

[F1]

An alcove is a connected component of the complement of the affine-wall arrangement (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group).

[F2]

The affine reflection group Wa is generated by the wall reflections (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group).

[F3]

Each component closure is a geometric simplex with the listed ∣Si∣+1 facets (Highest-root dominance and the fundamental alcove).

[F4]

The full fundamental alcove is the finite product of these component alcoves; the item also treats the empty system and rank-one factors (Highest-root dominance and the fundamental alcove).

[F5]

A finite-dimensional real vector space is not a finite union of proper linear subspaces (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces).

[F6]

The convex hull of a finite set of points is compact (Convex closures and hulls of finitely many compact convex sets).

[F7]

Each wall reflection fixes its wall and is the unique Euclidean reflection there, reversing the normal direction (Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W).

[F8]
[F9]

Every compact set meets only finitely many walls, and every alcove is open and convex (Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W).

[F10]

A finite-dimensional normed space is locally compact (A normed space is locally compact if and only if it is finite-dimensional).

[F11]

In a locally compact metric space, each point has arbitrarily small compact closed balls (In a locally compact metric space every point has arbitrarily small compact closed balls, hence a neighbourhood base of compact sets).

[F12]

The inner product satisfies ∣B(u,v)∣≤∥u∥ ∥v∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

Proof

technique · local finite-wall galleries and deletion in a shortest word

Given: The notation above. Until step 9.1, assume Φ≠∅, so dim⁡E>0.

1.1F5algebrachoose

Let O be a nonempty open subset of a finite-dimensional real affine space of positive dimension, and let L1,…,Lm be finitely many proper affine subspaces. If m=0, any point of O works. Otherwise let Vj be the direction subspace of Lj; each is proper. By [F5] choose v∉⋃jVj, so v≠0. Choose p∈O; openness gives an interval (−ε,ε) with p+tv∈O. The line p+Rv meets each Lj in at most one point, since two intersections would imply v∈Vj. The interval is infinite and only finitely many parameters are excluded, so some p+tv lies in O∖⋃jLj. In dimension zero every proper affine subspace is empty, so the same avoidance conclusion holds.

1.2F3F4F6F9algebrachoose

Let Vi be the finite vertex set of Ai‾. The componentwise simplex descriptions imply A‾=∏iAi‾, and this product is the convex hull of the finite product V=∏iVi: write each component point in barycentric coordinates and multiply the finitely many coordinate weights to obtain a convex combination of product vertices. For any alcove C, choose y∈C and set K=co⁡(V∪{y}). By [F6], K is compact; it contains A‾, y, and every segment joining y to a point of A. By [F9], only finitely many walls meet K.

2.1F1F7F8F9F10F11F12step 1.1algebra

Every connected alcove lies strictly on one side of each wall, because it is connected and avoids that wall. Let F be a facet of C‾ on H, and choose a nonempty relatively open set O⊆H in the relative interior of F. Pick p0∈O. By [F10] and [F11], choose r>0 so the closed ball K=B‾(p0,r) is compact; its open ball meets O in a nonempty relatively open subset of H. By [F9] only finitely many walls meet K. For each such wall H′≠H, the intersection H′∩H is either empty or a proper affine subspace of H; step 1.1 therefore gives p∈O∩B(p0,r) on no other wall. Since every wall through p would meet K, the finite list contains all walls relevant near p. By [F12] and the affine equations of those finitely many walls, a smaller open ball about p, contained in K, misses every wall except H. Its two half-balls lie in the two adjacent alcoves, and reflection rH exchanges them; hence rH(C) is the other alcove adjacent across F. For any other wall H′, that ball misses H′, so the two adjacent alcoves lie on the same side of H′, while H separates them. Thus Sep⁡(C,rH(C))={H}.

3.1F1F9F10F11F12step 1.1step 1.2step 2.1algebra

Among the finitely many walls meeting K from step 1.2, consider each distinct intersecting pair H,H′ and put P=H∩H′. Distinct affine hyperplanes that intersect have codimension-two intersection, so aff⁡({y}∪P) is a proper affine subspace: y lies on no wall because y∈C. By step 1.1 choose z∈A outside the finite union of these subspaces. The segment [z,y] lies in K and meets finitely many walls; it cannot meet two distinct walls at the same point, since that would put z in one of the excluded affine spans. Neither endpoint lies on a wall, and a segment not contained in a hyperplane crosses it at most once. Thus its crossings occur one at a time. At any crossing point q, the segment lies in a compact ball around q by [F10] and [F11]. That ball meets finitely many walls by [F9], and q lies on only the crossed wall. By [F12], shrink to a neighborhood inside the ball that misses all the other walls. The two local sides belong to adjacent alcoves, so the successive components along the segment form a finite gallery.

3.2F1step 2.1algebra

For each wall, an alcove has one fixed sign with respect to its defining affine functional, by connectedness. Comparing these two signs wall by wall shows that a wall separates C from C′′ exactly when it separates exactly one of the pairs (C,C′) and (C′,C′′). This is the symmetric-difference identity.

4.1F2F3F7F8step 2.1step 3.1algebra

Let G=⟨sa:a∈J⟩≤Wa. Start with A and follow the gallery of step 3.1 to any alcove C. Inductively suppose the current alcove is h(A) for h∈G. Each of its facets is h(Fa) for a unique a∈J, since h is an isometry and A‾ has exactly these facets. If the next gallery step crosses the wall h(Ha), reflection in it is hsah−1; by step 2.1 the next alcove is hsa(A)∈G⋅A. Therefore G acts transitively on all alcoves.

5.1F2F3F7F9F10F11F12step 1.1step 4.1choosealgebra

Every affine wall H is a facet wall of some alcove. Take p0∈H and, by [F10] and [F11], a compact closed ball K around it; only finitely many walls meet K by [F9]. The intersections with H of the listed walls other than H are finitely many proper affine subspaces of H. Applying step 1.1 to their union in the relatively open set H∩int⁡(K) gives p∈H on no other wall. The finite list includes every wall through p. By [F12], a smaller ball about p contained in K misses all listed walls other than H, hence meets the arrangement only in H. The two local alcoves on its sides share a relatively open subset of H in their closures, so H is a facet wall. By step 4.1 one such alcove is h(A) for some h∈G, so H=h(Ha) for a facet label a. The uniqueness of the Euclidean reflection gives rH=hsah−1. Hence every generator of Wa lies in G, while G≤Wa by definition; thus Wa=G.

6.1step 2.1step 3.2step 5.1choosealgebra

Let g∈Wa stabilize A, and write it as a word in the finite set of facet reflections with the least possible number m of factors: g=sa1⋯sam. Put h0=1, hk=sa1⋯sak, and Hk=hk−1(Hak). The gallery h0(A),…,hm(A) crosses Hk at step k, and step 2.1 gives Sep⁡(hk−1(A),hk(A))={Hk}. If Hp=Hq for p<q, equality of their reflections gives, with s=sap, t=saq and b=sap+1⋯saq−1, the relation s=sbtb−1s, hence sbt=b. Deleting the factors at positions p,q shortens the word for g, a contradiction. Thus the crossed walls are pairwise distinct. Repeated use of step 3.2 now gives Sep⁡(A,g(A))={H1,…,Hm}; since g(A)=A, this set is empty, so m=0 and g=1. Therefore Stab⁡Wa(A)={1}.

7.1F3step 6.1algebra

For C∈Wa⋅A, existence of g with C=g(A) is the definition of the orbit. If also C=g′(A), then g−1g′ stabilizes A, so step 6.1 gives g=g′. The facets of A‾ are precisely the Fa for a∈J, each occurring once; applying g gives a unique label for every facet of C‾. Since U=int⁡(A‾)=A, its stabilizer is the same trivial stabilizer.

8.1F7step 2.1step 7.1algebra

If adjacent alcoves C=g(A) and C′=g′(A) share a facet F=g(Fa) on H=g(Ha), step 2.1 says C′=rH(C)=gsa(A). Uniqueness from step 7.1 yields g′=gsa. The reflection sa fixes Fa pointwise, so F=gsa(Fa) also has type a as computed from C′. Thus the panel type is independent of the side; every alcove has one facet for each a∈J because A does; and rH=gsag−1.

9.1F1F2F4step 1.1step 3.1step 6.1∎

If Φ=∅, the spanning condition gives E=0, the wall arrangement is empty, A={0}, and Wa={1}; all separation and panel claims are then vacuous and the stabilizer claim holds. For a single rank-one component, distinct walls are disjoint points, so the bad-pair family in step 3.1 is empty and its fundamental alcoves are intervals with endpoint facets. In reducible products of rank-one components, the general affine-subspace avoidance in step 3.1 also handles intersections between walls from different factors. All other selections above are finite: the generic point avoids finitely many affine subspaces, the compact hull supplies finitely many walls, and shortest word length is a least natural number. No axiom of choice is used.

Depends on

Used by

Dependency tree · two levels

82 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