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

Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order

Statement

Let S, m, V=RS, B and ra be as in The real Coxeter form, its radical, reflections, and form-preserving maps.

(1) Well-definedness of B. The functions es (s∈S) form a basis of V, and there is exactly one symmetric bilinear form B on V with B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t) and B(es,et)=−1 for m(s,t)=∞; it satisfies B(u,w)=∑s,t∈Su(s)w(t)B(es,et) for all u,w∈V.

(2) Reflection identities. Let a∈V with B(a,a)≠0. Then ra is linear, ra2=idV, ra(a)=−a, ra(v)=v for every v with B(v,a)=0, and B(rau,raw)=B(u,w) for all u,w∈V. Moreover ker⁡B(−,a) is a linear subspace of dimension dim⁡V−1 (a hyperplane of V, in the codimension-one sense) and is fixed pointwise by ra.

(3) The rank-two plane. Let s≠t in S, put P:=Res+Ret and c:=c(s,t) as in The real Coxeter form, its radical, reflections, and form-preserving maps (so c=1 when m(s,t)=∞). Then:

(i) B∣P has Gram matrix (1−c−c1); for finite m it is positive definite, with B(xses+xtet, xses+xtet)=(xs−cxt)2+sin⁡2(π/m) xt2; for m=∞ it is positive semidefinite, i.e. B(x,x)≥0 for all x∈P, with radical R(es+et).

(ii) rs and rt fix every element of P⊥={v∈V:B(v,es)=B(v,et)=0} pointwise; and if m<∞ then V=P⊕P⊥.

(iii) The product A:=rsrt has, in the ordered basis (es,et) of P, the matrix A=(4c2−1−2c2c−1), of determinant 1.

(iv) If m<∞ then tr⁡A=2cos⁡(2π/m), Am=idV, and Ak≠idV for 0<k<m. If m=∞ then A=idP+N on P for some N with N≠0 and N2=0; hence (rsrt)k∣P=idP+kN for every k∈Z, so rsrt has infinite order on V.

Facts & Assumptions

Given: a finite set S, a Coxeter matrix m on S, the real vector space V=RS, the Coxeter form B and the maps ra defined for B(a,a)≠0 of The real Coxeter form, its radical, reflections, and form-preserving maps, and, for the rank-two clauses, distinct s,t∈S with c:=c(s,t).

[F1]

The data fixed by the Statement: m(s,s)=1 and m(s,t)=m(t,s)∈{2,3,… }∪{∞} for s≠t; es∈V is the function with es(s)=1 and es(t)=0 for t≠s; and c(s,t)=cos⁡(π/m(s,t)) for finite m(s,t), while c(s,t)=1 when m(s,t)=∞ (The real Coxeter form, its radical, reflections, and form-preserving maps, The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}).

[F2]

A bilinear form on V is a function V×V→R that is linear in each variable separately, and it is symmetric when B(u,v)=B(v,u) for all u,v∈V (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms, The real Coxeter form, its radical, reflections, and form-preserving maps).

[F3]

For a linear map T of a finite-dimensional vector space over R one has dim⁡V=dim⁡(ker⁡T)+dim⁡(im⁡T), and dim⁡RR=1; if a linear map V→R has a nonzero value then its image is all of R and its rank is 1 (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T, Rank and nullity of a linear map with finite-dimensional domain, The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0).

[F4]

