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.

Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W

Statement

With the notation of Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group:

(1) Translation form and reflections. For all α∈Φ, k∈Z and x∈E, rα,k(x)=tkα∨(sα(x))=x+kα∨−B(x,α)α∨, so rα,k=tkα∨∘sα. Moreover rα,k2=idE, rα,k fixes Hα,k pointwise, and rα,k is the unique Euclidean isometry whose fixed set is Hα,k and whose differential acts as −1 on the normal line Rα.

(2) Preservation of the arrangement. For all β∈Φ and l∈Z, rα,k(Hβ,l)=Hsαβ, l−k B(α∨,β). Consequently Wa permutes the walls and the alcoves, and W≤Wa (each sα=rα,0) permutes the walls through the origin.

(3) Local finiteness. For every compact set K⊆E, only finitely many walls meet K. The union of all walls is closed, its complement is open, every alcove is open and convex, and every point of E has a neighbourhood meeting only finitely many alcoves.

(4) Simple coroot translations and the semidirect product. For every simple root αs, tαs∨=rαs,1∘rαs,0∈Wa. The map ψ:Q∨⋊W→Isom(E), ψ(λ,w)=tλ∘w, is an injective group homomorphism with image Wa. Equivalently, Wa=Q∨⋊W, and every g∈Wa has a unique decomposition g=tλw with λ∈Q∨ and w∈W, its Euclidean decomposition. No choice principle is used.

Facts & Assumptions

Given: A finite-dimensional real inner-product space (E,B), a reduced crystallographic root system Φ⊆E, its coroots, Weyl group W, positive system with simple roots Δ={αs:s∈S}, root and coroot lattices Q,Q∨, Euclidean metric dB and all affine notation from Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group.

[F1]

sα(x)=x−B(x,α)α∨ is an orthogonal reflection, α∨=2α/B(α,α), B(α∨,α)=2, α≠0, and B(α∨,β)∈Z for roots α,β (Reduced crystallographic Euclidean root system, Coroot and dual root system, Weyl group).

[F2]

Φ is finite and every sα permutes Φ (Reduced crystallographic Euclidean root system, Weyl group).

[F3]

The chosen regular vector v defines positive roots by B(v,α)>0; the simple roots form a real basis and every positive root has nonnegative integral coordinates in it; Q∨ is the integer span of all coroots, and each αs∨ is a positive multiple of αs (Positive systems and simple roots, Simple roots form a signed integral basis, Root, coroot, weight, and coweight lattices, Coroot and dual root system).

[F4]

Compactness means every open cover has a finite subcover; every nonempty finite set of reals has a maximum; and the natural numbers are cofinal in R (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Every nonempty finite set of reals has a maximum and a minimum, Every complete ordered field is Archimedean).

[F5]

The external product has multiplication (λ,w)(μ,v)=(λ+wμ,wv) for the action of W on Q∨ by automorphisms, and this multiplication makes it a group ( The external semidirect product N⋊αH, The semidirect-product multiplication makes N×H a group).

[F7]

Every nonnegative integer is the image of a unique natural under the order-preserving embedding N↪Z; a natural N is its finite set of predecessors; and distinct integers differ in absolute value by at least 1 (The integers as equivalence classes of pairs of naturals, The natural numbers N (von Neumann), The naturals embed in the integers, Discreteness: σ(n) is the immediate successor, The integers form a totally ordered ring, Basic properties of the absolute value).

[F8]

A group homomorphism preserves products (Monoid homomorphism and group homomorphism).

[F9]

The induced inner-product norm is homogeneous and satisfies the triangle inequality: ∥λu∥B=∣λ∣ ∥u∥B and ∥u+v∥B≤∥u∥B+∥v∥B (The induced length is a norm).

[F11]

A path-connected subset is connected, and each connected component is the largest connected subset containing each of its points (Every path-connected space is connected, and every path component lies inside a component, Connected components, quasicomponents, and totally disconnected spaces).

[F12]

The root system spans E; therefore Φ=∅ implies E={0} (Reduced crystallographic Euclidean root system).

[F13]

An isometry of metric spaces is a bijective distance-preserving map (Isometry, isometric embedding, and the subspace metric on a subset).

Proof

technique · direct

Given: α,β∈Φ, k,l∈Z, x∈E, a compact set K⊆E, and the notation of the statement.

1.1F1algebra

Substituting the reflection formula from [F1] gives tkα∨(sα(x))=x−B(x,α)α∨+kα∨=x−(B(x,α)−k)α∨=rα,k(x), proving the translation form.

1.2F1F2F4F6F7

