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.

Two distributive right weak intervals of fully commutative elements in type A3

Example

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

(1) A Boolean interval. For u:=s1s3 the heap Pu is the two-element antichain with labels s1,s3; its order ideals are the four subsets of {1,2}, forming a Boolean lattice, and the right weak interval [1,u]R={ 1, s1, s3, u } is a four-element distributive lattice, with s1∧s3=1 and s1∨s3=u. The map of The right weak order interval below a fully commutative element is the lattice of order ideals of its heap sends 1,s1,s3,u to ∅,{1},{2},{1,2}.

(2) A five-element interval. For w:=s1s3s2 the heap Pw is the V-shaped poset with relations 1≺3 and 2≺3, whose five order ideals are ∅,{1},{2},{1,2},{1,2,3}. The right weak interval [1,w]R consists of the five elements 1,s1,s3,s1s3,w, and it is a distributive lattice isomorphic to J(Pw): the three elements s1,s3,s1s3 are exactly the products of the nonempty proper ideals {1},{2},{1,2}, while w is the product of Pw. Here s1∧s3=1, s1∨s3=s1s3, and s1s3∨s1=s1s3, in agreement with intersection and union of the corresponding ideals.

(3) Both intervals are finite and distributive, illustrating The right weak order interval below a fully commutative element is the lattice of order ideals of its heap (2)-(3); the first has a non-chain heap while the second's heap is not a chain either, so the distributivity is not merely the chain case.

Facts & Assumptions

Given: The Coxeter matrix of type A3 on S={s1,s2,s3}, the presented group W, the right weak order ≤R, the elements u=s1s3 and w=s1s3s2, and the heaps Pu,Pw.

[F1]

The heap of a word and its labeled linear extensions L(Pq,q) are as in Words, heaps, linear extensions, commutation classes, and fully commutative elements (clauses (2) and (4)); m(s1,s3)=2 means that s1 and s3 commute and that the defining relation has no generator between positions with these labels; in this two-position word there is no intermediate position, so no transitive heap path relates them (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F2]

For every word q one has L(Pq,q)=C(q), the commutativity class of q (Labeled linear extensions of a heap are exactly the words in its commutativity class, and heaps classify commutativity classes, clause (1)).

[F3]

If a word has heap P and product x, and conditions (a) and (b) of the heap criterion hold (no convex alternating chain of length m(u,v)∈[3,∞) and no covering pair with equal labels), then the word is reduced, x is fully commutative and P=Px (Fully commutative elements: the braid-factor criterion and the forbidden-chain heap criterion, clause (2)).

[F4]

For a fully commutative w with reduced word s∈R(w) and heap P=Ps: the map x↦I(x) sends x≤Rw to the ideal I(x) determined by any reduced word of x, with ℓ(x)=∣I(x)∣, I(1)=∅, I(w)=P; it is an order isomorphism [1,w]R→J(P); and [1,w]R is a finite distributive lattice in which meets and joins satisfy I(x∧y)=I(x)∩I(y) and I(x∨y)=I(x)∪I(y) (The right weak order interval below a fully commutative element is the lattice of order ideals of its heap, clauses (1)-(3)).

[F5]

For every s∈S one has ℓ(s)=1, and distinct generators are distinct in W (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, clauses (1) and (4)).

[F6]

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, clause (2)).

Verification

Given: The type A3 Coxeter matrix, the right weak order, and the words u=s1s3 and w=s1s3s2.

Proof technique: direct.

1.1givenF1F2F3

The data for w. The word (s1,s3,s2) has heap Pw on positions 1,2,3: positions 1,3 carry s1,s2 with m(s1,s2)=3 and positions 2,3 carry s3,s2 with m(s3,s2)=3, so 1≺3 and 2≺3; positions 1,2 carry the distinct commuting letters s1,s3 with m(s1,s3)=2, so there is no generating relation between them; because positions 1,2 are consecutive in the original word and every generating edge increases the position, no intermediate position can lie on a path between them, so no transitive path relates them. Both heap-criterion conditions hold: every chain of Pw has at most two elements, so there is no convex alternating chain of length 3, and the covering pairs 1⋖3, 2⋖3 have distinct labels (s1,s2) and (s3,s2); by [F3] the word is reduced, w is fully commutative and Pw is the heap of w, with ℓ(w)=3. The linear extensions of Pw are (1,2,3) and (2,1,3), since both relations force position 3 last; their labeled words are s1s3s2 and s3s1s2, so C((s1,s3,s2))=R(w)={s1s3s2, s3s1s2} by [F2] and [F3]. The order ideals are the subsets I with 3∈I⇒1,2∈I, namely ∅,{1},{2},{1,2},{1,2,3}.

