Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedaudited 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 noncrossing interval of a dihedral group: a five-reflection claw for I2(5) and its complement

Example

Let m≥2 be an integer and let (W,S) be the Coxeter system with S={s,t} and m(s,t)=m. Put c=st and let T, ℓT, and ≤T be its reflection set, reflection length, and absolute order (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Coxeter diagrams: edges, labels, components and finite type, Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator). Then W has order 2m, is of finite type (I2(m) for m≥3 and A1×A1 for m=2), and T has exactly m elements. The Coxeter form on RS is positive definite for every such finite m, in particular for m=4 and m=5 (The real Coxeter form, its radical, reflections, and form-preserving maps).

(1) The interval. Every reflection has length one; every nonidentity rotation has length two; and [1,c]≤T={1}∪T∪{c}. Thus the interval has m+2 elements and ℓT(c)=2. For m=5 it is a five-reflection claw, and for m=4 it is a four-reflection claw.

(2) The lattice. The interval is a lattice. For distinct reflections r,r′, r∧r′=1 and r∨r′=c; also 1∧r=1, 1∨r=r, c∧r=r, and c∨r=c. This is the corresponding instance of the finite-type lattice theorem (Finite noncrossing intervals are lattices, independently of the Coxeter element (2),(4)).

(3) Kreweras complement. On NC⁡(W,c)=[1,c]≤T let K(w)=w−1c (Coxeter elements, the noncrossing interval [1,c], and the Kreweras map w ↦ w⁻¹c, The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions (1)). It interchanges 1 and c. If rk:=cks for k∈Z/mZ, then T={rk:0≤k<m} and K(rk)=rk−1,K2(rk)=rk−2. Thus K permutes the reflections in one m-cycle, and K2 is the identity on T for m=2; for m≥3, it rotates the reflection axes through −2π/m in the orthonormal orientation used below (an angle of magnitude 2π/m), giving one m-cycle when m is odd and two cycles of length m/2 when m is even.

Facts & Assumptions

Given: The rank-two Coxeter presentation with finite label m, its real Coxeter form, the reflection-length absolute order, and the interval/Kreweras conventions above.

[F1]

The group is presented by s2=t2=1 and (st)m=1, and a map from {s,t} to any group that satisfies these relations extends uniquely to a homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F2]

ℓT is the minimum number of factors from T and u≤Tv exactly when ℓT(v)=ℓT(u)+ℓT(u−1v) (Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator (1)–(2)).

[F3]

The real Coxeter form satisfies B(es,es)=B(et,et)=1 and B(es,et)=−cos⁡(π/m) for finite m (The real Coxeter form, its radical, reflections, and form-preserving maps (1)–(2)).

[F4]

On a finite-type noncrossing interval, K(w)=w−1c is an order-reversing bijection and K2(w)=c−1wc (The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions (1)).

[F5]

Sine is positive on (0,π) (Pi is the first positive zero of sine); sin⁡2x+cos⁡2x=1 (Parity and the Pythagorean identity for sine and cosine); and the sine and cosine addition formulas hold (The addition formulas for sine and cosine).

[F6]

The canonical homomorphism ρ sends s,t to the orthogonal reflections with normals es,et, and conjugation transports reflection normals by ρ(w) (The canonical reflection homomorphism, roots, reflections, and the positive cone (1),(2), Descent of the reflection representation, unit root norms, and conjugation of reflections (1),(4)).

Verification

technique · use $c=st$ and the exact order $m$ to list all group elements and reflections, then apply the absolute-order length equality to those two element types

Given: The data above.

1.1F1algebra

