Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge 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.

The A-tilde 1 infinity edge, separated from finite dihedral families and from the 4-edge

Statement

Let S={s,t}, let m(s,t)=∞, let V=RS with coordinate basis (es,et), and let B be the real Coxeter form. Thus the diagram is the two-vertex standard affine diagram A~1 with its single ∞-edge (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)), and [B](es,et)=(1−1−11) (The real Coxeter form, its radical, reflections, and form-preserving maps (2)). Then:

(i) The degenerate form. B is positive semidefinite of corank one, with rad⁡(B)=Rδ for δ=es+et=(1,1)>0. The product of the two generator reflections is represented by a nonidentity unipotent matrix of infinite order. Hence A~1 is of affine form type but its Coxeter group is infinite.

(ii) The slice and its reflection action. The slice E={φ∈V∗:φ(δ)=1} has coordinate α=φ(es) and φ(et)=1−α. Its walls are α=0 and α=1, its vertices are vs=(1,0) and vt=(0,1), and Aˉ=[vt,vs] is a Euclidean 1-simplex (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (2)-(4)). The facet reflections are ρ∗(s):α↦−α and ρ∗(t):α↦2−α. For the left dual action, (st)⋅α=α−2 and (ts)⋅α=α+2. Their group is the rank-one affine reflection group Wa(A1)≅2Z⋊{±1}; it acts simply transitively on the open alcoves {(k,k+1):k∈Z}.

(iii) Finite rank-two labels. If instead m(s,t)=m<∞, where m≥2, then det⁡[B]=1−cos⁡2(π/m)=sin⁡2(π/m)>0, so the Coxeter form is positive definite and has no radical. The presented group is finite: every word reduces to (st)k or (st)ks, and the relation (st)m=1 leaves at most 2m elements. For m≥3 these are the finite dihedral families I2(m); for m=2 the diagram is disconnected and the group is A1×A1. Thus among two-vertex Coxeter diagrams, the only affine one is A~1.

(iv) The label 4 is different. The two-vertex label-4 diagram is the finite B2=C2=I2(4) diagram; it is not A~1. In the standard affine extension of B2 or C2, the added affine vertex gives the three-vertex path with labels (4,4), namely B~2=C~2 (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (7); Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)).

(v) Source-hypothesis caveat. Davis's Euclidean simplex criterion, Theorem 6.8.12(ii), assumes that every Coxeter label is finite. The ∞-edge case above is established directly. Numerically, the convention cos⁡(π/∞)=1 agrees with lim⁡m→∞cos⁡(π/m)=1, but the infinite label imposes no finite (st)m relator and gives the degenerate matrix in (i).

Facts & Assumptions

Given: The two-element set S={s,t}, the Coxeter matrix with m(s,t)=∞, the coordinate space V=RS, its real Coxeter form B, and the dual affine slice of Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice.

[F1]

The Coxeter form has B(es,es)=B(et,et)=1 and B(es,et)=−1; for a unit basis vector the reflection is reu(v)=v−2B(v,eu)eu (The real Coxeter form, its radical, reflections, and form-preserving maps (2)-(3)).

[F3]

The group is presented by s2=t2=1 and the relator (st)m=1 only when m(s,t)<∞; an infinite label imposes no relator on the pair (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F4]

Affine form type means a connected diagram and a positive-semidefinite Coxeter form of corank one (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1)).

[F5]

For this affine form, the closed slice is a Euclidean simplex with vertices vu(eu)=1/δu, vu(ev)=0 for v≠u, and each generator acts by reflection in its wall (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (3)-(4)).

[F6]

A~1 is the two-vertex graph with an ∞-edge, and it is the only standard affine diagram with such an edge. The finite label-4 diagram is the two-vertex B2=C2=I2(4) diagram, while B~2=C~2 is the three-vertex path (4,4) (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1),(7)).

[F7]

π>0, cos⁡(π/2)=0, and sin⁡(π/2)=1 (Pi as twice the smallest positive zero of cosine, Quarter-turn values and shifts by pi/2 and pi).

[F8]

Cosine is strictly decreasing on [0,π], and sine is strictly increasing on [0,π/2] (Signs, monotonicity intervals, and ranges of sine and cosine).

[F9]
[F10]

In the affine highest-root table, both B2 and C2 add a label-4 edge to their finite label-4 diagram, giving the path (4,4) (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)).

[F11]

The functions (es,et) form the coordinate basis of RS: every function is determined by its two values and is their corresponding linear combination of es,et (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}).

[F12]

cos⁡0=1 from the defining power series (Sine and cosine defined by their real power series).

[F13]

Davis identifies the group generated by reflections in a Euclidean interval's endpoints as the infinite dihedral group (Example 6.4.1, printed p. 82).

[F14]

In type A1, Xiong describes the affine Weyl group using the coroot lattice Q∨=Zα∨ (Chapter 2, §§2.2–2.3, PDF p. 11).

[F15]

Davis's Theorem 6.8.12 assumes that no Coxeter label is ∞ (printed p. 102).

[F16]

Xiong records the low-rank finite Weyl-group coincidence B2=C2 (Chapter 1, Section 1.6, printed p. 4).

[F17]

Xiong identifies the dihedral group Dm of order 2m with the Coxeter group of type I2(m) (Chapter 1, Section 1.4, printed p. 3).

[F18]

Cosine is 1-Lipschitz: ∣cos⁡u−cos⁡v∣≤∣u−v∣ for all real u,v (Sine and cosine are 1-Lipschitz on R).

Proof

