Alphabeta Math
TheoremStatement: 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.

Alcove transitivity, the affine Coxeter presentation, and the length function

Statement

Use the affine-wall notation and componentwise fundamental alcove A from Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group and Highest-root dominance and the fundamental alcove. Let J be the affine facet-type set from Alcove separation, facet reflections, panel types, and triviality of the fundamental alcove stabilizer, with one label 0i for each nonempty irreducible component, and let sa be the reflection in the fundamental facet of type a∈J. Let Wabs, its Coxeter matrix mab=ord⁡(sasb), and φ:Wabs→Wa be those of Generic galleries, boundary-fixed disks, and the gallery-move calculus; its finite labels are 2,3,4,6, and mab=∞ only for the two opposite facets of a rank-one component. If J=∅, take Wabs=Wa={1}.

(1) Transitivity and generation. The subgroup G:=⟨sa:a∈J⟩≤Wa equals Wa, and Wa acts transitively on the set of alcoves. Every affine wall supports a facet of the closure of some alcove; if H is a facet wall of g(A), its reflection is gsag−1 for the type a of that facet.

(2) Presentation and simple transitivity. The homomorphism φ:Wabs→Wa is an isomorphism. Thus Wa is the Coxeter group with simple system (sa)a∈J, and it acts simply transitively on alcoves: for any two alcoves C,C′ there is exactly one g∈Wa such that g(C)=C′.

(3) Length. Let ℓ(g) be the minimum number of facet reflections from (sa)a∈J whose product is g. For every g∈Wa, ℓ(g)=#Sep⁡(A,g(A)), where Sep⁡ is the separating-wall set of Alcove separation, facet reflections, panel types, and triviality of the fundamental alcove stabilizer. A straight generic segment between interior points of A and g(A) crosses each separating wall exactly once and gives a gallery attaining the minimum. The argument includes rank-one factors and reducible systems with the product conventions of Highest-root dominance and the fundamental alcove (3).

(4) Comparison. The finite root-system types are the standard crystallographic types An,Bn,Cn,Dn,E6,E7,E8,F4,G2 (with the low-rank identifications in Classification of irreducible root systems). In that root-system normalization, Wa=Q∨⋊W from Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W is the standard affine Weyl group. This does not identify it with an untwisted Kac–Moody loop realization, and it does not assert that the extended group P∨⋊W is a Coxeter group with the same simple system. No axiom of choice is used.

Facts & Assumptions

Given: The finite-dimensional real inner-product space E, reduced crystallographic root system Φ, affine walls and reflections, and componentwise fundamental alcove and facet labels above.

[F1]
[F2]

The fundamental alcove is a finite product of interiors of bounded geometric simplices, with one affine facet label 0i for each nonempty irreducible component (Highest-root dominance and the fundamental alcove, Alcove separation, facet reflections, panel types, and triviality of the fundamental alcove stabilizer).

[F3]

A facet reflection carries an alcove to its adjacent alcove, the separating sets satisfy the symmetric-difference identity, the stabilizer of A is trivial, and facet types/reflections transport consistently on the orbit Wa⋅A (Alcove separation, facet reflections, panel types, and triviality of the fundamental alcove stabilizer).

[F4]

Any two alcoves are joined by a finite generic gallery; the Coxeter matrix on J has the actual affine reflection product orders; its universal-property map φ is defined; and φ(w)(A)=A implies w=1 (Generic galleries, boundary-fixed disks, and the gallery-move calculus).

[F5]

A finite Coxeter matrix defines the presented group and its length as the minimum number of simple generators in a word (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F6]

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).

[F7]

The convex hull of finitely many points in a finite-dimensional real topological vector space is compact (Convex closures and hulls of finitely many compact convex sets).

[F9]

An affine subspace is a translate of a linear subspace (Affine subspaces as translates x+U of linear subspaces).

[F11]
[F12]

Irreducible reduced crystallographic root systems have exactly the standard types and low-rank identifications listed in part (4) (Classification of irreducible root systems).

[F13]

The subgroup generated by the fundamental facet reflections is the least subgroup containing those reflections (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F14]