If K=∅ there are no walls meeting it. Otherwise fix α∈Φ and for each real c>0 put Uc={x∈E:∣B(x,α)∣<c}. For x∈Uc, Cauchy–Schwarz from [F6] shows that every y with dB(x,y)<(c−∣B(x,α)∣)/∥α∥B also lies in Uc, so Uc is open. Its traces Uc∩K form an open cover of the subspace K, since x∈U∣B(x,α)∣+1; compactness gives finitely many parameters c0,…,cn with K⊆⋃iUci. Set Cα=max⁡ici, which exists by [F4]; then ∣B(x,α)∣<Cα for all x∈K. By Archimedeanness choose a natural N>Cα. If Hα,k meets K, then ∣k∣<N; [F7] identifies ∣k∣ with a natural j<N, so the possible integers are on the finite list 0,±1,…,±(N−1). Thus only finitely many k occur for this root, and finiteness of Φ gives finitely many walls in total.

1.3F1F2F6F7F10algebra

If Φ=∅, the arrangement is empty. Otherwise, for any p∈E the finite intersection U=⋂α∈ΦB(p,1/(2∥α∥B)) is an open neighbourhood of p by [F10]. By Cauchy–Schwarz, any wall Hα,k meeting U has ∣k−B(p,α)∣<1/2; by [F7] at most one integer k occurs for each root, so U meets only finitely many walls. Each wall is closed: if p∉Hα,k then the ball of radius ∣B(p,α)−k∣/(2∥α∥B) about p misses it by the same inequality. Since only finitely many walls meet U, their union is closed; around any point outside the full union, remove this finite closed union from U to obtain a neighbourhood avoiding every wall. Hence the full union is closed and its complement is open.

1.4F5algebra

The formula ψ(λ,w)(x)=λ+w(x) and the multiplication in [F5] give ψ(λ,w)∘ψ(μ,v)(x)=λ+wμ+wv(x)=ψ(λ+wμ,wv)(x), so ψ is a group homomorphism. If ψ(λ,w)=idE, evaluating at 0 gives λ=0, after which w(x)=x for all x and w=1; thus ψ is injective.

1.5F1F2F3algebra

The coroot set Φ∨ is a reduced crystallographic root system: it is finite, nonzero and spanning because each coroot is a nonzero multiple of its root; reducedness follows from [F1] and the involution (α∨)∨=α. Its root reflection is sα∨=sα, and orthogonality gives sα(β∨)=(sαβ)∨, so it preserves Φ∨. Its Cartan numbers are B((α∨)∨,β∨)=B(α,β∨)∈Z by [F1]. Use the same regular vector that defines the given positive roots; coroots have the same signs as their roots. If β=∑snsαs is positive, then β∨=∑snsB(αs,αs)/B(β,β) αs∨ has nonnegative real coordinates. Thus an equality αs∨=β∨+γ∨ for positive coroots forces both β,γ onto the line of αs by coordinatewise nonnegativity. Reducedness then forces both to equal αs, contradicting the equality. Hence every αs∨ is dual-simple. In applying [F3] to this dual system, the sign split used in its linear-independence argument is justified as follows: for any finite family of positive roots βj, if ∑jcjβj∨=0 with cj≥0 and some cj>0, then B ⁣(v,∑jcjβj∨)=∑jcj2B(v,βj)B(βj,βj)>0, contradiction; negating rules out a nonzero relation with all cs≤0. Thus every nontrivial relation among the dual simple roots has both positive and negative coefficients, even before identifying the complete dual simple set; this is the case treated in the remainder of that signed-integral basis proof. Apply the signed integral basis theorem in [F3] to the now-verified dual root system: its simple set is a basis with exactly dim⁡E=∣S∣ elements, so it equals {αs∨:s∈S}. Every coroot is therefore an integral combination of the simple coroots, proving Q∨=⨁sZαs∨. This includes the empty system and all orthogonal components.

2.1F1step 1.1algebra

By [F1], B(rα,k(x),α)=B(x,α)−(B(x,α)−k)B(α∨,α)=2k−B(x,α). Thus B(rα,k(x),α)−k=k−B(x,α), and substituting this into the formula for a second application gives rα,k2(x)=x. Also rα,k(x)=x exactly when (B(x,α)−k)α∨=0, which by α∨≠0 is equivalent to x∈Hα,k.

2.2F10F11step 1.2step 1.3

Let C be an alcove and x∈C. Since the complement of the wall union is open by step 1.3, a ball around x lies in it; the ball is path-connected by straight segments and hence connected by [F11], so it lies in the connected component C. Thus C is open. For any wall Hβ,l, both strict halfspaces are open by the Cauchy–Schwarz estimate in step 1.2 and [F10], so C∩{y:B(y,β)<l} and C∩{y:B(y,β)>l} are relatively open and partition C; connectedness forces one to be empty. Therefore any x,y∈C lie on the same strict side of every wall, and linearity of B(−,β) shows their segment avoids every wall. That segment is connected, meets C, and lies in the complement, so it lies in C; hence C is convex.

