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.

A crossing double transposition whose interval is Boolean, and the two incomparable maximal Coxeter elements of S3

Example

(1) A crossing interval that is a lattice. In S4 let x=(1 3)(2 4) and c=(1 2 3 4). Then ℓT(x)=2, and its absolute interval is [1,x]≤T={1,(1 3),(2 4),(1 3)(2 4)}, a Boolean lattice on two generators. The support partition {1,3}∣{2,4} is crossing, so x̸≤Tc by the type-A criterion (The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions (2)–(3)). Directly, x−1c=(1 4 3 2) has reflection length 3, so the absolute-order length equality for x≤Tc fails (Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator (2)). Thus a non-Coxeter element can have a lattice interval.

(2) The absolute order of S3 is not a lattice. With s1=(1 2) and s2=(2 3), the two Coxeter elements are c=s1s2=(1 2 3) and c′=s2s1=(1 3 2) (The symmetric group has the Coxeter presentation). They are distinct maximal and incomparable elements of reflection length 2 in Abs⁡(S3), and have no common upper bound. Each interval [1,c]≤T and [1,c′]≤T is the five-element lattice {1}∪T∪{c}, with the top element replaced by c′ in the second interval.

Facts & Assumptions

Given: The symmetric groups S3,S4, their usual right-to-left permutation composition, the reflection-length absolute order, and the type-A length and interval criterion of The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions.

[F1]

In SN, T is the set of transpositions and ℓT(w)=N−#{cycles of w}, with fixed points counted (The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions (2)).

[F2]

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

[F3]

In S3, the adjacent transpositions s1,s2 are the simple reflections of type A2, and composition acts from right to left (The symmetric group has the Coxeter presentation, The finite symmetric group Sn, one-line notation, and cycle notation).

Verification

technique · enumerate the reflection-length layers and test the defining length equality, then verify the small absolute intervals directly

Given: The data above.

1.1F1F2algebra

(The interval below the crossing element.) By [F1], ℓT(x)=4−2=2. If t is a transposition, then t−1x=tx. For t=(1 3) or (2 4), tx is the other transposition, so ℓT(t−1x)=1 and t≤Tx. The remaining four transpositions join the two cycles of x; explicitly, (1 2)x=(1 3 2 4), (1 4)x=(1 3 4 2), (2 3)x=(1 2 4 3), and (3 4)x=(1 4 2 3), each a 4-cycle of reflection length 3. None is below x. If u≤Tx, [F2] gives ℓT(u)≤2; length 0 forces u=1, and length 2 forces ℓT(u−1x)=0, hence u=x. Therefore the displayed four elements are the entire interval. Its two distinct atoms have meet 1 and join x, so it is the Boolean lattice on two generators.

1.2F1F2F3algebra

(The two maximal elements.) By [F1], the identity, the three transpositions, and the two 3-cycles are exactly the elements of S3, with reflection lengths 0,1,2, respectively. The products are s1s2=(1 2 3) and s2s1=(1 3 2). They are distinct and have equal length, so [F2] makes them incomparable. No element has length greater than 2, so each is maximal. A common upper bound would have to be strictly above one of these distinct maximal elements; hence none exists and Abs⁡(S3) has no join for this pair.

2.1F1F2step 1.1algebra

(The crossing obstruction.) The diagonals joining 1 to 3 and 2 to 4 cross in the square, so the support partition of x is crossing. Also direct right-to-left multiplication gives x−1c=(1 4 3 2), which has length 3 by [F1], while ℓT(c)=3 and ℓT(x)=2. Thus ℓT(x)+ℓT(x−1c)=5≠3=ℓT(c), so x̸≤Tc by [F2]. This verifies directly the exclusion predicted by the type-A criterion.

3.1F1F2F3algebra∎

(The Coxeter intervals are five-element lattices.) Fix either 3-cycle d. For d=(1 2 3), the products td for t=(1 2),(2 3),(1 3) are (2 3),(1 3),(1 2), respectively; for d=(1 3 2) they are (1 3),(1 2),(2 3). Hence every t∈T satisfies ℓT(d)=1+ℓT(t−1d)=2 and lies below d. If w≤Td has length 2, [F2] forces ℓT(w−1d)=0, so w=d. Therefore [1,d]≤T={1}∪T∪{d}. Its three transpositions are incomparable atoms, any two have meet 1 and join d, so this interval is a five-element lattice. Finally, s1(s1s2)s1=s2s1, so the two Coxeter elements are conjugate.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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