Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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 right weak interval below the longest element of A2 is not distributive

Example

Let S={s1,s2} with m(s1,s2)=3 (type A2), let W be the presented group, let w0:=s1s2s1, and let ≤R be the right weak order (The right and left weak orders, intervals, covers, and meets and joins of subsets).

(1) [1,w0]R=W={1,s1,s2,s1s2,s2s1,w0}, with cover relations 1⋖s1, 1⋖s2, s1⋖s1s2, s2⋖s2s1, s1s2⋖w0, s2s1⋖w0; the middle elements s1s2 and s2s1 are incomparable, and so are s1,s2s1 and s2,s1s2.

(2) The subposet {1, s1, s1s2, s2s1, w0} is a pentagon: 1<s1<s1s2<w0 and 1<s2s1<w0, with s1,s1s2 incomparable to s2s1.

(3) [1,w0]R is not distributive: with u=s1, v=s1s2 and d=s2s1 one has u∨d=w0 (the only common upper bound of s1 and s2s1), hence v∧(u∨d)=v∧w0=v=s1s2, while (v∧u)∨(v∧d)=u∨1=s1, and s1≠s1s2.

(4) The element w0 is not fully commutative, since the reduced word s1s2s1 contains the contiguous braid factor ⟨s1,s2⟩3; so this interval is a non-distributive weak interval below a non-fully-commutative element. The example does not prove the converse of The right weak order interval below a fully commutative element is the lattice of order ideals of its heap; it verifies non-distributivity of this single interval directly.

Facts & Assumptions

Given: The Coxeter matrix of type A2 on S={s1,s2}, the presented group W, the right weak order ≤R and the element w0=s1s2s1.

[F1]

The right weak order is defined by u≤Rv if and only if v=ux with ℓ(v)=ℓ(u)+ℓ(x); intervals, covers ⋖R and meets and joins of subsets are defined by their universal properties (The right and left weak orders, intervals, covers, and meets and joins of subsets, clauses (1)-(3)); the relators of the presentation are s2 and (st)m(s,t) (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F2]

For all u,v∈W one has u≤Rv  ⟺  ℓ(v)=ℓ(u)+ℓ(u−1v), so u<Rv forces ℓ(u)<ℓ(v); and u≤Rv if and only if some reduced expression of v has a reduced expression of u as initial segment (The length identity, the prefix property, left translation, and interval translation for weak order, clauses (1)-(2)).

[F3]

Covers in ≤R are exactly the pairs v=us with s∈S and ℓ(v)=ℓ(u)+1 (Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion, clause (2)).

[F4]

The subgroup ⟨s1,s2⟩ is dihedral of order 2m(s1,s2)=6, any two reduced expressions of the same element are braid-equivalent, every element has a reduced expression with letters in {s1,s2}, and the alternating words of length q≤3 are reduced (Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups, clauses (1) and (3)).

[F5]

An element is fully commutative if and only if no reduced word of it contains ⟨u,v⟩m(u,v) as a contiguous factor for any distinct u,v with 3≤m(u,v)<∞ (Fully commutative elements: the braid-factor criterion and the forbidden-chain heap criterion, clause (1)).

[F6]

A lattice is distributive when the distributive identity x∧(y∨z)=(x∧y)∨(x∧z) holds for all x,y,z (Lattices, distributive lattices, and order ideals).

[F7]

The interval theorem identifies only right weak intervals of fully commutative elements with lattices of order ideals; no claim is made about elements that are not fully commutative (The right weak order interval below a fully commutative element is the lattice of order ideals of its heap, clause (4)).

Verification

technique · direct
1.1givenF1F4

