Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generated
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.

Divisibility of positive lifts and weak order

PDF p. 22: Lemma 5.9, opening proof paragraphs; PDF p. 23: Lemma 5.9, opening proof paragraphs

Statement

Let (W,S) be a finite-rank Coxeter system of spherical type, meaning that W is finite. Let A be its Artin–Tits group, A+ its submonoid generated by the standard generators σs, and π:A→W the homomorphism sending σs to s. Write ℓ(w) for the minimum length of a word in S representing w. For a reduced expression w=s1⋯sr, define its positive lift by σw=σs1⋯σsr, and put W~={σw:w∈W}⊆A+.

For a,b∈A+, say that a left-divides b if b=ac for some c∈A+. On W use the prefix weak order: u≤v if v=ux for some x∈W with ℓ(v)=ℓ(u)+ℓ(x). Restriction of π is an isomorphism from W~ with left divisibility to W with this order, with inverse w↦σw. The article calls the latter left weak Bruhat order; the prefix convention here is also called right weak order.

The left-divisibility least common multiple of any two elements of W~ exists in A+ and belongs to W~.

Facts & Assumptions

[F1]

Positive lifts are independent of reduced expression, satisfy π(σw)=w, and obey σux=σuσx whenever ℓ(ux)=ℓ(u)+ℓ(x). The stated prefix relation is right weak order. (Reduced-word lifts and the prefix-order convention)

[F2]

In spherical type, the presented positive Artin monoid M embeds as A+; its Garside element Δ has left divisors precisely the reduced positive lifts, and every pair has a left-divisibility lcm. (Independent spherical Artin Garside input)

[F3]

Word length in the positive generators gives an additive degree on M. Under the embedding this degree transports to A+, and deg⁡(σw)=ℓ(w). (Positive degree and atoms of the presented Artin monoid, Reduced Coxeter lifts in the presented positive monoid, Identifying the presented monoid with its positive image)

[F4]

Every element of A+ is represented by a finite positive word. Coxeter length is the minimum length of a representing word; concatenating representative words gives ℓ(ux)≤ℓ(u)+ℓ(x). (Positive Artin and parabolic monoids, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)

[F5]

An order isomorphism between posets is a bijection that preserves and reflects the order. (Order embedding and order isomorphism)

Proof

Given: The spherical Coxeter and Artin–Tits data in the statement.

Goal: Prove the poset identification and lcm closure.

1.1F1given

The lift map is a section of π by [F1], hence it is injective and π restricts to its inverse on W~. If u≤v, choose x as in the prefix definition. Then [F1] gives σv=σuσx, and σx∈A+, so σu left-divides σv.

2.1F3F4F5step 1.1given

Conversely, suppose σv=σuc with c∈A+. Choose a positive word for c of length k and put x=π(c). Its image is a word of length k for x, so ℓ(x)≤k by [F4]. Additivity of degree and [F3] give ℓ(v)=ℓ(u)+k. Applying π gives v=ux, and [F4] now gives ℓ(v)≤ℓ(u)+ℓ(x)≤ℓ(u)+k=ℓ(v). Thus both inequalities are equalities and u≤v. Together with step 1.1 this proves the poset isomorphism.

3.1F2given∎

Let a,b∈W~. By [F2] each left-divides Δ, and their left-divisibility lcm m exists. Since Δ is a common upper bound, the defining least-upper-bound property gives that m left-divides Δ. The left divisors of Δ are exactly W~ by [F2], so m∈W~. This proves the remaining assertion.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources