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.

All meets and joins of the right weak order of A2 (S3), with the left order and the inversion sets compared

Example

Let (S,m) be the Coxeter matrix of type A2: S={s,t}, m(s,t)=3, let W be the presented group with length ℓ, identified with the symmetric group S3 by Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), and let ≤R,≤L be the weak orders of The right and left weak orders, intervals, covers, and meets and joins of subsets. Then W={1,s,t,st,ts,w0} with w0=sts=tst and ℓ(1)=0, ℓ(s)=ℓ(t)=1, ℓ(st)=ℓ(ts)=2, ℓ(w0)=3, and:

(1) Covers and the lattice table. The right weak order has exactly the cover relations 1⋖Rs, 1⋖Rt, s⋖Rst, t⋖Rts, st⋖Rw0, ts⋖Rw0, so its Hasse diagram is the hexagon formed by the two chains 1<s<st<w0 and 1<t<ts<w0. Meets and joins are the following complete table: on elements of one chain, meet and join are the smaller and the larger; across the two chains one has

u∧v=1  for  (u,v)∈{(s,t),(s,ts),(st,t),(st,ts)},w0∧v=v  for  v∈{s,t,st,ts},

and u∨v=w0 for the four pairs (u,v)∈{(s,t),(s,ts),(st,t),(st,ts)} and their reversals, as well as whenever one of u,v equals w0. In particular ⋀∅=w0 and ⋁∅=1, and every meet and join in the table is the unique element with the corresponding universal bound property.

(2) Left order and inversion. The left weak order is the image of the right order under w↦w−1: for example s≤Rst but s̸≤Lst, while t≤Lst but t̸≤Rst. With the simple roots αs,αt and the positive root αs+αt of A2, the six inversion sets N(w−1) are

∅, {αs}, {αt}, {αs,αs+αt}, {αt,αs+αt}, Φ+

for w=1,s,t,st,ts,w0 respectively, and the criterion u≤Rv  ⟺  N(u−1)⊆N(v−1) of Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (4) is verified on all 36 pairs.

Facts & Assumptions

Given: The Coxeter matrix of type A2: S={s,t}, m(s,t)=3; the presented group W with length ℓ, weak orders ≤R,≤L, canonical reflection representation ρ on V=RS with basis es,et, Coxeter form B, and signed root system Φ=Φ+⊔Φ−.

[F1]

Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: the Coxeter presentation has relators u2=1 for u∈S and (uv)m(u,v)=1 for distinct generators when m(u,v)<∞; in type A2, s2=t2=1 and (st)3=1.

[F2]

Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: W is generated by S and ℓ(w) is the minimum length of a word in S representing w, with ℓ(1)=0; reduced expressions realize this minimum.

[F3]

Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4): for the type-An−1 matrix, si↦(i i+1) extends to an isomorphism W→Sn.

[F5]

The right and left weak orders, intervals, covers, and meets and joins of subsets (1): u≤Rv iff v=ux with ℓ(v)=ℓ(u)+ℓ(x).

[F6]

The right and left weak orders, intervals, covers, and meets and joins of subsets (1): u≤Lv iff v=xu with ℓ(v)=ℓ(u)+ℓ(x).

[F7]

Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (2): u⋖Rv iff v=us for some s∈S with ℓ(v)=ℓ(u)+1, and every comparison is a chain of such covers.

[F8]
[F9]

Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion (1): both weak orders are partial orders with minimum 1, and inversion is an order isomorphism (W,≤R)→(W,≤L).

[F10]

Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics (2): if W is finite, both weak orders have minimum 1 and maximum w0, with ⋀∅=w0 and ⋁∅=1.

[F11]

The real Coxeter form, its radical, reflections, and form-preserving maps (2): B is symmetric, B(es,es)=B(et,et)=1, and B(es,et)=−cos⁡(π/3).

[F12]

The real Coxeter form, its radical, reflections, and form-preserving maps (3): if B(a,a)≠0, then ra(v)=v−2B(v,a)B(a,a)a.

[F13]

The canonical reflection homomorphism, roots, reflections, and the positive cone (1): ρ is a homomorphism with ρ(s)=res for every s∈S.

[F14]

The canonical reflection homomorphism, roots, reflections, and the positive cone (2): Φ={ρ(w)eu:w∈W, u∈S} is the orbit of the simple roots.