(The dihedral group and its reflections.) The defining relations give cm=1, t=sc, and scs=c−1. The order of c is exactly m: if m≥3, let R(i)=i+1 and J(i)=−i on Z/mZ. Since J2=1 and JRJ=R−1, the assignment s↦J, t↦JR satisfies s2=t2=1 and st↦R, so [F1] gives a homomorphism with the image of c of order m. If m=2, map s,t to the independent coordinate flips of (Z/2Z)2; these are commuting involutions, satisfy the defining relations, and their product has order 2. Since cm=1 in W, in both cases c has exact order m. Now W=⟨s,c⟩ and sck=c−ks, so every word reduces to ck or cks, with k taken modulo m. These at most 2m forms are distinct: the ck are distinct by the exact order just proved, the cks are distinct by cancellation, and the two families are separated by the homomorphism ε:W→{1,−1} with ε(s)=ε(t)=−1, which exists by [F1] because both simple generators map to −1 and st maps to 1. Thus ∣W∣=2m. The reflection set is exactly T={cks:0≤k<m}. Every conjugate of s or t has ε=−1 and is therefore in this list. Conversely, for every integer j, cjsc−j=c2js and, since t=sc, cjtc−j=c2j−1s. The exponents 2j and 2j−1 cover all residues modulo m, so every cks is a conjugate of a simple reflection. In particular ∣T∣=m.

1.2F3F5F6step 1.1algebra

(The Coxeter form and its plane action.) Put θ=π/m and q=cos⁡θ. For x=aes+bet, [F3] and [F5] give B(x,x)=a2−2qab+b2=(a−qb)2+sin⁡2θ b2. Since 0<θ≤π/2<π, [F5] gives sin⁡θ>0, so this is positive for every nonzero (a,b). In orthonormal coordinates take es=(1,0) and et=(−cos⁡θ,sin⁡θ). The reflection formula R(v)=I−2vvT and [F5] give ρ(c)=ρ(s)ρ(t)=(cos⁡(2θ)−sin⁡(2θ)sin⁡(2θ)cos⁡(2θ)). Thus c rotates this plane through 2π/m. The order calculation in step 1.1 proves finite type, including m=2, where s,t commute and the diagram consists of two isolated vertices.

2.1F2step 1.1algebra

(Reflection lengths.) Every r∈T is nonidentity and is itself a reflection, so ℓT(r)=1. Each nonidentity rotation ck is not in T by the sign ε, and ck=(cks)s is a product of two reflections; hence ℓT(ck)=2. In particular c has length 2.

3.1F2step 1.1step 2.1algebra

(The interval below c.) The identity and c lie below c. For rk=cks∈T, rk is a conjugate of an involutory simple reflection, so rk−1=rk, and rk−1c=rkc=cksc=ck−1s=rk−1∈T, so ℓT(rk)+ℓT(rk−1c)=2=ℓT(c) and every reflection lies below c. If ck is a rotation other than 1 or c, then c1−k is also a nonidentity rotation, so ℓT(ck)+ℓT((ck)−1c)=2+2=4≠2. These are all group elements by step 1.1, proving the interval formula. When m=2 there are no rotations other than 1,c, so the same argument covers that case.

4.1F2step 3.1algebra

(Lattice operations.) The interval in step 3.1 has bottom 1, top c, and m distinct reflections of equal length 1 between them. Distinct reflections are incomparable by [F2], since each has the same length and a strict absolute-order comparison would require positive length increase. Thus two distinct reflections have only 1 as common lower bound and only c as common upper bound; operations with 1 and c are forced by their bottom/top roles. This proves the displayed lattice operations directly and verifies the finite-type lattice conclusion in this example.

5.1F1F4F6step 1.2step 3.1algebra∎

(Kreweras action on reflections.) By [F4], K is an order-reversing bijection; its explicit action is K(1)=c, K(c)=1, and K(rk)=rk−1 by step 3.1. It therefore cycles through all m reflections. Direct multiplication gives K2(w)=c−1wc and c−1rkc=ck−2s=rk−2. By [F6] and step 1.2, this conjugation rotates each reflection axis through −2π/m in the displayed orientation (an angle of magnitude 2π/m); for m=2, a rotation through π fixes every unoriented axis. Iterating k↦k−2 returns to k exactly when m divides 2j. The least positive such j is m for odd m and m/2 for even m. Hence K2 has one cycle for odd m, two cycles for even m, and is the identity on T when m=2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

82 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