Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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 simple braids and divisibility lattice for b three

Example

Take n=3, so that B3+ has the two atoms σ1,σ2 and the half twist Δ=σ1σ2σ1 of length N=3. The example verifies:

  1. the six simple braids of B3 are 1, σ1, σ2, σ1σ2, σ2σ1, Δ, with the six distinct endpoint permutations id,(1 2),(2 3),(1 2 3),(1 3 2),(1 3);
  2. σ1∧Lσ2=1 while σ1∨Lσ2=σ1σ2σ1=Δ;
  3. for a:=σ1σ2 and b:=σ1 one has a∧Lb=σ1 but a∧Rb=1;
  4. consequently the left and the right divisibility orders on B3+ are different, even though by Simple positive braids are indexed by permutations the two orders have the same divisor set on Δ.

Facts & Assumptions

Given: The natural number 3, the monoid B3+ with atoms σ1,σ2, half twist Δ=σ1σ2σ1 of length 3, and the elements a=σ1σ2, b=σ1.

[F1]

B3+ is generated by the atoms, ℓ([w])=∣w∣ is additive and ℓ(x)=0 only for x=1; the orders are x≼Ly  ⟺  y=xc and x≼Ry  ⟺  y=cx for some c∈B3+, with length monotone, so a proper divisor of an atom or of 1 or 2 letters has strictly smaller length (Positive braid monoid, Positive artin relations preserve homogeneous length, Left and right divisibility for positive braids).

[F2]

Δ=σ1σ2σ1=σ2σ1σ2 by the braid relation, and the simple braids — the left divisors of Δ — are in bijection with S3: they are exactly id^=1, s1^=σ1, s2^=σ2, s1s2^=σ1σ2, s2s1^=σ2σ1, w0^=Δ (Simple positive braids are indexed by permutations, The Garside half twist and simple positive braids).

[F3]

The homomorphism π ⁣:B3+→S3 sends σi to si and products to products; s1=(1 2), s2=(2 3), s1s2=(1 2 3), s2s1=(1 3 2), s1s2s1=(1 3) in the composition convention of The symmetric group Sym⁡(X): the bijections of a set X under composition (Reduced adjacent-transposition words have well-defined positive lifts).

[F4]

For adjacent atoms, σ1∨Lσ2=σ1σ2σ1 is the least common left multiple and also the least common right multiple, and σ1∧Lσ2 exists and is unique; more generally every nonempty finite subset of B3+ has unique left and right gcds and lcms (Artin atoms have explicit left and right lcms and complements, Positive braids have left and right gcds and lcms).

Verification

technique · direct
1.1

The six simple braids and their permutations. By [F2] there are exactly 3!=6 simple braids. Applying [F3] to the six displayed elements gives the images id, s1=(1 2), s2=(2 3), s1s2=(1 2 3), s2s1=(1 3 2) and s1s2s1=(1 3) in this order; these are the six elements of S3, so they are pairwise distinct, and since π is a function the six braids 1,σ1,σ2,σ1σ2,σ2σ1,Δ are pairwise distinct and exhaust the left divisors of Δ. In particular σ1σ2 and σ2σ1 are proper simple braids, because σ1σ2⋅σ1=Δ and σ2σ1⋅σ2=Δ by [F2].

F2F3
1.2

The atom pair (σ1,σ2). The left divisors of σ1 are 1 and σ1, since a divisor d of σ1 has ℓ(d)≤1, so either d=1 or d is an atom equal to σ1; the same holds for σ2, and the distinct atoms are incomparable, so the common left divisors of σ1 and σ2 are just 1: thus σ1∧Lσ2=1. Their least common left multiple is σ1σ2σ1 by [F4], which is Δ by [F2], so σ1∨Lσ2=Δ.

F1F2F4
1.3

A pair with different left and right meets. For a=σ1σ2 and b=σ1: σ1 left-divides b trivially and left-divides a=σ1σ2, so σ1 is a common left divisor; every common left divisor d of a and b divides b=σ1, hence is 1 or σ1, so d≼Lσ1: therefore a∧Lb=σ1. On the right: the right divisors of b=σ1 are 1 and σ1 by [F1], while the right divisors of a=σ1σ2 are 1,σ2,σ1σ2 — indeed if a=dc then ℓ(c)≤2; for ℓ(c)=2 one has ℓ(d)=0, so d=1 and c=a; for ℓ(c)=1 the element c is an atom, and d then has length 1 and is an atom as well, so a must be a product of two atoms, the four candidates being σ1σ1,σ1σ2,σ2σ1,σ2σ2, which are distinct because every defining relation has length three; only σ1σ2=a occurs, so the only one-letter right divisor is c=σ2. Hence the common right divisors of a and b are {1,σ2,σ1σ2}∩{1,σ1}={1}, and a∧Rb=1.

F1F2F4
1.4

Conclusion. Steps 1.1--1.3 give the six simple braids, σ1∧Lσ2=1, σ1∨Lσ2=Δ, and the pair a,b with a∧Lb=σ1≠1=a∧Rb. So already on the four-element subfamily {1,σ1,σ2,σ1σ2} the two orders have different meets, even though on Δ itself the left and right divisor sets coincide by [F2]; the balancedness established in Delta is the lcm of the artin atoms and has the same left and right divisors is therefore a property of Δ and does not identify the two orders. No choice principle is used. ∎

step 1.1step 1.2step 1.3

Remarks

  • Reading the six permutations. In the convention of The symmetric group Sym⁡(X): the bijections of a set X under composition the product acts with the right factor first, so σ1σ2 maps to s1s2=(1 2 3) and σ2σ1 to the inverse cycle (1 3 2): the order of the two words is visible in the orientation of the 3-cycle, and this is what separates the two length-two simple braids.
  • Why the right meet is the smaller one here. The right divisors of σ1σ2 are its suffixes 1,σ2,σ1σ2, while those of σ1 are 1,σ1; the overlap is trivial even though the overlap of the corresponding prefix sets is {1,σ1}. This is the smallest instance of the asymmetry between the two orders.
  • No choice principle is used; all computations are finite word computations.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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