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.

A moved-space intersection in A3 that is not the meet

Example

Let W be the Coxeter group of type A3, with S={s1,s2,s3}, V=RS with positive definite Coxeter form, reflection set T and lengths ℓT,ℓ, and let φ:W→S4, si↦(i i+1), be the type-A isomorphism (Coxeter diagrams: edges, labels, components and finite type, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound). Put

γ=φ−1(1 2 3 4),α=φ−1((1 2)(3 4)),β=φ−1((1 4)(2 3)).

Then:

(i) ℓT(γ)=3, ℓT(α)=ℓT(β)=2, and α≤Tγ, β≤Tγ: indeed αγ=φ−1(2 4) and βγ=φ−1(1 3) are reflections, so γ=α⋅α−1γ and γ=β⋅β−1γ display the rank additivity 3=2+1.

(ii) Under the isometry esi↦12(ei−ei+1) of V with H={x∈R4:∑ixi=0} and the standard inner product, one has

M(α)={x∈H:x2=−x1, x4=−x3},M(β)={x∈H:x2=−x3, x4=−x1},

and M(α)∩M(β)=R(e1−e2+e3−e4) is a line containing no root of A3.

(iii) No element of W has moved space M(α)∩M(β): a nonzero moved space of an element of W contains a root (Root normals inside the moved space, factorizations into reflections, and independent normals (1)), while this line contains none. Moreover the greatest common lower bound of α and β in (W,≤T) is 1: any common lower bound τ satisfies M(τ)⊆M(α)∩M(β) (Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (2)(iv)), so τ=1 by the same root-existence clause; hence the moved space of the meet, M(1)=0, is strictly smaller than the intersection of the two moved spaces, and arbitrary subspace intersection does not compute the meet.

Facts & Assumptions

Given: The type-A3 Coxeter datum W,S,V,B,ρ,Φ,T and the isomorphism φ:W→S4 with si↦(i i+1); ℓT, M, F are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, and σ∈S4 acts on R4 by permuting coordinates.

[F1]

si↦(i i+1) extends to an isomorphism φ:W→S4, and S generates W. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification

[F3]

If M(w)≠0 for w∈W, then M(w) contains a root of Φ. Root normals inside the moved space, factorizations into reflections, and independent normals

[F5]
[F6]

Φ={ρ(w)es:w∈W, s∈S}, T={wsw−1:w∈W, s∈S}, and B(es,et)=−cos⁡(π/m(s,t)) with m(s,t)=3 for adjacent and 2 for non-adjacent generators of A3. Also u≤Tv means ℓT(v)=ℓT(u)+ℓT(u−1v), and ℓT(u)=0 holds exactly when u=1, since only the empty product has length zero. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator The canonical reflection homomorphism, roots, reflections, and the positive cone The real Coxeter form, its radical, reflections, and form-preserving maps Coxeter diagrams: edges, labels, components and finite type

[F7]

Write γ=π/2 for the smallest positive cosine zero; 0<γ<2, and cosine is strictly decreasing on [0,2]. Also cos⁡(π/2)=0, cos⁡(π−x)=−cos⁡x, and cos⁡(2x)=2cos⁡2x−1. 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 Quarter-turn values and shifts by pi/2 and pi Double-angle and quadratic power-reduction identities Parity and the Pythagorean identity for sine and cosine

Verification

technique · direct
1.1F1F5F6F7given

