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

Generic galleries, boundary-fixed disks, and the gallery-move calculus

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. For distinct a,b∈J, put mab:=ord⁡(sasb)∈{2,3,4,6,∞}; put maa=1. Let Wabs be the Coxeter group presented by this matrix, as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, with canonical generators σa. The finite-label relations hold for the affine reflections, so the universal property gives φ:Wabs→Wa, σa↦sa. If J=∅, take Wabs=Wa={1}.

(0) Translation lattices. The root and coroot lattices Q and Q∨ are discrete full-rank subgroups of E; in particular, each bounded subset of E meets either lattice in finitely many points.

(1) Generic paths and galleries. For any two alcoves there is a finite polygonal path between interior points whose vertices avoid every wall, whose segments cross walls transversely one at a time, and whose segment directions are not parallel to any codimension-two direction of the arrangement. The successive alcoves form a finite gallery. For a closed polygonal path with these genericity properties, each wall is crossed an even number of times. Here a codimension-two direction is ker⁡B(−,α)∩ker⁡B(−,β) for nonproportional roots α,β.

(2) Boundary-fixed generic disks. Call a closed polygonal path generic when its vertices avoid all walls, its wall intersections occur in edge interiors one wall at a time and transversely, and no edge direction is parallel to a codimension-two direction. Every such path p has a piecewise-linear disk filling D→E equal to p on ∂D. The wall preimage is a finite graph in D: its arcs meet ∂D transversely at the prescribed crossings, it misses all strata of codimension at least three, and its genuine interior vertices map transversely to codimension-two strata. Each such vertex is a rank-two multiway vertex: if the local dihedral label is m, exactly 2m wall branches meet there. Auxiliary degree-two subdivision points on smooth arcs are allowed. Every component of the complement of this graph maps into one alcove. A constant path at a regular point has the constant filling.

(3) Gallery moves. For any generic filling as in (2), refining a finite PL triangulation along its wall preimage gives a disk subdivision. Its dual diagram has a vertex for each refined alcove region and an edge across each interior side. If the incident regions map to distinct alcoves, that side lies on a type-a wall and its dual edge is labelled σa; otherwise the edge is labelled 1. Thus auxiliary sides inside an alcove region, and any wall touches with the same image alcove on both sides, carry the identity. Original alcove regions need not be disks: closed wall-preimage loops and annular regions are allowed. After omitting identity letters, the face words are empty, σa2, or alternating rank-two words (σaσb)m (or their reverses). Collapsing the faces of this finite simply connected diagram changes its boundary gallery by finitely many backtracks and replacements of one boundary arc of a rank-two polygon by the complementary arc; in particular, replacing one half by the other is the rank-two braid move. Thus any two generic fillings of the same boundary give the same element of Wabs.

(4) Closed-gallery consequence. If w∈Wabs satisfies φ(w)(A)=A, then w=1 in Wabs.

No axiom of choice is used.

Facts & Assumptions

Given: The finite reduced crystallographic root system Φ⊂E, its affine walls and reflections, and the fundamental alcove and facet types above.

[F1]

The simple roots form a real basis; the root and coroot lattices are their respective integer spans. The simple-coroot basis and its integral generation of all coroots are proved in the Remark of Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W, so each lattice is free abelian of rank dim⁡E (Root, coroot, weight, and coweight lattices).

[F2]

The affine walls are the level hyperplanes defined in Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group; the arrangement is locally finite; the affine group permutes its walls and alcoves; every alcove is open and convex; and for each simple root αs, tαs∨=rαs,1∘rαs,0∈Wa (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W).

[F3]

Under the orthogonal sum of the component spaces, the fundamental alcove is a product of bounded geometric simplices with the listed affine facets (Highest-root dominance and the fundamental alcove).

[F4]

On the orbit Wa⋅A, shared-panel types agree and the reflection in a type-a facet of g(A) is gsag−1 (Alcove separation, facet reflections, panel types, and triviality of the fundamental alcove stabilizer).

[F5]

Rank-two residues have 2m sectors with alternating types a,b, where m∈{2,3,4,6} (Point stabilizers, vertex residues, and rank-two boundary words (2)–(3)).

[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]

In a real topological vector space, the convex hull of a finite family of nonempty compact convex sets is compact (Convex closures and hulls of finitely many compact convex sets).

[F8]

A finite Coxeter matrix defines the group presentation with relators σa2 and (σaσb)mab for finite labels, and its universal property supplies homomorphisms preserving those relations (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F9]

