Alphabeta Math
Pipeline-generated
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.

✓ 1 result · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 1 also cleared it.

Affine Coxeter Diagrams and Semidefinite Classification — Examples

1 · Prerequisites

2 · Summary

This companion page is a dependency leaf. Each example uses the theory on affine-coxeter-diagrams-and-semidefinite-classification and its established prerequisite closure. The earlier trigonometric-and-oscillatory-examples-in-one-variable supplies the Lipschitz estimate for cosine used in the finite-dihedral comparison. No theory page depends on examples homed here.

Examples

The examples are listed in current dependency order:

Each item states its hypotheses and checks its calculations locally. The page makes no hyperbolic realization claim.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Reducible positive semidefinite forms: factorwise treatment and the square alcove

Example

Let (W,S,m) be a Coxeter system with S finite and disconnected diagram Γ, whose connected components have nonempty vertex sets S1,…,Sk (Coxeter diagrams: edges, labels, components and finite type (2)); let Wi:=WSi, V=RS, Vi:=span⁡{es:s∈Si}, and let B be the Coxeter form on V (The real Coxeter form, its radical, reflections, and form-preserving maps). Here positive semidefinite means B(v,v)≥0 for every v, corank means dim⁡rad⁡(B), and indefinite means the form takes both positive and negative values. Write Bi:=B∣Vi×Vi and rad⁡(Bi):={v∈Vi:Bi(v,w)=0 for all w∈Vi}. Then:

(i) Factorwise structure. The form is the orthogonal direct sum B=B1⊕⋯⊕Bk on V=V1⊕⋯⊕Vk, and W≅W1×⋯×Wk with length additive (Disconnected diagrams, direct products, and comparison of invariant forms (1)-(2)). The form B is positive semidefinite if and only if every Bi is; it is positive definite if and only if every Bi is; and rad⁡(B)=⨁i=1krad⁡(Bi), so dim⁡rad⁡(B)=∑i=1kdim⁡rad⁡(Bi).

(ii) The corank-one criterion. The form B is positive semidefinite of corank one if and only if exactly one component form is positive semidefinite of corank one and every other component form is positive definite. The unique corank-one block has connected diagram, hence affine form type by Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1); each positive-definite component is finite by Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1) applied to its restricted Coxeter system. Thus reducible corank-one semidefinite forms consist of one affine component and finitely many finite components.

(iii) Two computations. For S1={s,t} with m(s,t)=∞, the block matrix is (1−1−11), its quadratic form is (x−y)2, and it has the positive radical vector es+et. With an additional one-generator component S2={u}, the block is (1) and the full form has corank one with kernel R(1,1,0). With a second two-generator component S2={u,v} and m(u,v)=∞, the full radical is R(1,1,0,0)⊕R(0,0,1,1), so the corank is two and W≅D∞×D∞, where D∞ is the infinite dihedral group W(A~1) (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)).

(iv) The square chamber. Let E=R2 with its Euclidean metric and Q=[0,1]2. Let r1,r2 be reflection in the vertical sides x=0,1, and s1,s2 reflection in the horizontal sides y=0,1. The group G=⟨r1,r2,s1,s2⟩≤Isom⁡(E) is isomorphic to D∞×D∞: the two parallel pairs give the two infinite-dihedral factors, and reflections from different pairs commute and have product of order two. The resulting Coxeter diagram is A~1⊥A~1. The G-translates of the closed square are all unit grid squares; they cover E and have pairwise disjoint interiors. Moreover every G-orbit meets Q in exactly one point, so Q is a strict fundamental domain in this stated sense. Its four walls form two parallel pairs, and its interior angle at each vertex is π/2.

(v) Consequences. The connected-matrix affine classification applies factorwise: in the positive-semidefinite corank-one case there is exactly one affine component and all remaining components are finite. Any component on which Bi takes a negative value makes B indefinite: each component has a vertex s with Bi(es,es)=1. Two components with nonzero radicals force dim⁡rad⁡(B)≥2. No connected affine-form-type condition is imposed on a reducible matrix as a whole.

Facts & Assumptions

Given: A finite-rank Coxeter system (W,S,m), its disconnected diagram with connected components S1,…,Sk, the coordinate subspaces Vi and Coxeter form B as above. In the square calculation, E=R2 has distance d((x,y),(x′,y′))=(x−x′)2+(y−y′)2.

[F1]

For disconnected Γ, W1,…,Wk commute, their product map is an isomorphism, length is additive, and V=V1⊕⋯⊕Vk is an orthogonal direct sum for B (Disconnected diagrams, direct products, and comparison of invariant forms (1)-(2)). This is an in-run supplier whose current proof decision is still open; its use is provisional pending that item audit.

[F2]

The component vertex sets are nonempty and partition S, and Vi is spanned by the coordinate vectors indexed by Si (Coxeter diagrams: edges, labels, components and finite type (2), The real Coxeter form, its radical, reflections, and form-preserving maps). The Coxeter form has B(es,es)=1 and is symmetric bilinear.

[F3]

The subgroup WSi with generating set Si is the Coxeter system for the restricted matrix on Si (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)); for a Coxeter system, its group is finite exactly when its Coxeter form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)). Both are current in-run suppliers; their uses remain provisional until their item decisions are reconciled.

[F4]