Put c:=cos⁡(π/3). By [F7], 0<π/3<γ<2 gives c>cos⁡γ=0, while 2c2−1=cos⁡(2π/3)=−c, so (2c−1)(c+1)=0 and c=12; also cos⁡(π/2)=0 by [F7]. Put vi:=12(ei−ei+1)∈H for i=1,2,3. Then ⟨vi,vi⟩=1, ⟨vi,vi+1⟩=−12 and ⟨vi,vj⟩=0 whenever ∣i−j∣≥2, which by [F6] and [F7] matches B(esi,esj)=−cos⁡(π/m(si,sj)); the vi are linearly independent, since the coordinates of av1+bv2+cv3 are (a,−a+b,−b+c,−c)/2, and every x∈H equals 2(x1v1+(x1+x2)v2+(x1+x2+x3)v3), so they form a basis of the three-dimensional space H and the linear map Θ:V→H with Θ(esi)=vi is a linear isometry onto H. For each i the permutation (i i+1) preserves H, fixes vi⊥∩H pointwise and sends vi to −vi, so it acts on H as an orthogonal involution with moved space Rvi; the image Θρ(si)Θ−1 is an orthogonal involution with the same moved space Rvi by [F5], and by the uniqueness in [F5] the two are equal. Since φ is an isomorphism [F1] and S generates W, the two homomorphisms ΘρΘ−1 and σ↦σ∣H from W to the orthogonal group of H agree on S, hence everywhere: Θρ(w)Θ−1=φ(w)∣H for all w∈W. In particular ΘΦ={σvi:σ∈S4, i≤3}={±12(ep−eq):p≠q}, because φ is onto and the transpositions of S4 are the images of the conjugate reflections.

2.1step 1.1F1F2

Under the identification of step 1.1, F(w)=Θ−1{x∈H:φ(w)x=x} and ℓT(w)=dim⁡V−dim⁡F(w)=3−dim⁡{x∈H:φ(w)x=x} by [F2]. For γ=φ−1(1 2 3 4) the fixed space in R4 of the 4-cycle (1 2 3 4) is R(e1+e2+e3+e4), which meets H in 0, so ℓT(γ)=3. For α=φ−1((1 2)(3 4)) the fixed space in R4 is {x:x1=x2, x3=x4}, whose intersection with H is R(e1+e2−e3−e4), of dimension 1; hence ℓT(α)=2, and the same computation with x1=x4, x2=x3 gives fixed space R(e1−e2−e3+e4)∩H of dimension 1 and ℓT(β)=2. Finally αγ=φ−1(2 4) and βγ=φ−1(1 3) by the multiplication convention (στ)(x)=σ(τ(x)) applied in S4: for instance αγ sends 1↦1, 2↦4, 3↦3, 4↦2, so it is the transposition (2 4); and for a transposition (p q) the fixed space in R4 has dimension 3 (inside H its coordinates satisfy xp=xq=a and 2a+xr+xs=0 for the remaining indices r,s, leaving two free parameters), so ℓT(φ−1(p q))=3−2=1.

2.2step 1.1F2

Since F(α) is the line R(e1+e2−e3−e4) in the model of step 1.1 and Θ is an isometry, M(α)=F(α)⊥ is, inside H, the orthogonal complement of e1+e2−e3−e4, namely {x∈H:x1+x2−x3−x4=0}={x∈H:x2=−x1, x4=−x3}; likewise F(β)=R(e1−e2−e3+e4) gives M(β)={x∈H:x1−x2−x3+x4=0}={x∈H:x2=−x3, x4=−x1}. Intersecting the two sets gives x2=−x1, x3=−x2=x1, x4=−x1 (the sum condition is then automatic), so M(α)∩M(β)=R(e1−e2+e3−e4) is a line.

3.1step 2.1F6

Since α−1γ=αγ=φ−1(2 4) because α is an involution, step 2.1 gives ℓT(γ)=3=2+1=ℓT(α)+ℓT(α−1γ), so α≤Tγ by the definition of ≤T in [F6], and the analogous computation with βγ=φ−1(1 3) gives β≤Tγ.

3.2step 1.1step 2.2F3

By step 1.1 the roots of A3 in the model are the twelve vectors ±12(ep−eq), p≠q, and none of these is a real multiple of e1−e2+e3−e4, so the line R(e1−e2+e3−e4) of step 2.2 contains no root; hence no w∈W has M(w)=R(e1−e2+e3−e4), because a nonzero moved space contains a root by [F3].

4.1step 2.2step 3.1step 3.2F2F4F6∎

Let τ∈W be a common lower bound of α and β, so M(τ)⊆M(α)∩M(β)=R(e1−e2+e3−e4) by [F4] and step 2.2. If M(τ)≠0, then M(τ) equals that line and τ is an element with moved space the line, contradicting step 3.2; hence M(τ)=0 and τ=1 by [F2]; since 1≤Tα,β, the greatest common lower bound of α and β is 1, and M(1)=0 is strictly smaller than the line M(α)∩M(β). This verifies (i), (ii) and (iii).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

100 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