Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 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 positive lift b_w is not a monoid homomorphism

Statement refuted

For every finite Coxeter matrix (S,m) with S≠∅, the positive lift b:W→A+, w↦bw, is a monoid homomorphism; that is, bubv=buv for all u,v∈W (and dually, γ∘b:W→A is a group homomorphism).

Facts & Assumptions

Given: The rank-one Coxeter matrix with S={s} and m(s,s)=1, the presented group W with its length function ℓ, and the constructions S∗, A+, A, γ, σs and the lift b of Artin monoid and Artin group presentations, and the canonical monoid-to-group map, Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares and The reduced positive section b_w, its length additivity, and the degree homomorphism.

[F1]

A braid pair requires two distinct letters s≠t, and A+ is the quotient of S∗ by the smallest congruence containing the braid pairs, with [u][v]=[uv] and σs=[s]. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

[F2]

bw depends only on w and not on the chosen reduced expression, b1=1A+=[ε], and π+(bw)=w. (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F3]

The monoid homomorphism L:A+→(N,+,0) satisfies L([s1⋯sk])=k, hence is additive with L(1A+)=0 and L(bw)=ℓ(w). (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F4]

The same assignment defines a group homomorphism deg⁡:A→Z with deg⁡(σs)=1 and deg⁡(γ(x))=L(x) for all x∈A+. (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F5]

bubv=buv holds if and only if ℓ(uv)=ℓ(u)+ℓ(v). (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F6]

A monoid homomorphism satisfies f(xy)=f(x)f(y) and f(e)=e′; a group homomorphism satisfies f(xy)=f(x)f(y) and preserves the identity. (Monoid homomorphism and group homomorphism)

Counterexample

1.1F1F3

The rank-one data: since a braid pair requires two distinct letters, the braid-pair set of ({s},m) is empty by [F1], so ≡+ is the diagonal and A+=S∗ is the free monoid on the single generator s, with elements [sk] for k≥0 and [si]=[sj] exactly when i=j, because L([sk])=k by [F3]. The relator set of W is {s2}, so W=⟨s∣s2=1⟩={1,s} with ℓ(1)=0 and ℓ(s)=1 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action).

2.1F2step 1.1

The positive lifts are b1=[ε] (the empty word is a reduced expression of 1 because ℓ(1)=0) and bs=[s]=σs (the one-letter word is a reduced expression of s because ℓ(s)=1), by the definition of b and step 1.1.

3.1F1F2F3F6step 2.1

But bsbs=[s][s]=[ss] by the product rule of [F1], while bs⋅s=bs2=b1=[ε] since s2=1 in W; the two are different elements of A+, because L([ss])=2≠0=L([ε]) by [F3]. Hence bsbs≠bs⋅s, so the assignment b is not a monoid homomorphism: it fails to preserve the product s⋅s=1.

4.1F3F4F6step 3.1

The same defect appears at the group level: (γ∘b)(s)2=γ([ss])=σs2 while (γ∘b)(s2)=γ([ε])=1A, and σs2≠1A because deg⁡(σs2)=2≠0=deg⁡(1A) by [F3] and [F4], a group homomorphism preserving the identity. Thus γ∘b is not a group homomorphism W→A.

4.2F1F3F5step 3.1

The failure is not an artefact of the rank-one computation: for every finite Coxeter matrix with S≠∅ and every s∈S, [ss] is the class of the word ss in A+(S,m), and its length satisfies L([ss])=2≠0=L([ε]) by [F3]; combined with s2=1 in W and ℓ(s)=1 (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action) this gives bsbs≠bs2 for the ambient monoid, and no parabolic reduction is needed. The general theorem records that bubv=buv holds exactly on the pairs with ℓ(uv)=ℓ(u)+ℓ(v) by [F5], so the refuted statement is obtained by dropping that length hypothesis.

5.1given∎

Scope and choice: this counterexample is a finite computation in the rank-one system plus the stated supplier clauses; it constructs no topological model, claims nothing about embeddings of A+ into A, and uses no choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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