The group and its elements. Since S={s1,s2}, the subgroup ⟨s1,s2⟩ is all of W, so by [F4] W is dihedral of order 2⋅3=6; its elements are the six distinct elements (s1s2)k and (s1s2)ks1 for k=0,1,2. With (s1s2)3=1 from the relator of [F1] these are 1, s1s2, (s1s2)2=s2s1, s1, (s1s2)s1=s1s2s1=w0 and (s1s2)2s1=s2; hence W={1,s1,s2,s1s2,s2s1,w0} and, since the displayed words are the reduced expressions by [F4], the lengths are 0,1,1,2,2,3 respectively, in particular ℓ(w0)=3. The reduced words of w0 are exactly s1s2s1 and s2s1s2: both are reduced of length 3 and represent w0 by the braid relation of [F1], and by F4 every reduced word of w0 is braid-equivalent to s1s2s1, while the only braid move applicable to a length-three word in the two letters replaces the whole alternating word by the other.

2.1givenF2F3step 1.1

The interval and the covers. By the prefix property F2, the elements of [1,w0]R are the products of the prefixes of the reduced words s1s2s1 and s2s1s2 of w0 established in step 1.1, namely 1,s1,s1s2,w0 and 1,s2,s2s1,w0; these are all six elements of W by 1.1, so [1,w0]R=W. By [F3] every cover in ≤R is of the form v=us with s∈S and ℓ(v)=ℓ(u)+1; running over the six elements u and the two generators and using the length table of 1.1, the products with length increase one are exactly 1⋅s1=s1, 1⋅s2=s2, s1⋅s2=s1s2, s2⋅s1=s2s1, s1s2⋅s1=w0 and s2s1⋅s2=w0, while s1s2⋅s2=s1, s2s1⋅s1=s2 and the products w0s (of length 2) do not raise the length. Hence these six pairs are exactly the covers. The elements s1s2 and s2s1 are distinct of equal length 2, so neither is below the other by the strict length increase in F2, and they are incomparable; likewise s2s1̸≤Rs1 and s1s2̸≤Rs2 by length, while s1≤Rs2s1 would force ℓ(s2s1)=ℓ(s1)+ℓ(s1−1s2s1)=1+ℓ(w0)=4 by F2, which is false; so s1,s2s1 are incomparable, and symmetrically s2,s1s2 are incomparable. Consequently the subposet {1,s1,s1s2,s2s1,w0} has the chains 1<s1<s1s2<w0 and 1<s2s1<w0 together with the incomparabilities just listed, that is, it is the pentagon.

3.1givenF1F2F4F6step 1.1step 2.1

Failure of distributivity. Put u=s1, v=s1s2 and d=s2s1. The upper bounds of {u,d} are the elements above both: above s1 lie s1,s1s2,w0 and above s2s1 lie s2s1,w0, so the only common upper bound is w0 and u∨d=w0. Since v=s1s2≤Rw0, one has v∧(u∨d)=v∧w0=v=s1s2. The only reduced word of v=s1s2 is (s1,s2): the only length-two words are s1s1,s1s2,s2s1,s2s2, the equal-letter words represent 1, and s1s2 and s2s1 are distinct by the element list in 1.1. The only reduced word of d=s2s1 is likewise (s2,s1). Therefore the elements below v are 1,s1,s1s2, while those below u=s1 are 1,s1, so v∧u=s1; the elements below d are 1,s2,s2s1, whose intersection with the elements below v is just 1, so v∧d=1. Hence (v∧u)∨(v∧d)=s1∨1=s1, while v∧(u∨d)=s1s2≠s1; the distributive identity of [F6] fails for the triple (u,v,d), so [1,w0]R is not distributive.

4.1givenF5F7step 1.1step 3.1∎

By step 1.1, s1s2s1 is a reduced word of w0 containing the contiguous factor ⟨s1,s2⟩3, so by [F5] the element w0 is not fully commutative; this exhibits a non-distributive right weak interval below a non-fully-commutative element. The interval theorem [F7] concerns only fully commutative elements, so no contradiction arises, and the example verifies only the failure of distributivity for this single interval; it does not prove the converse implication.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

46 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