The radical consists of vectors annihilating every vector, and corank is its dimension (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space).

[F6]

A Coxeter group is the quotient by the relators a2=1 and (ab)m=1 for finite labels m; its universal property extends a generator assignment satisfying these relators to a homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F8]

A Euclidean isometry is a bijective distance-preserving map (Isometry, isometric embedding, and the subspace metric on a subset); in particular the coordinate reflections and the explicit maps computed below are checked against the Euclidean distance directly.

[F9]

The standard diagram A~1 is the two-vertex diagram with its single edge labelled ∞ (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)).

[F11]

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

[F12]

Every real z has a unique integer n with n≤z<n+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

Verification

technique · direct block calculations, followed by explicit one- and two-dimensional reflection computations
1.1F1F10algebra

(Definiteness is blockwise.) By [F1], if v=∑ivi with vi∈Vi, then B(v,v)=∑iBi(vi,vi). If B is positive semidefinite, taking v supported in one block shows each Bi is positive semidefinite; conversely, if every block is positive semidefinite, every term in the sum is nonnegative. The same one-block test proves that positive definiteness of B implies positive definiteness of each Bi; conversely, if each Bi is positive definite and v≠0, at least one vi≠0, so the corresponding term is positive and all other terms are nonnegative.

1.2F1F2F4F5algebra

(Radicals and coranks add.) Bilinearity and orthogonality give B(v,wi)=Bi(vi,wi) for every wi∈Vi. Thus v∈rad⁡(B) exactly when vi∈rad⁡(Bi) for every i, and the direct decomposition of V makes rad⁡(B)=⨁irad⁡(Bi). The vectors es for s∈Si are linearly independent by their coordinates and span Vi by definition, so Vi is finite-dimensional. Each radical is a linear subspace because its annihilation conditions are linear by bilinearity, hence it is finite-dimensional by the subspace dimension theorem. Applying the finite direct-sum dimension formula to these radical subspaces gives dim⁡rad⁡(B)=∑idim⁡rad⁡(Bi). This also covers k=0: then V=0 and both sides are zero.

1.3F1

(Group and length factorization.) The factorwise group isomorphism and length-additivity assertion are precisely F1; their current supplier proof remains open for this run, so this citation is used provisionally and is recorded as an open obligation.

1.4F6F7F8F9algebra

(The line reflection factors.) In E=R2 define r1(x,y)=(−x,y), r2(x,y)=(2−x,y), s1(x,y)=(x,−y) and s2(x,y)=(x,2−y). The identity, composites and inverses of bijective distance-preserving maps are again bijective and distance-preserving, so Isom⁡(E) is a group under composition; the four displayed maps are involutive isometries by the coordinate distance formula. Put Hx:=⟨r1,r2⟩ and Hy:=⟨s1,s2⟩. The maps in Hx are exactly (x,y)↦(εx+2k,y) with ε∈{1,−1} and k∈Z: composition sends parameters (ε,k),(η,l) to (εη,εl+k), the identity has parameters (1,0), and the inverse of (ε,k) has parameters (ε,−εk), so these maps form a subgroup. The translation r2r1 is x↦x+2, and its powers, followed by r1, give every displayed map. By [F6], sending the two Coxeter generators a,b of W(A~1) to r1,r2 defines a homomorphism to Hx: both images are involutions, and the infinity label supplies no further relator. Every word in a,b reduces by a2=b2=1 to an alternating word, hence to (ab)k or (ab)ka for some k∈Z. Their images are respectively x↦x−2k and x↦−x−2k, which are pairwise distinct and exhaust the displayed maps, so the homomorphism is bijective and Hx≅W(A~1)=D∞. The same coordinate calculation gives Hy≅D∞.

2.1F2F3F4F10F11step 1.1step 1.2algebra

(Corank one.) Suppose first that B is positive semidefinite with dim⁡rad⁡(B)=1. Step 1.1 makes every Bi positive semidefinite, and step 1.2 says the nonnegative integers di:=dim⁡rad⁡(Bi) sum to one; hence exactly one di is one and all others are zero. For any positive-semidefinite block C with zero radical, if C(v,v)=0, then for every w and every real t, 0≤C(v+tw,v+tw)=2tC(v,w)+t2C(w,w); if C(v,w)≠0, sufficiently small t of the opposite sign makes the right-hand side negative, a contradiction. Therefore such v is in the radical, so zero radical implies C(v,v)>0 for every nonzero v, i.e. C is positive definite. Conversely, if exactly one block is positive semidefinite of radical dimension one and all others are positive definite, step 1.1 gives B positive semidefinite and step 1.2 gives radical dimension one. The forms Bi are symmetric bilinear and the component diagrams are connected by Fact F2. Thus the unique block is of affine form type by Fact F11; the other blocks are finite type by Fact F3.

2.2F1F2F4F9F10step 1.2step 1.3step 1.4algebra

(The two block examples.) For m(s,t)=∞, the defining entries of B give B1((x,y),(x,y))=x2−2xy+y2=(x−y)2, so it is positive semidefinite with positive radical vector es+et and radical R(es+et). A one-generator block has matrix (1), hence is positive definite and has zero radical; with this block the full radical is spanned by (1,1,0). With two m=∞ blocks, the orthogonal sum has radical spanned by (1,1,0,0) and (0,0,1,1) and has corank two by step 1.2. The group factorization from step 1.3 and the identification in step 1.4 give W≅D∞×D∞.

