Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 closest pairs and downward translation from a lower facet

Statement

Let Φ be a finite simply-laced root system in its real root span, with positive roots Φ+, root lattice Q, Weyl group W and (α,α)=2. Let ℓ>0 and Wℓ=W⋉ℓQ, acting by affine isometries on shifted coordinates. Its walls and reflections are

Hα,k={z:(z,α)=kℓ},rα,k(z)=z−((z,α)−kℓ)α.

Let C be an open alcove, F one of its facets, x in the relative interior of F, and y∈C. Write sF for the facet reflection. Then, for all u,v∈Wℓ,

∥ux−vy∥≥∥x−y∥.

Equality holds exactly when (ux,vy)=(τx,τy) for some τ∈Wℓ. Equivalently, the regular orbit points at minimum distance from gx are precisely gy and gsFy.

Call F a lower facet when, for its positive finite root α, C lies in (z,α)>kℓ. Suppose it is lower and x′=rN⋯r1x is obtained by strict downward reflections: rj=rαj,kj with αj∈Φ+ and (xj−1,αj)>kjℓ. Then every y′∈Wℓy satisfying ∥x′−y′∥≤∥x−y∥ satisfies y′≤y in root order, meaning y−y′ is a nonnegative real combination of positive roots. At integral weights with integer ℓ, these are nonnegative integer root combinations. No dominance condition on the intermediate points is required. The result is choice free.

Facts & Assumptions

Given: These Euclidean root data, alcove and points.

[F1]

The affine reflection arrangement and its alcoves are locally finite; after rescaling by ℓ, Wℓ acts simply transitively on alcoves. Facet reflection exchanges the two adjacent alcoves, and distinct alcove interiors are disjoint (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Alcove transitivity, the affine Coxeter presentation, and the length function, Alcove separation, facet reflections, panel types, and triviality of the fundamental alcove stabilizer).

Proof

Given: The notation in the statement. A point in the relative interior of F lies on its wall and on no other reflecting hyperplane.

1.1F1constructalgebra

By [F1], transport C to a fundamental alcove by an affine isometry, and fix an interior point p. For z=gy outside C, reflect z in any defining wall H of C whose interior halfspace it violates. No orbit point of y lies on a wall. This step strictly decreases ∥z−p∥, since p is strictly on the opposite side of H. The orbit Wℓy is a finite union of translates of the discrete lattice ℓQ, so every bounded ball contains finitely many of its points. The strictly decreasing procedure therefore terminates in C, at y: the regular orbit representative in C is unique by simple transitivity and disjoint alcove interiors in [F1].

2.1step 1.1algebra

Let dH be signed distance to H, positive on the interior side of C. Orthogonal decomposition normal to H gives ∥z−x∥2−∥rHz−x∥2=−4dH(z)dH(x). At each folding step dH(z)<0 and dH(x)≥0, so distance to x never increases, strictly decreasing unless x∈H. Exactly one defining wall contains x, namely the wall of F. Thus equality of the initial and terminal distances permits only sF steps. After one such step the point is on the interior side of that wall, so a second consecutive sF is impossible. Therefore ∥x−gy∥≥∥x−y∥, with equality exactly when gy=y or gy=sFy. Conversely both these points attain equality because sFx=x.

3.1F1step 2.1algebra

Apply step 2.1 with g=u−1v. In the first equality case take τ=u; in the second take τ=usF, using sFx=x. This proves the asserted common-isometry equality description. The stabilizer of x is {1,sF}: only two alcoves have x in their closures, and simple transitivity in [F1] identifies the two possible images of either incident alcove. Consequently the minimizing regular points paired with gx are precisely gy and gsFy.

4.1F1step 3.1induction

Suppose F is lower. Its defining reflection subtracts the positive multiple ((y,α)−kℓ)α, so sFy<y. Track both y0+=y and y0−=sFy, together with x0=x, through the prescribed downward reflections. At each stage the regular points lie in the two alcoves adjacent to the unique facet containing the current xj. Any reflecting hyperplane missing xj has both adjacent interiors on the same side as xj: an alcove interior cannot meet a wall, and if its interior lay on the other side from a point in its closure that wall would contain the closure point. A strict downward step uses a hyperplane missing xj. Hence both transported regular points satisfy its same strict downward inequality and are reflected by subtracting positive multiples of its positive finite root. Induction yields gy≤y and gsFy≤sFy<y, where g=rN⋯r1.

5.1step 3.1step 4.1algebra∎

For a regular orbit point y′ with ∥x′−y′∥≤∥x−y∥, step 3.1 forces equality and y′=gy or gsFy. Both are at most y by step 4.1. If the points are integral weights and ℓ is an integer, every subtracted positive-root coefficient is an integer by the weight pairings, including the initial facet reflection; this gives the asserted integral root order. The argument uses only finite reflection sequences and finite choices from fixed lists of defining walls, hence no Axiom of Choice.

Depends on

Used by

Dependency tree · two levels

36 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