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.

The Wall form and line restrictions of a plane rotation, and the necessity of a common upper bound

Example

Let m≥3, c=cos⁡(π/m), V=Res+Ret with the positive definite Coxeter form B of the rank-two system I2(m), and let A:=ρ(st)=rsrt (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3), The canonical reflection homomorphism, roots, reflections, and the positive cone, Classification of finite Coxeter systems, including the H and dihedral families); let ℓT, M and ≤O be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator and The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order, and let T, Φ be the reflection set and root system (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)). Use faithfulness of The root-length criterion and faithfulness of the canonical reflection representation (3) to identify W with ρ(W) when writing ℓ, ℓT and ≤T for these operators. Then:

(i) tr⁡A=2cos⁡(2π/m)≠2=tr⁡id, so 1 is not an eigenvalue of A, F(A)=0 and M(A)=V. In oriented orthonormal coordinates adapted to A it is the rotation by θ=2π/m, and

SA=(A−id)−1 is multiplication by 1eiθ−1=−12−i2cot⁡θ2,

so the Wall form χA(u,v)=B(SAu,v) satisfies χA(u,v)+χA(v,u)=−B(u,v) with symmetric part −12B.

(ii) For every line L⊆V the operator HL=ΠLSAΠL is the scalar −12 on L, so AL=id−2ΠL is the reflection of the plane with normal line L, AL≤OA, and L↦AL is a bijection from the lines of V onto the reflections B≤OA. Moreover AL lies in ρ(W) if and only if L is one of the m root lines Rβ, β∈Φ; so for a line L that is not a root line, AL is an orthogonal reflection whose moved space is L but AL∉ρ(W).

(iii) Take m=4 and put w0:=A2 (the rotation by π, the longest element of W=I2(4)). Then M(A)=M(w0)=V, so M(w0)⊆M(A), while

ℓT(w0−1A)=ℓT(A−1w0)=ℓT(A)=2,

so w0̸≤TA and A̸≤Tw0; in fact A and w0 have no common upper bound in W, since every δ∈W has ℓT(δ)=dim⁡M(δ)≤2 (Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)), so a common upper bound would have to equal both A and w0. Hence the implication M(α)⊆M(β)⇒α≤Tβ fails without the common-upper-bound hypothesis of the rigidity theorem.

Facts & Assumptions

Given: The rank-two datum m≥3, c=cos⁡(π/m), V=Res+Ret, B, ρ, T, Φ and the elements A=ρ(st)=rsrt, w0=A2; ℓT, M, F, ΠL, HL, AL are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator and The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order.

[F1]

In the ordered basis (es,et) one has B(es,es)=B(et,et)=1 and B(es,et)=−c with c=cos⁡(π/m), and B∣V is positive definite for finite m; the product A=rsrt has the matrix (4c2−1−2c2c−1) of determinant 1, trace 2cos⁡(2π/m) and order m (that is, Am=idV and Ak≠idV for 0<k<m). The real Coxeter form, its radical, reflections, and form-preserving maps Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order

[F2]

The type I2(m), 3≤m<∞, is the finite-type diagram with two vertices joined by a single edge labelled m; the corresponding Coxeter system has exactly the two simple reflections s,t, and ρ(st)=rsrt. Classification of finite Coxeter systems, including the H and dihedral families Coxeter diagrams: edges, labels, components and finite type The canonical reflection homomorphism, roots, reflections, and the positive cone

[F3]

The Wall form lemma holds on the positive definite plane (V,B): (1) M(X)=F(X)⊥ and V=M(X)⊕F(X); (2) χX(u,v)=B((X−id)∣M(X)−1u,v) satisfies χX(u,v)+χX(v,u)=−B(u,v), is nondegenerate, and has symmetric part −12B; (3) for a line L⊆M(X) the operator HL with B(HLu,v)=χX(u,v) on L satisfies HL+HL∗=−idL and is invertible, AL=id+HL−1 on L and id on L⊥ has M(AL)=L, and the reflections of the orthogonal group of V are exactly the maps id−2ΠL for lines L; (4) AL≤OX, and U↦XU is a bijection from the subspaces of M(X) onto {Y:Y≤OX} with inverse Y↦M(Y), order-preserving and order-reflecting for inclusion and ≤O. The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

[F5]

Every nonzero moved space of an element of W contains a root; for every root β the reflection with normal β equals ρ(tβ) with tβ∈T; the map {±α:α∈Φ}→T, {±α}↦tα, is a bijection, so the root lines Rα are in bijection with T; and ρ is injective. Root normals inside the moved space, factorizations into reflections, and independent normals The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange The root-length criterion and faithfulness of the canonical reflection representation