2.3F7F8step 1.4algebra

(The square group and its product map.) Let G=⟨r1,r2,s1,s2⟩≤Isom⁡(E). The groups Hx and Hy from step 1.4 commute elementwise because they act on separate coordinates, their intersection is the identity because a map acting trivially on both coordinates is the identity, and they generate G. The map μ:Hx×Hy→G, μ(hx,hy)=hxhy, is a homomorphism by commutation, is surjective by generation, and is injective since hxhy=1 implies hx=hy−1∈Hx∩Hy={1}. Thus it is an isomorphism by [F7], and step 1.4 identifies both factors with D∞. Within either parallel pair the product is a nonzero translation by two units and has infinite order; across the pairs the reflections commute, and their product is a nonidentity involution because a vertical reflection moves some first coordinate while a horizontal reflection fixes every first coordinate. The products therefore give the disconnected diagram A~1⊥A~1.

3.1F12step 1.4step 2.3algebra

(Grid and strict fundamental domain.) The orbit of [0,1] under Hx is {[2k,2k+1],[2k−1,2k]:k∈Z}, exactly the unit intervals [m,m+1]; [F12] applied to each real x gives m≤x<m+1, proving coverage of R, and the interval interiors are pairwise disjoint. The corresponding statement holds for Hy, so the G-translates of Q are exactly all grid squares, covering E with pairwise disjoint interiors. To prove the stronger orbit assertion including boundary points, apply [F12] to x/2 and put n=⌊x/2⌋, u=x−2n; then n∈Z and 0≤u<2. Its orbit under Hx is {u+2j,−u+2j:j∈Z}; if 0≤u≤1, its unique value in [0,1] is u: among the values u+2j only j=0 qualifies, and among −u+2j the only possible additional values occur at (u,j)=(0,0) or (1,1) and equal that same point. If 1<u<2, the unique value there is 2−u=−u+2. Applying this independently to both coordinates shows every G-orbit meets Q in exactly one point.

4.1F2step 1.2step 3.1algebra∎

(The remaining geometric and factorwise conclusions.) The four side walls are x=0, x=1, y=0, and y=1; at each of the four vertices one vertical and one horizontal wall meet, so the interior angle is π/2. Step 3.1 proves the precise closed-square tiling and orbit statement in (iv), including boundary points. Clauses (i)-(ii) give the positive-semidefinite corank-one factorization in (v); if one block has a vector of negative quadratic value, the same vector in V shows that B is indefinite, and if two blocks have nonzero radicals, step 1.2 gives radical dimension at least two. If k=0, then V=0 and dim⁡rad⁡(B)=0, so both sides of the equivalence in (ii) are false and the empty direct sums in (i) have value zero. All arguments use finite sums and explicit constructions, so no Choice is used.

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

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.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The radical vector of A-tilde 2 and its Euclidean slice

Example

Let S={s1,s2,s3}, m(si,sj)=3 for i≠j, so that Γ=A~2 (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1)), and let B be the cosine matrix B=(1−12−12−121−12−12−121) on V=RS (The real Coxeter form, its radical, reflections, and form-preserving maps). Then:

(i) B is positive semidefinite of corank one, its kernel is rad⁡(B)=Rδ with δ=es1+es2+es3=(1,1,1)>0 (Positive radical, corank one, positive definiteness of proper submatrices, and domination exclusions (1)), and all proper principal submatrices of B (the rank-two principal minors) are positive definite. The eigenvalue statement behind the corank: Bv=0 for v=(1,1,1), and B(v,v)=3−6⋅12=0; the determinant is zero and each 2×2 principal submatrix has determinant sin⁡2(π/3)=34>0 (Sylvester's criterion: a real symmetric n×n matrix with n≥1 is positive definite if and only if all leading principal minors are positive).

(ii) The radical quotient U=V/Rδ is two-dimensional Euclidean; the affine slice is E={φ∈V∗:φ(δ)=1}, i.e. φ=(φ(es1),φ(es2),φ(es3)) with coordinate sum 1, and the three vertices of the alcove simplex (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (3)) are v1=(1,0,0), v2=(0,1,0), v3=(0,0,1) (coordinate functionals). The alcove Aˉ=conv⁡{v1,v2,v3} is the standard equilateral triangle: the three side vectors are differences of distinct vertices, each of dual b∗-norm squared 4/3, so the side length is 2/3 (the dual metric is the slice metric, rather than the quotient form applied to the same coordinate tuple).

(iii) The three walls φ(esi)=0 meet pairwise at the angle π/3 (their normals are the classes of the esi, whose pairwise b-pairing is −12=−cos⁡(π/3)), so each facet-reflection product has order 3; the facet reflections generate the faithful affine action of W(A~2) on E (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (4)), in agreement with the constant term δsφ(es)-relation ∑sδsφ(es)=1.

(iv) Comparison with the crystallographic A2 alcove: A~2 is the alcove diagram of the root system A2 by Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1); both alcoves have facet normals with the same Gram matrix B and are therefore similar facet-to-facet by Euclidean simplices with the same facet-normal Gram matrix are similar facet to facet; the two reflection groups are conjugate. The A2 alcove of Highest-root dominance and the fundamental alcove (2) in its ambient Euclidean plane is accordingly related to the slice triangle Aˉ=conv⁡{v1,v2,v3} by a similarity matching facets, and the ratio of the side lengths gives the scale factor.

