Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 and left weak orders, intervals, covers, and meets and joins of subsets

Definition

Let (S,m) be a finite Coxeter matrix, let W be the presented group with length function ℓ and reduced expressions (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and for w∈W let

DL(w):={s∈S:ℓ(sw)<ℓ(w)},DR(w):={s∈S:ℓ(ws)<ℓ(w)}

be the left and right descent sets already fixed in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2). Let T, Φ=Φ+⊔Φ− and the inversion sets N(w)={α∈Φ+:ρ(w)α∈Φ−} be the reflection set, the signed root system and the inversion sets of The canonical reflection homomorphism, roots, reflections, and the positive cone and The geometric inversion set N(w) of an element of a Coxeter group.

(1) Right and left weak order. Define two relations on W by

u≤Rv  ⟺  v=ux for some x∈W with ℓ(v)=ℓ(u)+ℓ(x),

u≤Lv  ⟺  v=xu for some x∈W with ℓ(v)=ℓ(u)+ℓ(x).

These are the right weak order and the left weak order on W. Inversion relates them definitionally: u≤Rv  ⟺  u−1≤Lv−1, because v=ux with ℓ(v)=ℓ(u)+ℓ(x) is equivalent to v−1=x−1u−1 with ℓ(v−1)=ℓ(u−1)+ℓ(x−1), using ℓ(y)=ℓ(y−1) (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)). Write u<Rv for u≤Rv with u≠v.

(2) Intervals, covers and bounded subsets. For u,v∈W define [u,v]R:={w∈W:u≤Rw and w≤Rv} and [u,v]L:={w∈W:u≤Lw and w≤Lv}; these are the right and left intervals. An element v covers u in ≤R, written u⋖Rv, when u<Rv and there is no w∈W with u<Rw<Rv; define u⋖Lv in the same way using ≤L. A subset A⊆W is bounded above in ≤R if there exists y∈W with a≤Ry for every a∈A, and bounded below if there exists y∈W with y≤Ra for every a∈A. Define upper and lower bounds in ≤L by replacing ≤R with ≤L.

(3) Meets and joins of subsets. Let A⊆W and z∈W. The element z is a right upper bound of A if a≤Rz for every a∈A; it is a right join (least upper bound) if it is a right upper bound and z≤Ry for every right upper bound y of A. Dually, z is a right lower bound if z≤Ra for every a∈A, and a right meet (greatest lower bound) if it is a right lower bound and u≤Rz for every right lower bound u of A. Define left upper and lower bounds, meets, and joins by replacing ≤R with ≤L. Whenever the relevant meet or join is unique, write it as ⋀A or ⋁A in the order under discussion; for A={u,v} write u∧v or u∨v. A meet or join, when it exists, is unique in either order: any two meets (respectively joins) bound one another, so antisymmetry gives equality. The partial-order property needed here is the recorded well-definedness justifier. This definition asserts no existence of meets or joins for any specified subset.

(4) Abstentions. This definition records ≤R,≤L and the interval and bound vocabulary; it asserts no further property. In particular, it does not assert that either relation is a partial order (Partial order and partially ordered set), that covers have the form v=us, that any meet or join exists, or that w↦N(w−1) computes ≤R by inclusion of inversion sets. No Choice is used.

Depends on

Used by

Dependency tree · two levels

45 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