Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

The reduced positive section b_w, its length additivity, and the degree homomorphism

Statement

Let (S,m) be a finite Coxeter matrix, W the presented group with length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let S∗, A+, A, γ:A+→A, σs=[s] and π+:A+→W be as in Artin monoid and Artin group presentations, and the canonical monoid-to-group map and Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares.

(1) The positive lift. For w∈W choose a reduced expression w=s1⋯sk (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups) and put

bw:=σs1⋯σsk∈A+.

Then bw depends only on w, not on the chosen reduced expression; b1=1A+=[ε]; and π+(bw)=w.

(2) The set-section. The map b:W→A+, w↦bw, satisfies π+∘b=idW and π∘γ∘b=idW, hence b is injective and is a set-theoretic section of both π+ and the composite π∘γ:A+→W.

(3) The positive length. There is a unique monoid homomorphism

L:A+⟶(N,+,0),L(σs)=1;

explicitly L([s1⋯sk])=k, so L is well defined, L(xy)=L(x)+L(y) and L(1A+)=0. Consequently L(bw)=ℓ(w) for every w∈W. Moreover the same assignment defines a group homomorphism

deg⁡:A⟶Z,deg⁡(σs)=1,

and deg⁡(γ(x))=L(x) for all x∈A+.

(4) Multiplicativity. For all u,v∈W:

bubv=buv⟺ℓ(uv)=ℓ(u)+ℓ(v).

If ℓ(uv)<ℓ(u)+ℓ(v), then bubv≠buv, and indeed L(bubv)=ℓ(u)+ℓ(v)>ℓ(uv)=L(buv).

(5) Failure of multiplicativity. If S≠∅ then b is not a monoid homomorphism: for s∈S one has bsbs=[ss] and bs2=b1=[ε], and these differ because L([ss])=2≠0=L([ε]). Likewise γ∘b:W→A is not a group homomorphism.

(6) Scope. No injectivity of γ:A+→A or of π+:A+→W, no Ore or Garside condition, no embedding of A+ into A, and no topological statement is made or needed.

Facts & Assumptions

Given: A finite Coxeter matrix (S,m), the group W with its length function ℓ and reduced expressions, and the constructions S∗, A+, A, γ, σs and π+ of the two items named in the statement.

[F1]

On S∗ there is a smallest congruence ≡+ containing every braid pair, the classes satisfy [u][v]=[uv] and A+=S∗/ ⁣≡+ has identity [ε] and elements σs=[s]. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

[F2]

Every map f:S→G into a group whose values on the two words of every braid pair agree extends uniquely to a group homomorphism fˉ:A→G with fˉ(σs)=f(s). (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)

[F3]

Every map f:S→M into a monoid whose values on the two words of every braid pair agree extends uniquely to a monoid homomorphism fˉ:A+→M with fˉ(σs)=f(s). (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)

[F4]

The homomorphism π+:A+→W satisfies π+(σs)=s and π∘γ=π+. (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)

[F5]

N is a set containing 0 on which addition is defined. (The natural numbers N (von Neumann), Addition of natural numbers)

[F6]

Addition on N satisfies m+0=m and is associative. (Addition of natural numbers, Addition is associative)

[F7]

0 is a two-sided identity for addition on N. (Left identity for addition)

[F8]

(Z,+,⋅,0,1) with the operations of Arithmetic on the integers is a commutative ring in which every element has an additive inverse; in particular (Z,+,0) is an abelian group, and its element 1 is the multiplicative identity. The natural numbers embed in Z by an injective map preserving addition and multiplication, and 2≠0 in N (The natural numbers N (von Neumann)); hence the images of the distinct naturals 2 and 0 differ, and since 1+1 is the image of 2 while 0 is the image of 0, the element 2:=1+1 is nonzero in Z. (The integers form a commutative ring, Arithmetic on the integers, The naturals embed in the integers)

[F9]

γ:A+→A is the unique monoid homomorphism with γ(σs)=σs for all s∈S. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

Proof

1.1F1given

The product σs1⋯σsk is independent of the reduced expression: by Matsumoto's theorem (Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups (1)), any two reduced expressions of an element w∈W are connected by finitely many replacements of an alternating subword s t s⋯ of length m(s,t)<∞ by the other alternating subword t s t⋯, inside some context x ( ⋅ ) y. Such a subword pair is exactly a braid pair of Artin monoid and Artin group presentations, and the canonical monoid-to-group map (2), so by the congruence property of ≡+ the two full words are equivalent and their classes in A+ coincide; hence the product in A+ depends only on w. A reduced expression of w exists because ℓ(w) is a minimum over a nonempty set of word lengths (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