[F6]

Trigonometry: π is twice the smallest positive zero of cos⁡, which lies in (0,2), so 0<π<4, cos⁡(π/2)=0 and cos⁡ has no zero in [0,π/2); sin⁡x>0 for 0<x≤2 and cos⁡ is strictly decreasing on [0,2]; sin⁡2x+cos⁡2x=1; sin⁡2x=2sin⁡xcos⁡x and cos⁡2x=1−2sin⁡2x; eiθ=cos⁡θ+isin⁡θ; and cot⁡=cos⁡/sin⁡ where defined. Pi as twice the smallest positive zero of cosine Cosine has a smallest positive zero, lying strictly between zero and two Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3 Parity and the Pythagorean identity for sine and cosine Double-angle and quadratic power-reduction identities exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0 Tangent, cotangent, secant, and cosecant on their exact natural domains

[F7]

u≤Tv means ℓT(v)=ℓT(u)+ℓT(u−1v), and B≤OX means dim⁡M(X)=dim⁡M(B)+dim⁡M(B−1X). Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

Verification

technique · direct
1.1F1F2F6

By [F1] the matrix of A in the basis (es,et) has determinant 1 and trace 2cos⁡(2π/m), and A has order m; the trace differs from tr⁡id=2 because 1−cos⁡(2π/m)=2sin⁡2(π/m)>0 by [F6], as π/m∈(0,π/3]⊂(0,2] gives sin⁡(π/m)>0.

1.2F1F3F6

Put u:=(es+et)/2−2c and w~:=(et−es)/2+2c; the square roots are nonzero because 2−2c=4sin⁡2(π/(2m))>0 and 2+2c=4cos⁡2(π/(2m))>0, since 0<π/(2m)≤π/6<2 and cos⁡ has no zero in [0,π/2) by [F6]. A direct computation with [F1] gives B(u,u)=B(w~,w~)=1 and B(u,w~)=0, so (u,w~) is an oriented orthonormal basis, and computing Au=cos⁡θ u+sin⁡θ w~, Aw~=−sin⁡θ u+cos⁡θ w~ with θ:=2π/m: indeed B(Au,u)=2c2−1=cos⁡θ, B(Au,w~)=2csin⁡(π/m)=sin⁡θ, B(Aw~,u)=−sin⁡θ and B(Aw~,w~)=2c2−1=cos⁡θ, using 1−c2=sin⁡2(π/m) and the double-angle identities of [F6]. Hence in these coordinates A is the rotation by θ=2π/m, and 1 is not an eigenvalue of A: the matrix of A−id has determinant (cos⁡θ−1)2+sin⁡2θ=2−2cos⁡θ=4sin⁡2(θ/2)≠0, since θ/2=π/m∈(0,2]. Therefore F(A)=ker⁡(A−id)=0 and M(A)=F(A)⊥=V by F3. Moreover SA=(A−id)−1, computed from the displayed rotation matrix, is 12(−1sin⁡θ/(1−cos⁡θ)−sin⁡θ/(1−cos⁡θ)−1)=−12id−12cot⁡(θ/2)J with J=(0−110), because sin⁡θ/(1−cos⁡θ)=cot⁡(θ/2) by the double-angle identities; under the identification of the oriented plane with C, the matrix J is multiplication by i, so SA is multiplication by −12−i2cot⁡(θ/2), and (eiθ−1)(−12−i2cot⁡(θ/2))=1 by the displayed identity eiθ=cos⁡θ+isin⁡θ together with sin⁡2θ+cos⁡2θ=1 and sin⁡θ/(1−cos⁡θ)=cot⁡(θ/2), so SA is multiplication by 1/(eiθ−1). The identity χA(u,v)+χA(v,u)=−B(u,v) with symmetric part −12B is F3.

2.1step 1.2F1F3F4F5F7

