Alphabeta Math
RemarkRemark: 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.

Garside divisibility and lcm assertions for A+

PDF p. 22: Remark 5.7, first paragraph

Statement

Let Γ be a spherical Coxeter diagram, meaning that its Coxeter group W is finite, with vertex set Γ0. Let A+ be the submonoid of the associated Artin–Tits group A generated by its standard generators. Then A+ is a Garside monoid and every pair of its elements has a greatest common divisor and a least common multiple for each of left and right divisibility.

In particular, let J⊆Γ0 and let I be an associate of J: thus I⊆Γ0 and the standard parabolic subgroups WI and WJ are conjugate in W. For a,b∈Ic=Γ0∖I, the positive elementary ribbon elements μa,I,μb,I∈A+ have a left-divisibility least common multiple μa,I∨μb,I in A+.

Proof

[F1] For a spherical Artin system, the positive submonoid A+ is a Garside monoid and its left and right divisibility orders have gcds and lcms for every pair. (Independent spherical Artin Garside input)

[F2] For every I⊆Γ0 and a∈Ic, the elementary ribbon μa,I belongs to A+. (Positive elementary ribbon elements)

[F3] In a monoid, x left-divides y when y=xz for some monoid element z; right divisibility reverses the side of the factor. A gcd is a greatest common divisor and an lcm a least common multiple in the relevant divisibility order. The Garside interface uses these divisibility orders as lattices. (Categorical Garside structures and simple arrows)

[F4] The Coxeter diagram, its group W and its indexed simple generators S={si:i∈Γ0} are supplied by Coxeter-system, roots, length and weak-order conventions. For finite S, Artin–Tits group, pure subgroup and positive lifts supplies the associated Artin–Tits group A and its standard generators through a fixed isomorphism from the presented Artin group. The positive submonoid generated by these generators is the A+ of Positive Artin and parabolic monoids.

Given: A spherical Coxeter diagram and its positive Artin submonoid A+; for the final assertion, an associate I of J and a,b∈Ic.

Goal: Establish the Garside and divisibility assertions and the existence of the displayed left lcm.

1.1givenF1F3F4

Since W is finite and its distinct simple generators form a subset S⊆W, the Coxeter system has finite rank. Thus the finite-rank Artin group and standard generators in F4 apply, and their generated positive submonoid is exactly the A+ in the statement. The spherical hypothesis therefore makes F1 applicable to this submonoid. Hence A+ has the stated Garside structure, and both divisibility orders have a greatest lower bound and a least upper bound for every pair; by F3 these are the respective gcd and lcm.

2.1givenF2step 1.1∎

An associate I is a subset of Γ0, so F2 applies separately to a and b: both ribbon elements lie in A+. Applying the left-divisibility lcm assertion from step 1.1 to this pair gives μa,I∨μb,I∈A+, as claimed.

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