Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Dihedral diagrams I2(m): Gram determinants, the infinite case, and the low-rank coincidences

Example

Let S={s,t} with m(s,t)=r∈{3,4,… }∪{∞} and m(s,s)=m(t,t)=1; let W be the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), B the Coxeter form on V=RS (The real Coxeter form, its radical, reflections, and form-preserving maps) and Γ its diagram (Coxeter diagrams: edges, labels, components and finite type).

(i) The diagram and the matrix. Γ is the single edge st labelled r, and the matrix of B in the basis (es,et) is (1−c−c1) with c=cos⁡(π/r) for finite r and c=1 for r=∞.

(ii) Finite case. For finite r one has det⁡B=sin⁡2(π/r)>0 and the 1×1 principal minors are 1, so B is positive definite and W is finite; it is the dihedral group I2(r) of order 2r, and the canonical product ρ(s)ρ(t) has exact order r on V (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(iv), Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).

(iii) Infinite case. For r=∞ one has det⁡B=0 and the kernel vector u=es+et satisfies B(u,u)=0; hence B is not positive definite and W is infinite, namely the infinite dihedral group.

(iv) Low-rank coincidences and products. As Coxeter systems I2(3)=A2, I2(4)=B2=C2, I2(6)=G2, I2(2)=A1×A1 (no edge for m=2), I2(5)=H2, and A1=B1 is the one-vertex diagram; these are the only overlaps among the rank-two families, and in the classification Classification of finite Coxeter systems, including the H and dihedral families they appear under both names. The one-vertex diagram A1 has B=(1) positive definite and W≅Z/2; the disconnected two-vertex diagram A1×A1 is the direct product of two such groups, of order 4 (The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections).

Facts & Assumptions

Given: S={s,t}, a Coxeter matrix with m(s,t)=r and m(s,s)=m(t,t)=1, the presented group W with canonical homomorphism ρ, the space V=RS with Coxeter form B, and the diagram Γ; write c:=cos⁡(π/r) for finite r.

[F1]

In a diagram with two distinct vertices s,t, an edge is drawn exactly when m(s,t)≥3 and it carries the label m(s,t); when m(s,t)=2 no edge is drawn, and the subdiagram on a single vertex is the one-vertex diagram (Coxeter diagrams: edges, labels, components and finite type).

[F2]

B(es,es)=B(et,et)=1, B(es,et)=−cos⁡(π/r) for finite r and B(es,et)=−1 for r=∞; more generally m(s,t) is the order of st in W (The real Coxeter form, its radical, reflections, and form-preserving maps, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F3]

The reflection ra is linear and an involution, fixes ker⁡B(−,a) pointwise, and B(rau,raw)=B(u,w); on the plane P=Res+Ret the product rsrt has exact order m(s,t) for finite m(s,t), fixing P⊥ pointwise, while for m(s,t)=∞ it is id+N on P with N≠0, N2=0, so it has infinite order (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2),(3)(ii),(3)(iv)).

[F5]

W is finite if and only if B is positive definite; a symmetric matrix is positive definite if and only if all its leading principal minors are positive; the form is positive definite when its quadratic form is >0 on every nonzero vector, so a nonzero u with B(u,u)≤0 excludes positive definiteness (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, 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, Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

[F6]

cos⁡(π/2)=0; sin⁡2x+cos⁡2x=1 and sin⁡x>0 for 0<x<π; sin⁡2(π/r)>0 for every finite Coxeter label r≥3 (Quarter-turn values and shifts by pi/2 and pi, Parity and the Pythagorean identity for sine and cosine, Sine and cosine defined by their real power series, Pi as twice the smallest positive zero of cosine, Signs, monotonicity intervals, and ranges of sine and cosine); sine positivity also follows from the positive rank-two quadratic coefficient in [F3].

[F7]

An external direct product G×H is a group and is finite exactly when both factors are, with ∣G×H∣=∣G∣ ∣H∣; for a disconnected diagram the group is the direct product of the standard parabolics of its components (The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections, Disconnected diagrams, direct products, and comparison of invariant forms (1)).

Verification

1.1F2F3F5F6algebra

(The matrix, the finite determinant and the infinite kernel vector.) Since m(s,t)=r≥3, or r=∞, the diagram Γ is the single edge st labelled r [F1], and in the basis (es,et) the matrix of B is (1−c−c1) with c=cos⁡(π/r) for finite r and c=1 for r=∞ [F2]; this is (i). Its determinant is 1−c2. For finite r the Pythagorean identity gives 1−c2=sin⁡2(π/r), which is positive because 0<π/r≤π/3<π [F6]; the 1×1 principal minors are the diagonal entries 1>0. For r=∞ we have c=1 and det⁡B=0, while u=es+et≠0 satisfies B(u,u)=1+1−2⋅1⋅1=0 [F2]; by [F5] the form is not positive definite, giving (iii) for the form.

2.1F3F4F5step 1.1algebra

(Finite case: positive definiteness, order 2r.) Let r<∞. The leading principal minors of B are 1 and 1−c2=sin⁡2(π/r)>0 by 1.1 [step 1.1], so B is positive definite by [F5] and W is finite by the criterion [F5]. By [F3] the product ρ(s)ρ(t)=resret acts on P=Res+Ret as a rotation of exact order r and fixes P⊥ pointwise, so ρ(s)ρ(t) has exact order r on V. Put A:=ρ(s)ρ(t)=ρ(st), of exact order r; every element of W is of the form A0k or sA0k with A0:=st∈W and k∈Z, because every alternating word in the two involutions is a power of st possibly preceded by s. Hence ρ(W)={Ak, ρ(s)Ak:0≤k<r}: the Ak are distinct because A has exact order r, the ρ(s)Ak are distinct for the same reason, and Ak≠ρ(s)Al because det⁡Ak=1 while det⁡(ρ(s)Al)=−1; so ∣ρ(W)∣=2r and injectivity of ρ [F4] gives ∣W∣=2r, W being the dihedral group I2(r). For r=∞ the same factorisation with ρ(s)ρ(t) of infinite order [F3] exhibits infinitely many distinct elements and W is the infinite dihedral group, completing (ii) and (iii).

3.1F1F5F7step 2.1algebra∎

(The low-rank coincidences and the products (iv).) Reading the labelled graphs: I2(3) is a single edge labelled 3, which is the one-edge path A2; I2(4) is a single edge labelled 4, which is B2, also written C2; I2(6) is a single edge labelled 6, conventionally G2; m(s,t)=2 draws no edge [F1], so the two-vertex diagram with m=2 is the disconnected diagram A1×A1, which is the direct product of two one-vertex groups by the component statement [F7]; and I2(5)=H2 by the rank-two naming convention. The one-vertex diagram A1 has B=(1), which is positive definite [F5], and presentation ⟨s∣s2=1⟩, so W≅Z/2; the disconnected two-vertex diagram has group (Z/2)×(Z/2), of order 2⋅2=4 [F7]. These coincidences and the group orders are (iv), and the group I2(r) of 2.1 [step 2.1] is the dihedral group appearing under both names in the classification.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

133 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