(v) The radical vector is exactly the positive relation among the facet normals: δs1uˉs1+δs2uˉs2+δs3uˉs3=0 in U (The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (2)-(3)), and the property that its coefficients are all positive is what makes Aˉ a bounded simplex rather than an unbounded cone.

Facts & Assumptions

Given: The three-vertex all-3 diagram and its displayed form.

[F1]

The form is the cosine form, whose generator reflections are rs(v)=v−2B(v,es)es (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F2]

The quotient and dual slice metric use b♭ and its inverse, not the same coordinate quadratic form on vectors and functionals (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (3)–(4)).

[F3]

The slice vertices, simplex normals, faithful action and reflection formulas are The affine slice: faithful isometric action, the alcove simplex, and its facet reflections (1)–(4).

[F4]

The A2 root system has simple roots α1=e1−e2,α2=e2−e3, highest root θ=e1−e3, and the alcove inequalities are (x,αi)>0, (x,θ)<1 (Classical root systems in coordinates, Highest-root dominance and the fundamental alcove). Its affine facet-normal Gram matrix is the one displayed here (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)–(2)).

[F5]

Equal facet-normal Gram matrices give a facet-matching similarity conjugating the reflection groups (Euclidean simplices with the same facet-normal Gram matrix are similar facet to facet).

Proof

technique · direct; all finite coordinate constructions use no choice principle
1.1F1algebra

For x=(x1,x2,x3), direct expansion gives B(x,x)=12((x1−x2)2+(x2−x3)2+(x3−x1)2). It is nonnegative and vanishes exactly on R(1,1,1); matrix multiplication also gives B(1,1,1)=0, so this is precisely the radical. Each two-coordinate principal form is a2−ab+b2=(a−b/2)2+3b2/4, positive definite; the one-coordinate forms are (1) and the empty case is vacuous. Their determinants are 3/4, and the full determinant is zero.

2.1F1F2F3step 1.1algebra

The slice relation is φ1+φ2+φ3=1, and [F3] gives its coordinate vertices vi and triangular closure. Put H:={z∈R3:∑izi=0}. Every class in U=V/R(1,1,1) has a unique representative in H, obtained by subtracting the mean of its coordinates, so H→U is a linear isomorphism. The direction space Kδ consists of functionals with coordinate tuple y=(ψ(es1),ψ(es2),ψ(es3))∈H; under the representative identification, ψ(zˉ)=∑iyizi, so y represents ψ using the standard dot product on H. For z∈H, the matrix in [F1] gives Bz=(3/2)z; hence b♭(z) is represented by (3/2)z, and b♭−1ψ is represented by z=(2/3)y. Therefore b∗(ψ,ψ)=B(z,z)=(2/3)∑iyi2. Each difference vi−vj has tuple with one 1, one −1 and one zero, so its squared length is 4/3. All three sides therefore have length 2/3 in the prescribed Euclidean slice metric.

3.1F1F2F3step 2.1algebra

The inward unit normals are b♭(eˉi); their pairings are −1/2 for distinct indices by [F3]. The walls of the triangle thus meet at interior angle π/3, and composing two line reflections gives rotation by 2π/3, of exact order three. The facet reflections generate the faithful action by [F3]. The relation among the normals is ∑ib♭(eˉi)=b♭(δˉ)=0, with all coefficients one. Its positivity gives the bounded coordinate simplex directly: φi≥0 and ∑iφi=1 bound each coordinate.

4.1F4F5step 1.1step 2.1step 3.1algebra∎

In the coordinate A2 plane x1+x2+x3=0, the closed root alcove is x1≥x2≥x3 and x1−x3≤1. Its vertices are the intersections of pairs of its three wall equations. The equations x1=x2 and x2=x3, together with the coordinate sum, give (0,0,0). For x1=x2 and x1−x3=1, write x1=x2=a, x3=a−1; then 3a−1=0, giving (1,1,−2)/3. For x2=x3 and x1−x3=1, write x2=x3=b, x1=b+1; then 3b+1=0, giving (2,−1,−1)/3. Each point satisfies the remaining inequality. Each difference of two distinct vertices is, up to coordinate permutation and sign, (2,−1,−1)/3, so its squared length is (4+1+1)/9=2/3. By [F4,F5] the root alcove and slice triangle are similar facet to facet, and the similarity from root alcove to slice has scale 2, since (4/3)/(2/3)=2. It conjugates the corresponding reflection groups. This proves all the stated radical, wall, metric and comparison data without Choice.

ExampleConstruction: AI-generatedVerification: AI-generatedaudited 2026-10-08Open item page →

B-tilde versus C-tilde: the n=2 coincidence and the duality behind the difference

Example

Compare the standard affine diagrams B~n and C~n (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (2),(3)) and the crystallographic scalings that produce them:

(i) The coincidence at n=2. B~2=C~2 is the three-vertex path with edge labels (4,4): the n=2 member is defined by the coincidence convention, and both its edges carry label 4. Both arise from the same finite type: B2 and C2 are the same Coxeter system (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (1) and the finite coincidence B2=C2=I2(4) of Classification of finite Coxeter systems, including the H and dihedral families (4)), and the Bn- and Cn-scalings with n=2 are exchanged by duality (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (4)).

(ii) The difference for n≥3. B~n has a vertex of degree 3 (the vertex v2 carrying the extra v0) and exactly one edge labelled 4, namely {vn−1,vn}; C~n is a path and has exactly two edges labelled 4, at its two ends. Hence for n≥3 the two diagrams are not isomorphic: any graph isomorphism maps each vertex's neighbor set bijectively to the corresponding neighbor set and therefore preserves degrees, but the degree sequences disagree.

(iii) Both are affine. By Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3), the cosine matrices of B~n and C~n are positive semidefinite of corank one with positive kernel vectors; concretely, for C~n the vector (1,2,2,…,2,1) (first and last entry 1) lies in the kernel, and for B~n with n≥3 the vector (1,1,2,2,…,2,2) (entries ordered v0,v1,v2,v3,…,vn, i.e. x0=x1=1, x2=⋯=xn−1=2, xn=2) lies in the kernel; in both cases the entries are positive.

(iv) Why the Coxeter diagram alone does not decide the lattice. Bn and Cn have the same finite Coxeter diagram but their two crystallographic scalings are dual (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (4), Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices); the fundamental alcoves are bounded n-simplices (triangles when n=2) (Highest-root dominance and the fundamental alcove (2)), but the affine Weyl groups Wa(Bn)=Q∨⋊W and Wa(Cn)=Q∨′⋊W (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W (4)) realize the two different Coxeter diagrams B~n and C~n for n≥3 (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1),(5), Alcove transitivity, the affine Coxeter presentation, and the length function (2)), and for n≥3 they are not isomorphic even as abstract groups: Wa(Bn) has a maximal finite subgroup of order 2n−1n!, whereas Wa(Cn) has none, as proved below. Thus the Coxeter diagram of the finite system does not determine which lattice acts.

(v) Convention warning. The labels 4 here are orders of facet-reflection products, i.e. Coxeter labels (cos⁡(π/4)=2/2) (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)), not Lie-theoretic bond multiplicities; the extended affine Weyl group P∨⋊W is a further, different object (Alcove transitivity, the affine Coxeter presentation, and the length function (4)).

Facts & Assumptions

Given: The two affine families and their finite Bn,Cn root-system scalings.

[F1]

The n=2 coincidence is a definition, and for n≥3 the B recipe has one branch and one 4-edge, while the C recipe is a path with two 4-edges (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (2),(3),(7)).

[F2]

The cosine matrices of both standard affine diagrams are positive semidefinite of corank one and have positive kernel vectors (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3)).

[F3]

The affine facet-product labels mijΦ=ord⁡(sisj) give the standard affine diagrams of the corresponding Bn,Cn root systems, which occur in the list; their n=2 convention is shared (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1),(4)).

[F4]

The finite Bk,Ck systems have the same Coxeter diagram and its label-4 path admits the two dual crystallographic scalings (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (1),(4)).

[F5]

By the finite-type and crystallographic theorems, the standard finite Coxeter groups of types Bk,Ck, and Dk for k≥4 are isomorphic to Weyl groups of based crystallographic root systems with the standard generators matched to simple-root reflections. The based-root uniqueness theorem identifies these with the coordinate root systems of [F6] when the Cartan matrices agree (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (2), The Cartan matrix determines a based root system).

[F6]

The coordinate root sets and simple roots for An,Bn,Cn,Dn are those displayed in Classical root systems in coordinates.

[F7]

The coroot is α∨=2α/B(α,α), and the affine Weyl group has the Euclidean decomposition Wa=Q∨⋊W (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W (4)).

[F8]

The affine-Gram classification theorem supplies the faithful slice model, its affine relation and intersection formula, strict closed fundamental domains, and finiteness of proper standard parabolics (Classification of affine Coxeter diagrams and their Euclidean simplex realization (2)–(4)).

[F9]

The finite Coxeter classification gives A1=B1, B2=C2=I2(4) and D3=A3 (Classification of finite Coxeter systems, including the H and dihedral families (4)).

[F10]

Support determines standard-parabolic membership and the restricted Coxeter presentation (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)–(2)).

[F11]

The affine facet reflections generate the affine Weyl group, have the exact Coxeter presentation and act simply transitively on alcoves; the comparison clauses distinguish the extended lattice group (Alcove transitivity, the affine Coxeter presentation, and the length function (1)–(4)).

Proof

technique · direct; all finite coordinate constructions use no choice principle
1.1F1F3F4F9algebra

At n=2, [F1] specifies the common (4,4) path; [F3] realizes it from each dual root-length assignment. The finite systems coincide by [F9], and their two scalings are exchanged by [F4]. For n≥3, the B graph has a degree-three vertex and one 4-edge, whereas the C graph has degrees at most two and two 4-edges. A graph isomorphism would biject each vertex's neighbors and preserve degree, which is impossible for these degree sequences.

1.2F1F2F12