technique · compute the rank-two form, its reflection matrices, the slice coordinates, and the group orbit explicitly. No Choice is used
1.1F1F2F4F11algebra

The matrix in the statement gives B(xses+xtet,xses+xtet)=(xs−xt)2. Also B(x,es)=xs−xt and B(x,et)=xt−xs, so the radical is exactly R(es+et). Thus B is positive semidefinite of corank one; the diagram is connected, so the pair is of affine form type by [F4].

1.2F1F2F3F11algebra

In the ordered basis (es,et), direct substitution in [F1] gives [res]=(−1201),[ret]=(102−1). Both square to the identity. Their product is [resret]=(3−22−1)=I+N,N=(2−22−2),N≠0,N2=(2⋅2+(−2)⋅22⋅(−2)+(−2)⋅(−2)2⋅2+(−2)⋅22⋅(−2)+(−2)⋅(−2))=0. Since m(s,t)=∞, the presentation in [F3] has no relation beyond the two involutions, so the assignment s↦res, t↦ret defines a representation of W. For every integer k, (I+N)k=I+kN (use (I+N)−1=I−N for k<0), which is never the identity when k≠0. Thus the product is a nonidentity unipotent of infinite order and W is infinite.

1.3F5F11algebra

Here δs=δt=1. The slice condition is φ(es)+φ(et)=1, so with α=φ(es) its points are exactly (α,1−α) for α∈R. The vertices from [F5] are vs=(1,0) and vt=(0,1); the alcove inequalities give 0<α<1, and its closure is the Euclidean segment [vt,vs]. The two walls are its endpoints α=0 and α=1.

1.4F1F5F11algebra

For the left dual action, (w⋅φ)(v)=φ(ρ(w)−1v). Since each reflection is involutory, evaluating at es gives (s⋅φ)(es)=φ(−es)=−α. Also ret(es)=es+2et by [F1], so (t⋅φ)(es)=α+2(1−α)=2−α. Therefore s⋅α=−α and t⋅α=2−α. Under the left-action convention, (st)⋅α=s⋅(t⋅α)=α−2, while (ts)⋅α=t⋅(s⋅α)=α+2.

1.5F1F2F3F7F8F9F12F17algebra

If m=m(s,t)<∞, then m≥2 and 0<π/m≤π/2. By [F7]-[F8] and cos⁡0=1 from [F12], 0≤c:=cos⁡(π/m)<1. Therefore det⁡(1−c−c1)=1−c2=sin⁡2(π/m)>0, where the identity is [F9] and positivity follows from 0≤c<1. Moreover the quadratic form is (xs−cxt)2+(1−c2)xt2, positive for every nonzero (xs,xt); thus it has no radical. From [F3], ts=(st)−1 and every word reduces to an alternating word, hence to (st)k or (st)ks; the finite relator (st)m=1 reduces k modulo m, leaving at most 2m elements. At m=2 the generators commute; the presentation maps onto A1×A1 by sending them to the two factors, and the normal-form bound gives at most four elements, so W≅A1×A1. For m≥3, let X=Z/mZ and define permutations σ(j)=−j and τ(j)=1−j. They are involutions and (στ)(j)=j−1, which has exact order m. The m maps (στ)k are distinct translations, and the m maps (στ)kσ are distinct reflections. No reflection is a translation: equality of j↦−j−k and j↦j+ℓ at j=0,1 would imply m∣2, contrary to m≥3. By [F3], these permutations define a homomorphic image of W with 2m elements. Together with the upper bound, this proves that W is the finite dihedral group I2(m) of order 2m, with the standard Coxeter notation [F17].

2.1F3F5F11F13F14step 1.4algebra

Compositions of α↦−α and α↦2−α are precisely the maps α↦±α+2k for k∈Z: the product (ts)k is translation by 2k, and composing it with s gives every orientation-reversing map of this form. The images of (0,1) are all integer intervals: translations by 2k give (2k,2k+1) and composing those translations with α↦2−α gives (2k+1,2k+2). A positive-orientation map stabilizes (0,1) only when k=0; a negative-orientation map sends it to (2k−1,2k), which cannot equal (0,1) for integral k. Hence the action is simply transitive on these alcoves. This is the rank-one affine reflection group Wa(A1); its translation subgroup is 2Z and its linear part is {±1}, hence Wa(A1)≅2Z⋊{±1} as in Xiong's rank-one affine Weyl group example.

2.2F6F10F16step 1.5algebra

For m(s,t)=4, the finite diagram has one label-4 edge, whereas A~1 has one label-∞ edge by [F6]; these labelled graphs are distinct. Xiong's low-rank coincidence [F16] matches the two names B2 and C2 for this finite type. Their rank-two affine extensions have one additional label-4 edge by [F10], giving the three-vertex path (4,4)=B~2=C~2, not A~1.

3.1F1F3F12F15F18F19F20algebra∎

The matrix entry B(es,et)=−1 for m(s,t)=∞ is the defining convention in [F1]. For any ε>0, [F20] gives ε/π>0, so apply [F19] to choose N≥1 with 1/N<ε/π. If m≥N, then 0<N/m≤1, so 0<π/m≤π/N<ε. By the Lipschitz bound [F18] and cos⁡0=1 [F12], ∣cos⁡(π/m)−1∣≤π/m<ε; hence lim⁡m→∞cos⁡(π/m)=1, confirming that the matrix convention is the numerical limit. The infinite label still imposes no finite relator by [F3]. By [F15], Davis's cited Euclidean simplex criterion assumes every Coxeter label is finite, so the rank-one ∞-edge case is established directly here. No choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

121 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