A polygonal path has finitely many affine segments (Polygonal paths and polygonally connected subsets of Rn).

[F15]

The convex hull is the set of finite convex combinations; it contains its generators and is convex (Local convexity, convex and balanced sets, and the continuous dual).

[F16]

In a geometric simplex of dimension at least two, any two distinct facets meet in the codimension-two simplex spanned by their common vertices; this follows from the affinely independent vertex description (The geometric simplex spanned by affinely independent vertices).

Proof

technique · finite general position followed by the planar dual diagram
1.1F1F10F17algebra

If E=0, both lattices are {0}. Otherwise, by [F1] choose a basis β1,…,βr of simple roots for Q and a basis of simple coroots for Q∨. For either basis, its Gram matrix is invertible by positive definiteness, so there is a dual basis β1∗,…,βr∗ with B(βj,βi∗)=δij. Cauchy–Schwarz follows directly from 0≤B(u−tv,u−tv) by taking t=B(u,v)/B(v,v) when v≠0. If K is bounded, [F17] gives a center x0 and r>0 with ∥x−x0∥<r for all x∈K; by the triangle inequality [F10], R:=r+∥x0∥+1 bounds ∥x∥ for every x∈K. If λ=∑jnjβj∈K is in the corresponding lattice, then ni=B(λ,βi∗) and ∣ni∣≤R∥βi∗∥. Each integer coordinate therefore has finitely many possibilities, so K meets the lattice in finitely many points. This applies to both bases. Such finite intersection with bounded sets also gives discreteness: in a bounded ball about any lattice point there are finitely many other lattice points, so a smaller ball excludes them all. Thus both lattices are discrete and full rank.

1.2F7F10algebra

In the induced norm topology, 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. Therefore the norm topology makes E a real topological vector space in the sense of [F10], as required for the compact-hull result [F7].

1.3F2F4F6F7F10F11F12F13F14F15choosealgebra

If E=0, the unique alcove is the whole space, so the empty gallery works. Otherwise fix interior points x∈C and y∈C′. By [F11] and [F12], choose a compact closed ball K0 of positive radius and let O be its nonempty open interior. The singleton sets {x} and {y} and K0 are compact convex sets by [F13] and [F14]; hence K:=co⁡({x}∪{y}∪K0) is compact by [F7] and convex by [F15]. It contains x,y,O and every segment from either endpoint to a point of O. By [F2], only finitely many walls meet K, hence only finitely many codimension-two flats P arise as intersections of distinct walls meeting it. For each such P, x,y∉P, so aff⁡({x}∪P) and aff⁡({y}∪P) are proper affine subspaces. Also exclude x+D and y+D for each codimension-two direction subspace D, the singleton sets {x} and {y}, and the finitely many walls meeting K; all these affine sets are proper. Choose a direction d outside the finite union of their direction subspaces by [F6]. Starting at a point z0∈O, vary z=z0+td over a sufficiently small open interval of real t so that z remains in O. Each excluded affine set meets this line in at most one point, so choose t outside the resulting finite set. Then z is regular, neither segment [x,z] or [z,y] meets a codimension-two flat, and neither direction is parallel to a codimension-two direction. Each segment meets only finitely many walls by [F2]; its regular endpoints ensure every crossing is transverse, and avoiding the flats ensures no two walls are met at one point. The crossings therefore give a finite gallery. Starting from A, induct along this gallery: if the current alcove is g(A), its crossed facet is g(Fa) for some a∈J because A has exactly the listed facets. The panel-reflection rule in [F4] makes reflection in that wall gsag−1, so the next alcove is gsa(A) and remains in Wa⋅A. Thus every alcove is in the orbit, with no use of the later presentation theorem.

1.4F9algebra

For a closed generic polygonal path, fix a wall H and a defining affine functional f with H=f−1(0). Along each segment the sign of f changes exactly when the path crosses H, and a transverse crossing changes it once. Since the path is closed and its vertices are off H, the initial and final signs agree; therefore the number of crossings of H is even.

1.5F2F3F5F8F16algebra

For any two types a,b from different irreducible components, their facet reflections act on orthogonal factors and are distinct commuting involutions, so mab=2. For two types in one component of rank at least two, their simplex facets meet in a codimension-two face by [F16]; choose a point in its relative interior. The local rank-two residue in [F5] shows the product has finite order mab∈{2,3,4,6}. The only pair of distinct types in a rank-one component is its two opposite endpoint reflections rα,1 and rα,0; [F2] and the reflection identity give rα,1rα,0=tα∨. Since α∨≠0, its positive powers are nonzero translations, so this product has infinite order. These cases define the Coxeter matrix in the statement. The finite-label relations hold for the corresponding affine reflections, so [F8] gives φ. If J=∅, the root system is empty and all assertions are immediate.