By [F12], if c4:=cos⁡(π/4) and c3:=cos⁡(π/3), then c4=2/2 and c3=1/2: positivity follows from 0<π/4,π/3<π/2 and strict decrease to cos⁡(π/2)=0; for c4 the double-angle identity gives 2c42=1, and for c3 it gives 2c32−1=cos⁡(2π/3)=−c3, so (2c3−1)(c3+1)=0 and c3=1/2. Put c=c4. For C~n, take endpoint coordinates 1 and all n−1 interior coordinates 2. Each endpoint equation is 1−c2=0; at n=2 the central equation is 2−2c=0; for n≥3, a vertex next to an end has equation 2−c−2/2=0, and any other interior vertex has equation 2−(2+2)/2=0. For B~n, n≥3, use x0=x1=1, x2=⋯=xn−1=2, xn=2. At each branch leaf the equation is 1−x2/2=0. At v2, the equation is 2−(1+1)/2−c2=0 when n=3, and 2−(1+1+2)/2=0 when n≥4. Every intervening chain vertex (if any) has equation 2−(2+2)/2=0; the vertex vn−1 for n≥4 has equation 2−1−c2=0, and the final vertex has equation 2−2c=0. Thus the displayed vectors are positive kernel vectors; [F2] independently gives the semidefinite corank-one assertion. At n=2 use the C vector (1,2,1) for both names.

1.3F5F6F9algebra

In the coordinate models [F6], for k≥2 the finite Coxeter groups of type Bk or Ck are identified by [F5] with the Weyl groups on the displayed root sets. Their simple reflections interchange neighboring coordinates or change the last coordinate's sign; conjugating by permutations permits each sign change. Every root reflection is a signed permutation, and these generators give all signed permutations, so the group has order 2kk!. For Dk, k≥4, [F5,F6] identify the finite Coxeter group with the Weyl group of roots ±ei±ej. Its adjacent swaps and the reflection in ek−1+ek generate exactly the permutations with an even number of sign changes: composing that reflection with the swap gives a double sign change, and conjugates give all pairs. Every root reflection has even sign parity, so the group has order 2k−1k!. For k=3, the remaining all-3 path is A3=D3 by [F9]; its coordinate roots ei−ej on the sum-zero subspace of R4 give all transpositions of four coordinates, so its group is S4 of order 24. A one-vertex A1 factor has the sign reflection group of order 2, and the rank-zero group is trivial.

1.4F8F10algebra

Every finite subgroup H of either affine group fixes a point: average the finite orbit Hx for any x; affine linearity makes its barycentre fixed by H. By [F8]'s strict closed fundamental domain, conjugate this point into Aˉ. For p∈Aˉ, let T(p) be the types of facets containing p. The affine relation in [F8] gives T(p)⊊S. The intersection formula in [F8] and support criterion [F10] show Stab⁡(p)=WT(p): if wp=p, then p∈wAˉ∩Aˉ, so every type in S(w) is in T(p), hence w∈WT(p); conversely every generator indexed by T(p) fixes p. This stabilizer is finite by [F8]'s proper-parabolic clause. The face containing p has a vertex v; all its containing facet reflections fix v, so H≤WT(p)≤Stab⁡(v). Applying the same stabilizer identity to v shows Stab⁡(v)=WT(v), a finite proper parabolic. At a vertex v, the n incident facets have a unique intersection, so their normals span the ambient direction space and their reflections have common fixed-point set exactly {v}. If a finite group contained Stab⁡(v), its barycentre would be fixed by this stabilizer, hence would equal v; the group would then be contained in Stab⁡(v). Thus every vertex stabilizer is maximal finite, and every maximal finite subgroup is conjugate to one.

2.1F1F9F10step 1.3step 1.4algebra

Set N=2nn! and let n≥3. Deleting the endpoint vn of the 4-edge from B~n leaves the finite all-3 Dn graph (at n=3, the path A3=D3). Its parabolic is the stabilizer of the opposite vertex, hence maximal finite by Step 1.4, and has order N/2 by Step 1.3. Deleting vertex vi, 0≤i≤n, from C~n leaves two finite terminal-4 paths of ranks i and n−i, interpreted as B1=A1 or rank-zero trivial blocks at the ends. Its vertex stabilizer has order 2ni!(n−i)! by the restricted presentation [F10] and Step 1.3; the two blocks commute and their presented group is the direct product. At i=0,n this is N. For 1≤i≤n−1, (ni)≥n: the ratio (ni+1)/(ni)=(n−i)/(i+1) shows the binomial coefficients increase to the middle and then decrease symmetrically, so their minimum on these indices is (n1)=(nn−1)=n. Hence the order is at most N/n<N/2. By Step 1.4 these are all maximal finite subgroup orders in Wa(Cn). The two groups therefore cannot be abstractly isomorphic, since an isomorphism preserves finiteness, maximality and subgroup order.

3.1F3F6F7F11step 1.1step 1.3step 2.1algebra∎