A geometric simplex is the convex hull of its affinely independent finite vertex list, with barycentric coordinates (The geometric simplex spanned by affinely independent vertices).

[F15]

Cauchy--Schwarz gives ∣B(u,v)∣≤∥u∥ ∥v∥ for the induced inner-product norm (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

Proof

technique · generic galleries, finite affine avoidance, and wall-crossing counts
1.1F8algebra

The induced inner-product norm is a norm. Addition is continuous because ∥(x+y)−(x0+y0)∥≤∥x−x0∥+∥y−y0∥. Scalar multiplication is jointly continuous at (λ0,x0): if ∣λ−λ0∣<δ≤1 and ∥x−x0∥<δ, then ∥λx−λ0x0∥≤(∣λ0∣+1)δ+∥x0∥δ, which is below any prescribed ε>0 for sufficiently small δ>0. Thus the norm topology on E is a real topological vector space topology, so [F7] applies.

1.2F6F9choosealgebra

Let O be a nonempty open subset of a finite-dimensional real affine space and let L1,…,LN be finitely many proper affine subspaces. If N=0, any point of O works. Otherwise let Dj be the direction subspace of Lj; each Dj is proper. By [F6] choose a direction v outside their union. For p∈O, openness gives an interval around 0 with p+tv∈O. The line p+Rv meets each Lj in at most one point, so deleting the finitely many excluded parameters leaves a point in O∖⋃jLj. In dimension zero every proper affine subspace is empty.

1.3F2F3F4F13algebra

Fix any alcove C and follow the gallery from A to C supplied by [F4]. Start with A=1(A). Suppose the current alcove is g(A) with g∈G. The next shared panel is a facet g(Fa) for some a∈J, since A has exactly the listed facets and g is an affine isometry. By [F3] reflection in its wall is gsag−1, so the next alcove is gsa(A) and still lies in G⋅A. Induction along the finite gallery gives C∈G⋅A. Thus G acts transitively on alcoves.

1.4F11F12

By [F12], each irreducible component of Φ has one of the types listed in part (4), with the stated low-rank identifications. By [F11], the affine group defined here is the coroot-lattice semidirect product of that finite Weyl group, which is the standard affine Weyl group in the Euclidean root-system normalization. This comparison uses only the root-system type classification and the explicit Euclidean construction; it asserts no loop-algebra identification.

2.1F1F2F3F6F7F8F9F10F13F14F15step 1.1step 1.2step 1.3choosealgebra

If E=0, there are no walls. If dim⁡E=1, each wall is a point and is an endpoint facet of the two adjacent interval alcoves. Assume dim⁡E≥2 and fix a wall H. Choose p0∈H. Let e1,…,en be any real basis of E, which exists by [F10]. For any ε>0, let S be the geometric simplex with vertices p0−ε∑iei and p0+εei (1≤i≤n), using [F14]. Its edge vectors are ε(ei+∑jej), and a linear relation among them has coefficients ci satisfying ci+∑jcj=0 for every i, hence all ci=0. Thus S is full-dimensional. Its barycenter is p0, with all barycentric coordinates equal to 1/(n+1), so O:=int⁡(S) is nonempty. The simplex S is compact by [F7]. By local finiteness [F1], only finitely many walls meet S. For each other wall H′, H∩H′ is empty or a proper affine subspace of H. Apply the affine avoidance argument of 1.2 inside the relative open set H∩O to choose p∈H on none of these other walls. Since p lies on no other wall in that finite list, for each Hβ,l≠H in the list Cauchy--Schwarz [F15] gives a positive-radius ball about p missing Hβ,l: take radius less than ∣B(p,β)−l∣/(2∥β∥). Taking the minimum of these finitely many radii and the radius of a ball inside O gives a ball meeting the arrangement only in H. Its two half-balls lie in two alcoves whose closures share a relatively open patch of H, so H is a facet wall of either alcove. By 1.3 one such alcove is g(A). Its facet is g(Fa) for some a∈J, and [F3] gives rH=gsag−1∈G. Hence every wall reflection lies in G. Since Wa is generated by all wall reflections by [F1] and G≤Wa by [F13], we have G=Wa.

3.1F3F4F5step 1.3step 2.1

The matrix and homomorphism are those established in [F4], with the universal presentation and length convention of [F5]. Surjectivity of φ follows from G=Wa in 2.1. If w∈ker⁡φ, then φ(w)(A)=A, so [F4] gives w=1; thus φ is injective. For any alcove C, transitivity gives C=g(A). If h(C)=C, then g−1hg stabilizes A, which is trivial by [F3]; hence the action is free. Transitivity and freeness give exactly one group element carrying any C to any C′.

3.2F1F3F5F6F7F8F9F10F14step 1.2step 1.3step 2.1algebra

Let g=sa1⋯sam be any expression. The prefix alcoves Cj=sa1⋯saj(A) form a gallery. Each step crosses one facet wall Hj, so [F3] gives Sep⁡(A,Cj)=Sep⁡(A,Cj−1)△{Hj}. Every wall in Sep⁡(A,g(A)) must therefore occur among H1,…,Hm, and m≥#Sep⁡(A,g(A)). For the reverse inequality, if E=0 the claim is immediate. Otherwise take x∈A and y0∈g(A). Let S be a positive rescaling about y0 of the finite simplex template from 2.1, chosen small enough that S⊂g(A); this is possible because g(A) is open. Let O:=int⁡(S). Its finite vertices lie in g(A), and S is their convex hull by [F14]. The convex hull K of x and those vertices is compact by [F7], so by [F1] only finitely many walls meet K. Let P1,…,PN be the codimension-two intersections of distinct walls in this finite list. Since x∈A, x∉Pj, and each aff⁡({x}∪Pj) is proper by [F9]. Also exclude x+D for every codimension-two direction D=ker⁡B(−,α)∩ker⁡B(−,β) with nonproportional roots α,β, and the singleton {x}. There are finitely many such directions because Φ is finite, and all these affine sets are proper. Apply 1.2 to choose y∈O outside the full excluded family. Then [x,y] meets no codimension-two intersection, its nonzero direction y−x is not parallel to any codimension-two direction, and every wall it crosses is met transversely and one at a time. For a defining affine functional fH of any wall H, fH has opposite signs at x,y exactly when H separates A and g(A); linearity along the segment shows that such a wall is crossed exactly once, while every other wall is not crossed. Thus the segment gives a gallery of exactly #Sep⁡(A,g(A)) steps. Inducting as in 1.3 gives h∈G with h(A)=g(A). By 2.1, G=Wa, and the trivial stabilizer of A in [F3] then gives h=g. The minimum length therefore equals the separating-wall count.

4.1F1F2F3step 3.2algebra

The argument in 3.2 is carried out in the full product alcove A=∏iAi, so it already applies to reducible systems. More explicitly, every wall belongs to one irreducible factor, hence the separating-wall set is the disjoint union of the factorwise sets. Reflections from different orthogonal components act on separate summands and commute, and each component subgroup acts trivially on the other summands; hence Wa is their direct product and the facet-generator set is their disjoint union. Any word has at least the sum of the factorwise minimum lengths, while concatenating factorwise minimum words attains that sum. For an A1 factor the alcoves are intervals, and the straight segment crosses exactly the integer-level walls between the two intervals.

5.1F1F2F4step 1.2step 4.1∎

If Φ=∅, then E=0, J=∅, Wa={1}, and all four claims reduce to the empty presentation and zero length. In rank one, the two endpoint reflections have infinite-order product by [F4], and the length count is the interval-gallery count in 4.1. In reducible systems the factor argument of 4.1 applies. The only nonunique choices in the proof were made from finite families: affine bad-set avoidance uses 1.2, and compact hulls and wall lists are finite. No axiom of choice is used.

Remarks

Step-3 supplier history. Earlier provisional checks concerned the generic-disk supplier and the presented-group definition. The owner resolved this branch in research/frontier-42-coxeter-32-step3b-owner-thm-cg-affine-alcove-transitivity-presentation-and-length.json. The Step-5 review independently checks the current disk argument, exact defining relators and minimum-word convention; it preserves the earlier escalation in the run report.

Depends on

Used by

Dependency tree · two levels

140 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