2.1F2F5F6F7F9F10F11F12F13F14F15choosealgebra

Let p be a nonconstant generic closed polygonal path with vertices b0,…,br−1 (indices taken cyclically). Let C0 be the alcove containing the regular vertex b0. Since C0 is open, choose R>0 with BE(b0,R)⊆C0. By [F11] and [F12], choose 0<ρ<R such that K0:=B‾E(b0,ρ) is metric-compact; it is compact in the norm-topological-vector-space topology by [F13] and convex by the triangle inequality in [F10]. Put O:=BE(b0,ρ)⊆C0. The finitely many singleton sets {bj} are compact convex by [F14], so K:=co⁡({b0}∪⋯∪{br−1}∪K0) is compact by [F7] and convex by [F15]. It contains the boundary path and every segment from a boundary point to any q∈O. Only finitely many walls meet K by [F2]. There are finitely many nonempty intersections P of two or more distinct walls in this list. For each codimension-two P and boundary edge e=[bj,bj+1], put dj=bj+1−bj. Boundary genericity gives dj∉dir⁡(P). Exclude the affine locus bj+dir⁡(P)+Rdj, which has dimension dim⁡E−1: outside it, the images of q−bj and dj in E/dir⁡(P) are linearly independent. Also exclude aff⁡(P∪{bj}), which is proper because bj∉P; this keeps radial edges away from P. For every intersection P of codimension at least three, exclude aff⁡(P∪e), whose dimension is at most dim⁡E−1. Exclude all listed walls and, when dim⁡E≥2, the affine spans of the boundary edges. The finite affine-avoidance argument of step 1.3, applied to this finite family of proper affine sets in O, leaves q∈O outside the family. Cone a topological polygonal disk from its central vertex to the boundary path, mapping the center to q. Its image lies in K. On each cone triangle the pullback of a wall is empty or a straight segment; the exclusions make triangles nondegenerate in dimension at least two, prevent multiwall crossings on radial edges, and make the affine plane of each triangle meet any codimension-two P in at most one point, transversely. Any such point on the disk lies in a triangle interior, since boundary and radial edges avoid P. The higher-codimension exclusions keep the image away from all strata of codimension at least three. Thus genuine interior vertices have exactly 2m branches by [F5]; radial-edge kinks are only degree-two points. In dimension one there are no codimension-two strata; the same cone still gives finite wall segments on its triangles. Dimension zero has only the constant path. Local finiteness gives finitely many graph pieces, with the prescribed transverse boundary crossings. Every component of the complement maps continuously into the wall complement and hence into one alcove.

3.1F2F7step 2.1constructalgebra

Let h:D→E be any generic PL filling with the properties in (2), including the cone constructed in step 2.1. Fix a finite triangulation on which h is affine. Its image is compact: each triangle image is the convex hull of its three vertex images, compact by [F7], and there are finitely many triangles. Thus only finitely many walls meet it by [F2]. On each triangle the pullback of a wall is the zero set of an affine functional, hence is empty, a line segment, or a subset of the triangle boundary; it cannot contain a whole triangle because the wall preimage is a graph. Subdivide the triangle along these finitely many line segments. Each resulting two-dimensional cell is the intersection of that triangle with finitely many closed half-planes and has nonempty interior, so it is a convex polygon and its closure is a disk. Subdivide shared triangle edges at all endpoints to make these subdivisions agree. The resulting finite subdivision of D contains the entire wall graph in its edges. Edges outside that graph are auxiliary: their interiors and the regions on both sides map to the same alcove. This construction also cuts annular regions and closed wall loops into disk regions; it makes no assumption on the topology of an original alcove region.

4.1F4F5F8step 1.3step 3.1constructalgebra