In ordered bases the matrix of a composite is the product of the matrices of the factors, matrix powers are iterated products, and I2 denotes the identity matrix (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases, [S∘T]BD=[S]CD[T]BC, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[F5]

Trigonometric values and identities: the addition formulas sin⁡(x+y)=sin⁡xcos⁡y+cos⁡xsin⁡y and cos⁡(x+y)=cos⁡xcos⁡y−sin⁡xsin⁡y; sin⁡2x+cos⁡2x=1; sin⁡x=0 if and only if x∈πZ, and cos⁡x=0 if and only if x=(k+12)π for some k∈Z; cos⁡(π/2)=0, cos⁡π=−1, cos⁡(x+π)=−cos⁡x, and cos⁡0=1 by the defining series evaluated at 0 (The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, The zero sets of sine and cosine and the least positive common period 2 pi, Quarter-turn values and shifts by pi/2 and pi, Sine and cosine defined by their real power series).

[F7]

In the ordered field R one has 2≠0, so 2a=0V implies a=0V (The reals form a totally ordered field).

Proof

technique · direct finite-dimensional computation, in layers: first the basis and reflection algebra, then the rank-two plane with its trigonometry, and finally the order statements on the whole space
1.1givenF1F2

The functions es are linearly independent: if ∑s∈Sλses=0V then evaluating at s gives λs=0. They span V: every u∈V satisfies u=∑s∈Su(s)es, since the right side is a finite sum (S is finite) whose value at any t∈S is u(t). So (es)s∈S is a basis of V. Consequently, for all u,w∈V one has B(u,w)=∑s,t∈Su(s)w(t)B(es,et): expanding u and w in the basis and distributing with bilinearity in each variable gives that finite sum. In particular a bilinear form on V is determined by the numbers B(es,et).

1.2givenF1F2algebra

The displayed ra for B(a,a)≠0 is linear in v, because v↦B(v,a) is linear and ra(v)=v−2B(v,a)B(a,a)a is a sum of the identity and the composite of that functional with scalar multiplication by a; also ra(a)=a−2B(a,a)B(a,a)a=a−2a=−a, and ra(v)=v for every v∈ker⁡B(−,a). Moreover B(rav,a)=B(v,a)−2B(v,a)B(a,a)B(a,a)=−B(v,a), so ra(ra(v))=ra(v)−2B(rav,a)B(a,a)a=ra(v)+2B(v,a)B(a,a)a=v; hence ra2=idV. Finally, expanding with bilinearity and cancelling the equal cross terms via symmetry B(u,a)=B(a,u) and B(w,a)=B(a,w), B(rau,raw)=B(u,w)−2B(u,a)B(a,w)B(a,a)−2B(w,a)B(a,u)B(a,a)+4B(u,a)B(w,a)B(a,a)=B(u,w), so ra is B-preserving.

1.3givenF1F2F3

Put φ(v):=B(v,a). By B(a,a)≠0 the value φ(a) is nonzero, so the image of φ is all of R and its rank is 1; the kernel ker⁡B(−,a)=ker⁡φ is a linear subspace and rank-nullity gives dim⁡ker⁡B(−,a)=dim⁡V−1.

1.4givenF1F2F4algebra

For distinct s,t∈S, evaluating the definition of r at es and et with B(es,es)=B(et,et)=1 and B(es,et)=−c gives rs(es)=−es, rs(et)=et+2ces, rt(et)=−et and rt(es)=es+2cet. Hence in the ordered basis (es,et) the matrices are [rs]=(−12c01) and [rt]=(102c−1), and the composite A:=rsrt has matrix [A]=[rs][rt]=(4c2−1−2c2c−1),det⁡[A]=(4c2−1)(−1)−(2c)(−2c)=1.

1.5givenF1F2F5F6algebra

On P=Res+Ret write x=xses+xtet. Bilinearity and the values B(es,es)=B(et,et)=1, B(es,et)=−c give B(x,x)=xs2−2cxsxt+xt2=(xs−cxt)2+(1−c2)xt2. For finite m one has 1−c2=sin⁡2(π/m) and sin⁡(π/m)≠0 because 0<π/m≤π/2 and the sine zero set is πZ; hence B(x,x)>0 whenever x≠0, so B∣P is positive definite. For m=∞ one has c=1 and B(x,x)=(xs−xt)2≥0, which vanishes exactly when xs=xt, i.e. on R(es+et); and R(es+et) is precisely the radical of B∣P, since B(x,es)=xs−cxt and B(x,et)=xt−cxs vanish for all such x, while xs≠xt makes B(x,es)≠0.

1.6givenF1F4F5algebra

Assume m<∞ and put θ:=π/m, so c=cos⁡θ. The trace of the matrix in 1.4 is tr⁡[A]=4c2−2=2(2c2−1)=2cos⁡2θ by the double-angle instance of the addition formulas, and the 2×2 Cayley-Hamilton identity, verified directly from the displayed entries, reads A2=2cos⁡2θ A−I2. For m≥3 one has 2θ∈(0,π) and sin⁡2θ≠0, and for m=2 one has c=cos⁡(π/2)=0, so [A]=−I2.

2.1givenF5step 1.6algebra

Assume m≥3; then sin⁡2θ≠0 and induction on k≥1 using A2=2cos⁡2θ A−I2 and the product-to-sum identity 2sin⁡xcos⁡y=sin⁡(x+y)+sin⁡(x−y) gives Ak=sin⁡(2kθ)A−sin⁡(2(k−1)θ)I2sin⁡2θ for every k≥1: the case k=1 is sin⁡0=0, and the induction step replaces Ak+1=A⋅Ak using the displayed identity. Hence Am=I2 because sin⁡(2mθ)=sin⁡(2π)=0 and sin⁡(2(m−1)θ)=−sin⁡2θ. If 1≤k<m and Ak=I2, then sin⁡(2kθ)A=(sin⁡2θ+sin⁡(2(k−1)θ))I2; were sin⁡(2kθ)≠0, the matrix A would be scalar, contradicting its nonzero off-diagonal entry −2c (for m≥3 the value c is nonzero, since c=0 would force π/m=(j+12)π, that is 2/m=2j+1>0 for an integer j, so j≥0 and 2/m≥1, impossible because m≥3). So sin⁡(2kθ)=0, and then sin⁡(2(k−1)θ)=sin⁡(2kθ−2θ)=−cos⁡(2kθ)sin⁡2θ forces cos⁡(2kθ)=1; with sin⁡(2kθ)=0 it gives 2kθ∈2πZ (indeed sin⁡x=0 writes x=ℓπ, and cos⁡(ℓπ)=(−1)ℓ follows from cos⁡0=1 and cos⁡(x+π)=−cos⁡x, so cos⁡(2kθ)=1 forces ℓ even), hence m∣k, contradicting 1≤k<m. Hence Ak≠I2 for 0<k<m.

2.2givenF4F7step 1.4algebra

Assume m=∞, so c=1 and [A]=(3−22−1)=I2+N with N=(2−22−2). Then N≠0 and N2=0 by direct multiplication, so the binomial theorem gives Ak=I2+kN for every k≥0, while A−1=I2−N because (I2+N)(I2−N)=I2−N2=I2, so (I2−N)j=I2+(−j)N for j≥0 and Ak=I2+kN for every k∈Z. For k≠0 the matrix kN has entry 2k≠0 in its first column, so Ak≠I2; the product A=rsrt therefore has infinite order on P.

2.3givenF1F2F5step 1.1

The Coxeter form B of the Statement is well defined: the prescription B(u,w):=∑s,t∈Su(s)w(t)(−c(s,t)) is a finite sum of scalar multiples of products of coordinate values, hence a function V×V→R linear in each variable; it is symmetric because c(s,t)=c(t,s), which follows from m(s,t)=m(t,s) and the symmetry of cosine; and it has B(es,et)=−c(s,t) for all s,t. By 1.1 it is the unique symmetric bilinear form with these values, and c(s,s)=cos⁡(π/1)=cos⁡π=−1 gives B(es,es)=1.

2.4givenF1F2F6step 1.2step 1.4step 1.5

The maps rs and rt fix P⊥={v∈V:B(v,es)=B(v,et)=0} pointwise, since rs(v)=v−2B(v,es)B(es,es)es=v and likewise for t. If m<∞, then V=P⊕P⊥: the Gram matrix (1−c−c1) of B∣P has determinant 1−c2=sin⁡2(π/m)≠0, so for given v the 2×2 system B(p,es)=B(v,es), B(p,et)=B(v,et) has a unique solution p∈P; then z:=v−p satisfies B(z,es)=B(z,et)=0, hence z∈P⊥ and v=p+z, so P+P⊥=V. If p∈P∩P⊥ then B(p,p)=0 with p∈P, and positive definiteness of B∣P forces p=0; thus P∩P⊥={0} and V=P⊕P⊥.

3.1givenstep 1.6step 2.1step 2.2step 2.4∎

Let A=rsrt. If m<∞, then Am∣P=I2 and Ak∣P≠I2 for 0<k<m by steps 1.6 and 2.1 and the case m=2 of step 1.6, while A∣P has the matrix displayed in step 1.4; on P⊥ the map A fixes every vector by step 2.4, so Am=idV and Ak≠idV for 0<k<m because its restriction to the direct summand P differs from I2. If m=∞, then [A]=I2+N with N≠0, N2=0 and Ak∣P=I2+kN≠I2 for every k≠0 by step 2.2, so Ak≠idV for every k≠0 and rsrt has infinite order on V.

Depends on

Used by

…and 16 more results.

Cited to discharge well-definedness by The real Coxeter form, its radical, reflections, and form-preserving maps.

Dependency tree · two levels

106 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