[F15]

The canonical reflection homomorphism, roots, reflections, and the positive cone (3), Root sign coherence and the action of simple reflections on positive roots (2): V+={∑u∈Sλueu:λu≥0}, Φ+=Φ∩V+, Φ−=−Φ+, and Φ=Φ+⊔Φ−.

[F16]

The geometric inversion set N(w) of an element of a Coxeter group (1): N(w)={α∈Φ+:ρ(w)α∈Φ−}.

[F17]

The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (2): for every reduced expression w=s1⋯sn, N(w−1)={ρ(s1⋯si−1)esi:1≤i≤n}, with the displayed elements pairwise distinct positive roots.

[F18]

Double-angle and quadratic power-reduction identities: cos⁡(2x)=2cos⁡2x−1 for every real x.

[F19]
[F20]

Signs, monotonicity intervals, and ranges of sine and cosine: cosine is strictly decreasing on [2mπ,(2m+1)π] for every integer m.

[F21]
[F22]

The right and left weak orders, intervals, covers, and meets and joins of subsets (3): a meet is a greatest lower bound and a join is a least upper bound, with their universal lower- and upper-bound properties.

[A1]

In a poset, common lower bounds form the intersection of the down-sets, and common upper bounds form the intersection of the up-sets. Their greatest and least elements, respectively, are the meet and join.

Proof

1.1F1F2F3F4givenalgebra

The six elements: the type-A isomorphism and inversion-length formula [F3,F4] give ∣W∣=6, ℓ(s)=ℓ(t)=1, ℓ(st)=ℓ(ts)=2 and ℓ(sts)=3. The values 1,s,t,st,ts,sts are distinct: 1 has length 0 by [F2], the isomorphism separates s and t, elements of different lengths are distinct, and st=ts would imply sts=t after right multiplication by s, contradicting their lengths. From the presentation [F1], (st)3=1 and s2=t2=1; hence (sts)(tst)=1, while tst is an involution. Therefore sts=tst=:w0, and the six displayed elements exhaust W.

1.2F2F11F12F13F14F15F18F19F20F21givenalgebra

The A2 root set and reflection actions: put c:=cos⁡(π/3). By [F18,F19], 2c2−1=cos⁡(2π/3)=−c, so (2c−1)(c+1)=0. Since π/3<π/2, [F20] and [F21] give c=cos⁡(π/3)>cos⁡(π/2)=0, hence c=1/2. From the Coxeter form and reflection formula [F11,F12], ρ(s)es=−es, ρ(s)et=et+es, ρ(t)et=−et, and ρ(t)es=es+et; thus ρ(s)(es+et)=et and ρ(t)(es+et)=es. These actions and linearity show that R:={±es,±et,±(es+et)} is invariant under both generators. Since W is generated by S [F2] and ρ is a homomorphism [F13], every ρ(w) preserves R. The root-orbit definition [F14] gives Φ⊆R; conversely es,et are roots, −es=ρ(s)es, −et=ρ(t)et, es+et=ρ(s)et, and −(es+et)=ρ(s)ρ(t)et, so Φ=R. The positive cone and sign theorem [F15] then give Φ+={αs,αt,αs+αt}, where αs=es and αt=et.

2.1F1F4F7step 1.1givenalgebra

Covers: the cover characterization [F7] says a right cover is right multiplication by a simple generator with length rise one. Multiplying the six values of step 1.1 by s,t gives the rises 1s=s, 1t=t, st=s⋅t, ts=t⋅s, w0=st⋅s, and w0=ts⋅t; each raises length by one by [F4]. The other six products are ss=1, tt=1, (st)t=s, (ts)s=t, w0s=st, and w0t=ts, none of which raises length. Hence the right covers are exactly the six displayed in the statement.

2.2F1F4F5F6F9step 1.1givenalgebra

The asymmetry: st=s⋅t and ℓ(st)=ℓ(s)+ℓ(t), so s≤Rst by [F5]. If s≤Lst, [F6] gives st=xs and ℓ(st)=ℓ(x)+ℓ(s); right multiplication by s gives x=sts=w0, contradicting 2=ℓ(st)=ℓ(x)+1=4. Likewise st=s⋅t with ℓ(st)=ℓ(s)+ℓ(t) gives t≤Lst, while t≤Rst would force x=t−1st=tst=w0 and 2=ℓ(st)=1+3, impossible. Inversion is an order isomorphism by [F9], consistent with these comparisons.