In the subdivision of step 3.1 place a dual vertex in each polygon interior, join it to the midpoints of its sides by noncrossing spokes, and join spokes across interior sides. Fill the dual polygons surrounding interior subdivision vertices. In each polygon the sectors adjoining its boundary sides form a boundary collar; retracting this collar onto the dual spokes shows that the resulting diagram is connected and simply connected. Its outer boundary follows the original boundary gallery, with possible spurs. At a side interior, the image lies either off the walls or on exactly one wall. Its two incident region images are therefore either the same alcove or the two adjacent alcoves at that wall. In the latter case label the dual edge by the common panel generator σa using [F4]; in the former case label it by 1, including auxiliary sides and any wall touches. Around an interior subdivision vertex off the wall graph all letters are 1. Around a degree-two wall point, ignoring identity edges leaves two crossings of the same panel and the word σa2 if the two sides map to different alcoves, and the empty word if they map to the same alcove. The two branches have the same crossing behaviour because each local complementary half-disk maps into a single alcove. Around a genuine rank-two vertex, ignoring auxiliary edges leaves the alternating 2m crossings and the word (σaσb)m or its reverse by [F5]. All these face words are trivial by [F8]. To reduce the boundary, choose a spanning tree of the face-adjacency graph rooted at the exterior face. This graph is connected: a path from any face interior to the exterior can be perturbed within the finite polygonal subdivision to avoid vertices and cross edges transversely. Process bounded faces in increasing tree distance from the root. Each parent edge is then incident to just its remaining child face, so collapsing that face across the parent edge replaces a boundary occurrence by the complementary face path and preserves simple connectivity. After all faces are removed, the remaining connected simply connected graph is a tree; its boundary walk reduces by edge backtracks. Omitting identity-labelled edges throughout, empty faces do not change the gallery, degree-two faces insert or remove a backtrack, and rank-two faces replace complementary alternating arcs. The boundary therefore reduces to the empty gallery by precisely the asserted moves, including braid moves between alternating halves. This proves the claim for every generic filling, not just the constructed cone.

5.1F2F4F6F8F9F10F11F12step 1.3step 2.1step 4.1algebra∎

Let w=σa1⋯σan with φ(w)(A)=A. The alcoves Cj:=φ(σa1⋯σaj)(A), with C0=A, form a closed gallery, because each consecutive pair is adjacent across a facet of type aj. For each panel crossing, choose a point in the relative interior of its panel outside all other walls, then a small ball meeting only its panel wall. Indeed, by [F11] and [F12] a small compact ball around any point of the panel meets finitely many walls; their intersections with the open panel are proper affine subspaces of its wall, so the finite affine-avoidance argument of step 1.3 supplies such a point (in a zero-dimensional panel, no distinct wall can contain that point). For each of the finitely many other walls Hβ,l meeting the compact ball, B(q,β)≠l. By Cauchy--Schwarz in [F10], if ∥u−q∥<∣B(q,β)−l∣/(2∥β∥) then B(u,β)≠l. Taking the minimum of these finitely many positive radii and shrinking inside the compact ball gives the required neighborhood meeting only the panel wall. Fix one endpoint in one open half-ball; in the opposite open half-ball choose the second endpoint outside the finitely many affine sets x+D, where x is the fixed endpoint and D ranges over codimension-two direction subspaces. This is possible by the finite line-avoidance argument of step 1.3. The joining segment lies in the ball, crosses that wall once and no other, and is not parallel to any codimension-two direction. In each intermediate alcove, let x,y be the outgoing and incoming crossing endpoints. Choose a small open ball around an interior point of [x,y] contained in the alcove. Within it choose z outside every x+D and y+D and outside the singleton sets {x},{y} by the same finite-avoidance argument. Convexity of the alcove makes [x,z]∪[z,y] a path inside it, with both directions avoiding all codimension-two directions. The resulting closed polygonal path has regular vertices, crosses exactly the gallery panels and meets them transversely, and is generic as in (2). Its crossing word is w up to a cyclic starting point. Apply steps 2.1–4.1: its boundary word is trivial in Wabs. A cyclic conjugate of w is therefore 1, and conjugating back gives w=1. If the word is empty or E=0, the conclusion is immediate. No axiom of choice is used: all lists of roots, walls, flats, vertices, and moves are finite.

Remarks

Open Step-3 supplier obligations. For consumer lem-cg-affine-generic-gallery-paths-and-disk-moves, the current-run draft supplier def-hh-coxeter-matrix-word-group-and-length is used in the Statement and Fact F8, and in proof steps 1.5, 4.1 and 5.1 for the universal presentation and defining relators. The current-run draft supplier lem-cg-affine-point-stabilizers-and-vertex-residues is used in Fact F5 and proof steps 1.5, 2.1 and 4.1 for rank-two residue sectors, branch counts and boundary words. The proof-use checks are provisional until these suppliers receive completed Step-3 decisions; this consumer item decision remains escalated.

Depends on

Used by

Dependency tree · two levels

156 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