2.1F1F3F4F9step 1.1

The empty word is a reduced expression of 1 because ℓ(1)=0, so b1=[ε]=1A+ by [F1]. For the projection, [F4] gives π+(σs)=s and π∘γ=π+ while [F9] makes γ a monoid homomorphism, so for a reduced expression w=s1⋯sk one has π+(bw)=π+(σs1)⋯π+(σsk)=s1⋯sk=w, and composing with π∘γ=π+ gives π∘γ∘b=π+∘b=idW.

2.2F3F5F6F7step 1.1

The length map exists and is unique: apply the monoid universal property [F3] to M:=(N,+,0) and the constant map f(s):=1, which is legitimate because the two words of a braid pair both have length m(s,t), so their images under the word-length map agree; this gives a unique monoid homomorphism L:A+→(N,+,0) with L(σs)=1. For a word u=s1⋯sk one has L([u])=L(σs1⋯σsk)=1+⋯+1=k by additivity [F6] and L([ε])=0 [F7], so L is the word length on classes and in particular L(bw)=k=ℓ(w) for every w.

3.1F2F3F8step 2.2

The degree map exists: apply the group universal property [F2] to G:=(Z,+,0) of [F8] and the constant map f(s):=1, whose two values on a braid pair both equal m(s,t); this gives a group homomorphism deg⁡:A→Z with deg⁡(σs)=1. Then deg⁡∘γ and L are monoid homomorphisms A+→Z agreeing on every generator: deg⁡(γ(σs))=deg⁡(σs)=1=L(σs), so by the uniqueness in [F3] they agree on all of A+, that is, deg⁡(γ(x))=L(x) for every x∈A+.

3.2F4step 2.1

The map b is injective and a section: if bu=bv then u=π+(bu)=π+(bv)=v, and π+∘b=idW and π∘γ∘b=idW were proved in step 2.1; a map with a left inverse is injective, so b is a set-theoretic section of both maps.

3.3F1step 1.1step 2.2algebra

For the forward direction of (4), suppose ℓ(uv)=ℓ(u)+ℓ(v) and let u=s1⋯sp, v=t1⋯tq be reduced expressions. The concatenated word s1⋯spt1⋯tq represents uv and has length p+q=ℓ(u)+ℓ(v)=ℓ(uv), so it is a reduced expression of uv; hence by step 1.1, buv=σs1⋯σspσt1⋯σtq=bubv. Conversely, if bubv=buv, then applying the additive map L of step 2.2 gives ℓ(u)+ℓ(v)=L(bu)+L(bv)=L(bubv)=L(buv)=ℓ(uv). In particular, if ℓ(uv)<ℓ(u)+ℓ(v) then L(bubv)=ℓ(u)+ℓ(v)>ℓ(uv)=L(buv), so bubv≠buv.

4.1F1F8step 2.1step 2.2step 3.1algebra

If S≠∅, fix s∈S. By part 1 of Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action the sign character of W satisfies sgn⁡(s)=−1≠1=sgn⁡(1), so s≠1 in W; since s is a word of length 1 we have ℓ(s)≤1, while ℓ(s)≠0 because the empty word is the only word of length 0 and its value is 1 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so ℓ(s)=1. Hence the one-letter word s is a reduced expression and bs=[s] by step 1.1, while s2=1 in W with ℓ(1)=0 makes the empty word a reduced expression of s2, so bs2=b1=[ε] by step 2.1. Hence bsbs=[s][s]=[ss] by [F1], whereas L([ss])=2≠0=L([ε]) by step 2.2, so bsbs≠bs2 and b is not a monoid homomorphism. For the composite, (γ∘b)(s)2=γ([ss])=σs2 while (γ∘b)(s2)=γ([ε])=1A, and these differ because deg⁡(σs2)=2≠0=deg⁡(1A) by step 3.1, where 2=1+1≠0 in Z is the nontriviality recorded in [F8], and a group homomorphism preserves the identity (Monoid homomorphism and group homomorphism); so γ∘b is not a group homomorphism.

5.1given∎

Scope and choice: injectivity of γ and of π+, an Ore or Garside condition, an embedding of A+ into A and every topological statement are outside this result, and nothing here asserts them. No choice is used: bw is defined by the uniqueness proved in step 1.1, so it is a definite description rather than a selection among expressions, ≡+ is an intersection of a definable family of congruences, and all computations are finite.

Depends on

Used by

Dependency tree · two levels

68 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