Part (iii). Take m=4, so θ=π/2 and the rotation matrix of step 1.2 gives A2=(−100−1)=−idV; hence M(w0)=im⁡(−2id)=V=M(A) for w0:=A2, so M(w0)⊆M(A). By [F4] and step 1.2, ℓT(A)=dim⁡M(A)=2 and ℓT(w0)=dim⁡M(w0)=2; also w0−1A=A−2A=A−1 and A−1w0=A−1A2=A, and A−1=A3 has moved space V because F(A−1)=F(A)=0, so ℓT(w0−1A)=ℓT(A−1w0)=ℓT(A)=2. Hence ℓT(A)=2≠4=ℓT(w0)+ℓT(w0−1A) and ℓT(w0)=2≠4=ℓT(A)+ℓT(A−1w0), so w0̸≤TA and A̸≤Tw0 by [F7]. If some δ∈W satisfied A≤Tδ and w0≤Tδ, then 2=ℓT(A)≤ℓT(δ) and ℓT(δ)=dim⁡M(δ)≤dim⁡V=2 by [F4], so [F7] gives ℓT(δ)=ℓT(A)+ℓT(A−1δ)=2 and hence ℓT(A−1δ)=0; then A−1δ=1, since ℓT(x)=dim⁡M(x)=0 forces ρ(x)=id and x=1 by [F5], so δ=A, contradicting w0̸≤TA; thus A and w0 have no common upper bound. Finally w0=A2 is the unique longest element. Since sAs=A−1 and t=A−1s, every word reduces to Ak or Aks with 0≤k≤3. The four rotations are distinct by the order of A; the four Aks are distinct by cancellation, and the two lists cannot overlap: overlap would give s=Aj, whereas s has moved dimension one by [F3] and [F5], and Aj has moved dimension zero for j=0 and two for j=1,2,3 by the displayed rotation matrices. These eight elements are 1,s,t,st,ts,sts,tst,stst, because As=sts, A3s=t, and A2s=tst (the relation A4=1 gives stst=tsts). A word of length at most three reduces, by cancelling adjacent equal generators, to one of the first seven words; these are distinct from A2=stst. Thus ℓ(A2)=4, and every other element has length at most three.

2.2step 1.2F3

Part (ii), first half. Let L⊆V be a line; since M(A)=V by step 1.2, L⊆M(A), so the operator HL=ΠLSAΠL of F3 is defined. As L is one-dimensional, HL is multiplication by a real scalar λ, and the identity HL+HL∗=−idL of F3 gives 2λ=−1, so λ=−12; hence AL=id+HL−1 acts on L as −idL and on L⊥ as the identity, that is AL=id−2ΠL. By F3 M(AL)=L, and AL≤OA by F3. The assignment L↦AL is a bijection from the lines of V onto the reflections B≤OA: F3 gives a bijection U↦AU from the subspaces of M(A)=V onto {B:B≤OA} whose inverse is B↦M(B) and which satisfies M(AU)=U, and the one-dimensional subspaces of V are the lines, while the elements B≤OA with dim⁡M(B)=1 are exactly the reflections B≤OA (the elements B=id and B=A correspond to U=0 and U=V and are not reflections, as dim⁡M(A)=2).

2.3step 1.2F1F5

T has exactly m elements. Since A=st one has sA=t and A−1=ts, and the set W0:={Aj,Ajs:0≤j<m} contains 1, A, s=A0s and t=Am−1s and is closed under multiplication and inversion, since sAjs=A−j for every j: it is a subgroup of W containing s and t, so W0=W. Conjugation by the elements of W0 gives AksA−k=A2ks, AktA−k=A2k−1s and (Aks)t(Aks)−1=A2k+1s, so every element of T lies in {Ajs:0≤j<m}, while conversely A2ks=AksA−k and A2k−1s=AktA−k are conjugates of s and t; hence T={Ajs:0≤j<m}, and these m elements are distinct because A has order m by [F1]. By the bijection {±α:α∈Φ}→T of [F5] the plane has exactly m root lines, and the lines R(es+aet) for a∈R are pairwise distinct, so there are infinitely many lines and some are not root lines.

3.1step 2.2F5

Part (ii), second half. If L=Rβ for a root β∈Φ, then by [F5] the reflection id−2ΠL with normal β equals rβ=ρ(tβ)∈ρ(W); by step 2.2 this operator is AL, so AL∈ρ(W). Conversely suppose AL∈ρ(W), say AL=ρ(w); then dim⁡M(w)=dim⁡M(AL)=1 by step 2.2, so the nonzero moved space M(w)=L contains a root β by [F5], and L=Rβ is a root line. Hence AL lies in ρ(W) exactly when L is one of the m root lines, and for every other line L the operator AL is an orthogonal reflection with moved space L such that AL∉ρ(W).

4.1step 1.1step 1.2step 2.1step 2.2step 2.3step 3.1∎

Collecting the verified claims: (i) is steps 1.1 and 1.2; (ii) is steps 2.2, 2.3 and 3.1; (iii) is step 2.1. In particular the converse implication M(α)⊆M(β)⇒α≤Tβ of the rigidity theorem fails in W=I2(4) when no common upper bound is available: α:=w0 and β:=A satisfy M(α)=V=M(β) by step 1.2, while w0̸≤TA and A and w0 have no common upper bound in W, both by step 2.1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

130 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