2.3F9F11F12step 1.3algebra

If Φ=∅, then E={0} by [F12]; the arrangement is empty and E itself is the unique alcove, so the local-finiteness claim is immediate. Otherwise fix p∈E and take the neighbourhood U from step 1.3. It is convex: if x,y∈U, t∈[0,1], and α∈Φ, then membership in B(p,1/(2∥α∥B)) and [F9] give ∥(1−t)x+ty−p∥B≤(1−t)∥x−p∥B+t∥y−p∥B<1/(2∥α∥B), so (1−t)x+ty∈U. List the finitely many walls meeting U as H1,…,HN. A point of an alcove meeting U determines a sign for each listed wall. If two alcoves meeting U have the same sign vector, take one point from each; every wall outside the list misses U, and a segment in the convex set U cannot join opposite sides of a wall without meeting it. The segment between the two points therefore stays in the same strict halfspace for each listed wall and misses every wall outside the list, so it lies in the complement and connects the points. They belong to the same connected component. There are at most 2N sign vectors, hence only finitely many alcoves meet U.

3.1F1F13step 1.1step 2.1algebra

The identity, composition and inverses of bijective distance-preserving maps are again bijective and distance-preserving: for a composition this follows by applying the two distance equalities in succession, and for an inverse it follows by writing x=f−1(u) and y=f−1(v) in dB(f(x),f(y))=dB(x,y). Thus Isom(E) is a group under composition by [F13]. For all x,y∈E, dB(tkα∨x,tkα∨y)=∥x−y∥B=dB(x,y), and dB(sαx,sαy)=∥sα(x−y)∥B=∥x−y∥B because sα is orthogonal by [F1]. By step 2.1, rα,k is bijective; by step 1.1 it is the composition of those two distance-preserving maps, so it belongs to Isom(E). Its linear part fixes Hα,0 pointwise and sends Rα to its negative, so its differential acts as −1 on the normal line.

3.2F1step 2.1algebra

For uniqueness, let g be a Euclidean isometry with fixed set Hα,k. Put h=x−B(x,α)−kB(α,α)α∈Hα,k. For every u with B(u,α)=0, both h and h+u are fixed by g; equality of squared distances from g(x) and x to these two points gives B(g(x)−h,u)=0 and ∥g(x)−h∥B=∥x−h∥B. Write g(x)−h=cα+u0 with c=B(g(x)−h,α)/B(α,α) and u0∈{u:B(u,α)=0}. Since α is orthogonal to that subspace, u0 is orthogonal to it too; in particular B(u0,u0)=0, so u0=0. Also write x−h=tα. The norm equality gives c=±t. If t=0, then x=h and g(x)=x; if t≠0, the condition Fix⁡(g)=Hα,k excludes c=t, so c=−t. Hence g(x)=h−tα=rα,k(x) for every x, proving uniqueness.

3.3F1F2step 2.1algebra

If y∈Hβ,l, then orthogonality of sα and sα(α∨)=−α∨ give B(rα,k(y),sαβ)=B(sαy,sαβ)+kB(α∨,sαβ)=l−kB(α∨,β). The level on the right is an integer by [F1], and sαβ∈Φ by [F2]; since rα,k is an involution, this proves the wall-image equality.

4.1F1step 1.1step 3.3

Each generator rα,k therefore permutes the wall arrangement. It is a homeomorphism, so it preserves the complement and maps connected components to connected components; hence Wa permutes the alcoves. For k=0, step 1.1 gives rα,0=sα, so the generators of W lie in Wa and permute the walls through the origin.

5.1F1step 1.1step 4.1step 1.5

By step 1.1, rαs,1∘rαs,0=tαs∨ for each simple root. The simple coroots form a basis of E and generate Q∨ by step 1.5, so the translations tλ for all λ∈Q∨ lie in Wa; also W≤Wa by step 4.1. Therefore every value ψ(λ,w)=tλ∘w lies in Wa.

6.1F8step 1.1step 1.4step 2.1step 5.1∎

Every generator rα,k equals ψ(kα∨,sα) by step 1.1, and each inverse is the same generator by step 2.1. By [F8], every finite word in these images is the image under ψ of the corresponding product in Q∨⋊W. Since such words form Wa, this proves Wa⊆im⁡ψ. Together with step 5.1 we get im⁡ψ=Wa; injectivity from step 1.4 then gives the claimed unique Euclidean decomposition. All arguments use only finite subcovers, finite lists and finite sums; no choice principle is used.

Remark

The coroot set Φ∨ is a reduced crystallographic root system with sα∨=sα. Its simple roots are the simple coroots αs∨, which form a real basis of E and integrally generate every coroot; hence Q∨=⨁s∈SZαs∨.

Depends on

Used by

Cited to discharge well-definedness by Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group.

Dependency tree · two levels

110 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