1.2givenF1F3F2

The data for u. The word (s1,s3) has heap Pu on positions 1,2 with labels s1,s3: since m(s1,s3)=2 and the labels are distinct, no generating relation links the two positions, so Pu is the two-element antichain and it has no covering pairs. Conditions (a) and (b) of [F3] hold vacuously (there is no chain of length 3, and no covering pair at all), so the word is reduced, u is fully commutative with heap Pu and ℓ(u)=2. By [F2] its reduced words are the words read from the two linear extensions (1,2), (2,1) of Pu, namely R(u)=C((s1,s3))={s1s3, s3s1}. The order ideals of the antichain Pu are all four subsets of {1,2}.

2.1givenF4F5F6step 1.2

The interval [1,u]R. By [F4] the map x↦I(x) is an order isomorphism [1,u]R→J(Pu), so [1,u]R has exactly ∣J(Pu)∣=4 elements and is a finite distributive lattice with meet and join given by intersection and union of ideals. By [F6] the products of the prefixes of the reduced words s1s3 and s3s1, namely 1,s1,u and 1,s3,u, lie in [1,u]R; they are pairwise distinct because their lengths are 0,1,1,2 and s1≠s3 by [F5]; hence they exhaust the four-element interval and [1,u]R={1,s1,s3,u}. For the ideal map: ℓ(s1)=ℓ(s3)=1 and ℓ(u)=2 by [F5] and 1.2, so ∣I(s1)∣=∣I(s3)∣=1 and ∣I(u)∣=2; computing with the reduced words (s1), (s3) and (s1,s3) gives I(s1)={1}, I(s3)={2} and I(u)={1,2}, while I(1)=∅ by [F4]. Hence s1∧s3 is the element with ideal {1}∩{2}=∅, namely 1, and s1∨s3 is the element with ideal {1}∪{2}={1,2}, namely u.

2.2givenF4F6step 1.1step 1.2

The interval [1,w]R. By [F4] the map x↦I(x) is a bijection [1,w]R→J(Pw), so [1,w]R has exactly five elements by 1.1, and it is a finite distributive lattice with meets and joins given by intersection and union of ideals. By [F6], the prefixes of the two reduced words s1s3s2 and s3s1s2 of 1.1 show that all five displayed elements lie in [1,w]R. Their ideals are computed as follows: I(1)=∅ and I(w)=Pw by [F4]; and, using the chains Cs1={1}, Cs3={2}, Cs2={3} of Pw, the reduced words (s1) and (s3) give I(s1)={1} and I(s3)={2}, while the reduced word (s1,s3) of 1.2 gives I(s1s3)={1,2}; its prefixes are those of the reduced word s1s3s2 of w, so that s1s3≤Rw by [F6]. Their images ∅,{1},{2},{1,2},{1,2,3} are the five distinct elements of J(Pw), so [1,w]R={1,s1,s3,s1s3,w} and each displayed element is the product of the ideal that is its image. In particular s1∧s3 has ideal {1}∩{2}=∅, so s1∧s3=1; s1∨s3 has ideal {1}∪{2}={1,2}, so s1∨s3=s1s3; and s1s3∨s1 has ideal {1,2}∪{1}={1,2}, so s1s3∨s1=s1s3.

3.1givenstep 1.1step 1.2step 2.1step 2.2∎

Both intervals are finite distributive lattices by 2.1 and 2.2, illustrating F4-(3). Their heaps are the two-element antichain of 1.2 and the V-shaped poset of 1.1; the first is not a chain because its two elements are incomparable, and the second is not a chain because 1 and 2 are incomparable in Pw. So the distributivity exhibited here is not the chain case.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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