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.

In A3 the moved spaces meet in a line, while the root complexes have no common nonempty face

Example

Use the standard A3=S4 model, simple roots, and bipartite Coxeter element c=(1 2 4 3) of Ordered roots and the mu-dot-root matrix in A3. Put α:=(1 2)(3 4)=(1 4)c=R(ρ3)c,β:=(1 3)(2 4)=(2 3)c=R(ρ6)c. Then:

(i) α,β≤Tc and ℓT(α)=ℓT(β)=2. Their lower intervals are exactly [1,α]T={1,(1 2),(3 4),α},[1,β]T={1,(1 3),(2 4),β}. Thus their only common lower bound is 1, so their meet in [1,c]T is 1.

(ii) Pα={ρ1,ρ2} and Pβ={ρ4,ρ5}. The complexes are the edges X(α)=⟨ρ1,ρ2⟩ and X(β)=⟨ρ4,ρ5⟩. Their only common face is the empty face, so X(α)∩X(β)={∅}, their spherical realizations are disjoint, and c[X(α)]∩c[X(β)]=c[∅]={0}.

(iii) The moved spaces are M(α)=span{E1−E2,E3−E4} and M(β)=span{E1−E3,E2−E4}, both two dimensional, and M(α)∩M(β)=R (E1−E2−E3+E4). This line contains no root: every root has exactly two nonzero coordinates, whereas every nonzero vector on the displayed line has four. In the standard Euclidean norm the displayed generator has norm 2, while every root has norm 2. Hence M(α)∩M(β) strictly contains M(1)={0} and is not the moved space of any common lower bound.

(iv) The common upper bound is c=(1 4)α=β(1 4). Thus this example has positive-root cones meeting only at 0 and a nonzero moved-space intersection; intersecting moved spaces does not compute the meet in the absolute interval.

No Choice is used.

Facts & Assumptions

Given: The A3 coordinate model, root order, and reflection convention of Ordered roots and the mu-dot-root matrix in A3. The standard Euclidean norm is denoted ∥⋅∥std; its half-scaled inner product is the Coxeter form B used for unit roots.

[F1]

In the A3 model, Φ+={Ei−Ej:1≤i<j≤4} with order ρ1=(12),ρ2=(34),ρ3=(14),ρ4=(24),ρ5=(13),ρ6=(23), and R(Ei−Ej) acts as the coordinate transposition (i j). Ordered roots and the mu-dot-root matrix in A3 The real Coxeter form, its radical, reflections, and form-preserving maps

[F2]

ℓT(w) is the least number of reflections in T whose product is w, and u≤Tv means ℓ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]

For a linear map A, M(A)=im⁡(A−I) and F(A)=ker⁡(A−I). Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator (3)

[F4]

The ordered edge relation defines X(c); Pσ={γ∈Φ+:tγ≤Tσ} and X(σ) is its full subcomplex on Pσ; c[∅]={0} and c[X(σ)] is the union of the positive cones on its faces. The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations (1)-(3)

[F5]

The root-reflection dictionary identifies each positive-root reflection with the reflection in its normal. The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)

[F6]

Cones on two faces of X(c) intersect in the cone on their common face. The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (4)

Proof

technique · use the four coordinate permutations to compute the absolute intervals, then solve the moved-space intersection directly
1.1F1F2

In S4, α and β are products of two disjoint transpositions but are not themselves transpositions, so each has reflection length 2. The four-cycle c=(1 2 4 3)=(1 3)(1 4)(1 2) has reflection length 3: no product of at most two transpositions is a 4-cycle, since a product of two is the identity, a 3-cycle, or two disjoint transpositions. The identities c=(1 4)α and c=β(1 4) show that α−1c and β−1c are reflections (the first is a conjugate of (1 4)), hence α,β≤Tc.

2.1F1F2step 1.1

A reflection in this model is a transposition. For t∈T, t≤Tα exactly when tα is a reflection, because ℓT(α)=2 and ℓT(t)=1. If t=(1 2) or (3 4), tα is the other factor transposition. Any other transposition connects the two pairs {1,2} and {3,4}, and tα is a four-cycle. Thus the only reflections below α are (1 2) and (3 4). The same argument with the factor pairs {1,3} and {2,4} shows that the only reflections below β are (1 3) and (2 4). By the defining length equality, a proper lower element has strictly smaller reflection length, so the two lower intervals are exactly those listed in (i), and their intersection is {1}.

3.1F1F4F5F6step 1.1step 2.1

The coordinate action gives M(α)=span{E1−E2,E3−E4} and M(β)=span{E1−E3,E2−E4}. By [F4]-[F5] and step 2.1, their positive-root sets are respectively {ρ1,ρ2} and {ρ4,ρ5}. The reverse products for the ordered pairs are R(ρ2)R(ρ1)=(3 4)(1 2)=α≤Tc and R(ρ5)R(ρ4)=(1 3)(2 4)=β≤Tc, so both pairs are edges by [F4]. The vertex sets are disjoint, hence every face of X(α) and every face of X(β) have common face ∅. By [F6], each corresponding pair of face cones intersects in c[∅]={0}; taking the finite unions of these face cones gives c[X(α)]∩c[X(β)]={0}. Intersecting with the unit sphere also gives disjoint spherical realizations.

4.1F1F3step 1.1step 2.1step 3.1∎

Write a vector of M(α) as a(E1−E2)+b(E3−E4)=(a,−a,b,−b) and a vector of M(β) as d(E1−E3)+e(E2−E4)=(d,e,−d,−e). Equating coordinates gives d=a, e=−a, and b=−a, so the intersection is exactly R(E1−E2−E3+E4). Every nonzero vector on this line has four nonzero coordinates, whereas every root in [F1] has two; therefore the line contains no root. The standard norm of its displayed generator is 2 and that of each root is 2. By step 2.1, the meet is 1, whose moved space is {0}; thus the moved-space intersection is strictly larger and is not the moved space of any common lower bound. Finally c=(1 4)α=β(1 4) is the asserted common upper bound.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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