The different coroot lattices can also be seen directly. For Bn with short roots ±ei, its coroots are ±2ei and ±ei±ej, whose integer span is {z∈Zn:∑izi is even}: the generators have even sum, and subtracting zi(ei−en) for i<n leaves an even multiple of en. For Cn with long roots ±2ei, their coroots include all ±ei, so the lattice is Zn. Both finite Weyl groups are the same signed permutation group by [F6], and [F3] identifies their affine facet diagrams with the standard B~n,C~n diagrams; Step 1.1 shows these differ in degree data. Step 2.1 proves the stronger abstract distinction for n≥3. Their chambers have dimension n; when n=2 the common affine diagram yields isomorphic Coxeter groups by [F3,F11] despite the dual coordinate normalizations. The decomposition [F7] identifies the translation lattices in these semidirect products with the two coroot lattices just computed. Finally, label 4 is the actual product order by [F3], not a bond multiplicity, and the extended weight-lattice group is a distinct comparison object by [F11]. All comparisons use finite coordinates and averaging, without Choice.

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

An indefinite Coxeter form: infinite, but not of affine type

Example

Let S={s1,s2,s3} with m(s1,s2)=m(s2,s3)=3 and m(s1,s3)=5, so that Γ is the triangle with labels (3,3,5), and let B be the cosine matrix B=(1−12−cos⁡π5−121−12−cos⁡π5−121),cos⁡π5=1+54. Then:

(i) B is indefinite: the vector v=es1+es2+es3 satisfies B(v,v)=3+2(−12−12−cos⁡π5)=1−2cos⁡π5=1−52<0 because cos⁡π5=1+54 and 5>1 (the value of cos⁡π5 is derived in the verification, not cited). Since B(es1,es1)=1>0, B has both positive and negative values. Its leading principal minors are 1, 34, and det⁡B=12−12cos⁡π5−cos⁡2π5=−54<0.

(ii) W is infinite, but (W,S) is not of affine form type: affine form type requires B positive semidefinite of corank one (Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1)), and by (i) B is negative on some vector. It is infinite by the finite-type criterion (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)): an indefinite form is not positive definite.

(iii) The angle sum of the triangle is 1/3+1/3+1/5=13/15<1, and the form is indefinite and nondegenerate: B(v,v)<0 by (i) while B(es1,es1)=1>0, and det⁡B=−54≠0; every nonempty proper principal submatrix is positive definite by Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(i), whose rank-two computations give determinants sin⁡2(π/3)=34>0 and sin⁡2(π/5)=1−cos⁡2(π/5)=5−58>0; the empty principal matrix is vacuously positive definite. No geometric hyperbolic realization is constructed on this page; only the algebraic definiteness type is asserted. For this connected system, the positive-definite, affine-form, and indefinite cases are mutually exclusive: the first is finite, the second is positive semidefinite of corank one, and this example is the infinite indefinite case (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1), Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice (1), Positive radical, corank one, positive definiteness of proper submatrices, and domination exclusions (1)).

(iv) By contrast the triangle with labels (3,3,3) is A~2, positive semidefinite of corank one (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (1), Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3)). For any triangle Coxeter matrix with finite labels m12,m23,m13≥3, the cosine-form determinant is zero exactly when π/m12+π/m23+π/m13=π, and is negative when the sum is below π, as calculated in Proof Step 2.2. In particular, (3,3,4) is indefinite: for v=es1+es2+es3, B(v,v)=1−2cos⁡(π/4)=1−2<0, where cos⁡(π/4)=2/2 follows from the half-angle identity at π/2 (Half-angle identities with the sign determined by the quadrant).

(v) Consequently, in the classification statement of Classification of affine Coxeter diagrams and their Euclidean simplex realization (1) the hypothesis "positive semidefinite" cannot be replaced by "infinite", and a consumer testing a diagram for affine type must examine the definiteness of the whole form and not only the finiteness of proper subdiagrams: Γ here has all proper subdiagrams of finite type (the rank-two subdiagrams I2(3), I2(3), I2(5) are all finite), yet is not affine.

Facts & Assumptions

Given: The finite labelled triangle (3,3,5) and its form.

[F1]

The cosine form is a symmetric bilinear form with diagonal one and off-diagonal −cos⁡(π/m) (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F2]

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

[F3]

A Coxeter diagram joins distinct vertices exactly when their label is at least 3; thus this labelled triangle is connected (Coxeter diagrams: edges, labels, components and finite type).

[F4]

A finite-rank Coxeter group is finite exactly when its Coxeter form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)).

[F5]

Every standard parabolic has the restricted Coxeter presentation; for an empty generator set it is the trivial group (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).

[F6]
[F7]

The defining power series give cosine even, sine odd and cos⁡0=1 (Sine and cosine defined by their real power series).

[F8]

Cosine strictly decreases on [0,π], cos⁡(π/2)=0, cos⁡π=−1, sin⁡π=0, and sine is positive on (0,π) (Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi).

[F9]

Nonnegative square roots exist uniquely and squaring is strictly increasing on nonnegative reals (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Squaring is monotone on the nonnegatives).

[F11]

Sine and cosine satisfy their addition formulas (The addition formulas for sine and cosine).

[F12]

The half-angle identity with its sign determined by the quadrant gives cos⁡(π/4)=2/2 (Half-angle identities with the sign determined by the quadrant).

[F13]

For two distinct generators with finite label m, their rank-two form is positive definite with determinant sin⁡2(π/m) (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(i)).

[F14]

For a connected Coxeter diagram with nonpositive off-diagonal entries, a positive-semidefinite Coxeter form with nonzero radical has corank one and a positive radical vector (Positive radical, corank one, positive definiteness of proper submatrices, and domination exclusions (1)).

[F15]