2.3F1F13F16F17step 1.1step 1.2givenalgebra

The six inversion sets: by the definition [F16] and prefix-root formula [F17], the reduced expressions from step 1.1 and the roots from step 1.2 give N(1)=∅, N(s−1)=N(s)={αs}, N(t−1)=N(t)={αt}, N((st)−1)=N(ts)={αs,ρ(s)αt}={αs,αs+αt}, and N((ts)−1)=N(st)={αt,ρ(t)αs}={αt,αs+αt}. For w0=sts=tst, the same formula gives N(w0−1)={αs,ρ(s)αt,ρ(st)αs}={αs,αs+αt,αt}=Φ+, since ρ(st)αs=ρ(s)(αs+αt)=αt.

3.1F7F9step 2.1givenalgebra

The right order: the cover chains of step 2.1 and the chain characterization in [F7] give exactly the 17 relations: 1≤Rv for all six v; s≤Rs,st,w0; t≤Rt,ts,w0; st≤Rst,w0; ts≤Rts,w0; and w0≤Rw0. The remaining 19 of the 36 ordered pairs do not satisfy u≤Rv; eight have incomparable entries, and eleven are reversals of strict comparisons. The down-sets are ↓1={1}, ↓s={1,s}, ↓t={1,t}, ↓st={1,s,st}, ↓ts={1,t,ts} and ↓w0=W; the up-sets are ↑1=W, ↑s={s,st,w0}, ↑t={t,ts,w0}, ↑st={st,w0}, ↑ts={ts,w0} and ↑w0={w0}. The minimum 1 and poset properties used here are in [F9].

3.2F9step 2.2givenalgebra

The order isomorphism: inversion is an order isomorphism by [F9], so left weak order is the image of the right order under w↦w−1. In particular, s≤Rst but s̸≤Lst, while t≤Lst but t̸≤Rst, as shown in step 2.2.

4.1A1F10F22step 3.1givenalgebra

Meets: intersections of down-sets from step 3.1 are {1} for the four cross pairs (s,t),(s,ts),(st,t),(st,ts); they are the down-set of the smaller element for pairs in one chain, and the down-set of the other element when one is w0. By [A1] their greatest elements are the greatest common lower bounds, so the cross-pair meets are 1, the meet along a chain is its smaller element, and w0∧v=v for v∈{s,t,st,ts}. Each listed value lies below both elements and dominates every common lower bound, the universal property in [F22]. For the empty meet every element is a lower bound, and the maximum w0 gives ⋀∅=w0, in agreement with [F10].

4.2A1F10F22step 3.1givenalgebra

Joins: intersections of up-sets from step 3.1 are {w0} for the four cross pairs (s,t),(s,ts),(st,t),(st,ts) and for every pair containing w0; on a chain, the intersection is the up-set of the larger element. By [A1] their least elements are the least common upper bounds, so every cross-pair join and every join involving w0 is w0, and joins along a chain are its larger element. Each listed value is an upper bound and lies below every common upper bound, the universal property in [F22]. For the empty join every element is an upper bound, and the minimum 1 gives ⋁∅=1, in agreement with [F10].

5.1F8step 2.3step 3.1givenalgebra∎

The criterion on all 36 pairs: write γ=αs+αt. The six sets of step 2.3 are ∅, {αs}, {αt}, {αs,γ}, {αt,γ}, and {αs,αt,γ}. Their inclusion relations consist of the six reflexive pairs; the five strict inclusions from ∅ to every nonempty set; the four inclusions from each singleton to its containing intermediate set and to the full set; and the two inclusions from the intermediate sets to the full set, for 17 relations total. The remaining 19 ordered pairs do not satisfy the directed inclusion N(u−1)⊆N(v−1). Comparing these 17 inclusions and 19 failures with the corresponding right-order relations and failures from step 3.1 proves, in both directions, u≤Rv  ⟺  N(u−1)⊆N(v−1) on all 36 pairs by [F8]. No Choice is used.

Depends on

Used by

Dependency tree · two levels

82 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