The connected positive-semidefinite corank-one Coxeter diagrams are exactly the standard affine diagrams (Classification of affine Coxeter diagrams and their Euclidean simplex realization (1)).

[F16]

The standard angle constant satisfies π>0 (Pi as twice the smallest positive zero of cosine).

Proof

technique · direct; all finite coordinate constructions use no choice principle
1.1F6F7F8F9F11F16algebra

Put ζ=e2πi/5. Since ζ5=1 and ζ≠1, multiplication by ζ−1 proves 1+ζ+ζ2+ζ3+ζ4=0. Divide by ζ2 and put y=ζ+ζ−1 to get y2+y−1=0. Euler's identity and parity [F6,F7] give y=2cos⁡(2π/5)>0, as 0<2π/5<π/2 and cosine is strictly decreasing to cos⁡(π/2)=0 [F8]. Hence (2y+1)2=5, so y=(5−1)/2 by positivity and uniqueness of square roots [F9]. Double angle [F6] gives c2:=cos⁡2(π/5)=(3+5)/8; c>0 by [F8] and (1+5)2/16=(3+5)/8, so c=(1+5)/4. For d=cos⁡(π/3)>0, the double-angle identity gives 2d2−1=cos⁡(2π/3)=−d, since the addition formula, parity, cos⁡π=−1 and sin⁡π=0 give cos⁡(π−x)=−cos⁡x [F7,F8,F11]; thus (2d−1)(d+1)=0 and d=1/2. Finally, for h=cos⁡(π/4)>0, the double-angle identity gives 2h2−1=cos⁡(π/2)=0, so h=1/2=2/2 by [F9].

2.1F1F2F4F5F9F13step 1.1algebra

On v=(1,1,1) the form has value 3−2(1/2+1/2+c)=1−2c=(1−5)/2<0, whereas on es1 it has value one. It is therefore indefinite. Expansion of the determinant gives 1−1/4−1/4−c2−2(1/2)(1/2)c=1/2−c/2−c2=−5/4≠0. The empty principal matrix is vacuously positive definite; a one-coordinate principal form is [1]; and a two-coordinate form is (a−db)2+(1−d2)b2 for d=1/2 or c, with positive determinant 3/4 or (5−5)/8 since 1<5<3<5. Thus every proper principal submatrix is positive definite. For T=∅, WT={1}; for nonempty proper T, the restricted presentation [F5] and finite-type criterion [F4] make WT finite. The full group is infinite by [F4], and it is not affine by [F2]. The numerical angle sum is 1/3+1/3+1/5=13/15<1; no hyperbolic realization is needed for these algebraic conclusions.

2.2F1F7F8F10F11F12F13F16step 1.1algebra

The all-3 triangle is affine by [F10]. For (3,3,4), the same evaluation on (1,1,1) is 1−2<0, using [F12] (the value was also computed in Step 1.1); thus it is not positive semidefinite. For any triangle Coxeter matrix with finite labels m12,m23,m13≥3, put θ1=π/m12, θ2=π/m23, θ3=π/m13 and A=cos⁡θ1, B=cos⁡θ2, C=cos⁡θ3. Its cosine-form determinant is 1−A2−B2−C2−2ABC=(sin⁡θ1sin⁡θ2)2−(C+AB)2, using [F13] for sin⁡2θi=1−cos⁡2θi. Since 0<θi≤π/3, all three cosines are at least 1/2>0 and all three sines are positive [F8]; hence the second factor sin⁡θ1sin⁡θ2+C+AB is positive. The first factor is sin⁡θ1sin⁡θ2−C−AB=−cos⁡(θ1+θ2)−cos⁡θ3=cos⁡(π−θ1−θ2)−cos⁡θ3 by the addition formulas and angle-shift values [F7,F8,F11]. Strict decrease [F8] shows the determinant is zero exactly when θ1+θ2+θ3=π, and negative when the sum is below π. The sum is at most π, with equality only for (3,3,3). If it is below π, at least one θi<π/3, so its cosine exceeds 1/2 while the others are at least 1/2; therefore the sum-vector has value 3−2(A+B+C)<0, proving indefiniteness. This proves the asserted angle-sum boundary without constructing a hyperbolic triangle.

3.1F2F3F4F14F15step 2.1algebra∎

The Coxeter diagram is connected by [F3]. For this system, the positive-definite case is finite by [F4]. If B is positive semidefinite but not positive definite, choose 0≠x with B(x,x)=0. For any y∈V, positive semidefiniteness gives 0≤B(x+ty,x+ty)=2tB(x,y)+t2B(y,y) for every real t. If B(x,y)≠0, then either B(y,y)=0 and a t of opposite sign makes the expression negative, or B(y,y)>0 and a sufficiently small t of opposite sign does so. Thus B(x,y)=0 for all y, so x∈rad⁡(B)∖{0}; [F14] gives corank one, and the system is affine by [F2]. Otherwise the form is indefinite and the group is infinite by [F4], but not affine by [F2]. These cases are mutually exclusive. By Step 2.1, the (3,3,5) system is in the last case and all its proper parabolics are finite. Thus neither infiniteness nor finiteness of proper subdiagrams can replace positive semidefiniteness in [F15]'s classification. The whole-form calculation, rather than only rank-two tests, is essential. All calculations are explicit and use no Choice.

Sources