Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Visible Artin relations alone do not prove presentation completeness

Statement refuted

Assume AC. The inference

the relations of a presentation hold in a group G and the images of its generators generate G, hence the presentation presents G

is invalid. For the presented group P=⟨x∣x4=1⟩ and G=⟨g∣g2=1⟩, the assignment x↦g kills the defining relator, because g4=1 in G, and g generates G, so it induces a surjective homomorphism φ ⁣:P→G; but φ is not injective, because x2 maps to 1 while x2≠1 in P. Consequently the published verification that the Artin relations hold among the geometric half twists and that the σi generate the geometric braid group — which through Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group yields only the surjection φ of The Artin presentation surjects onto the geometric braid group — cannot by itself prove that the Artin presentation presents the geometric braid group; the missing obligation is exactly the triviality of ker⁡φ, supplied by the combing kernel argument of The Artin presentation is complete for geometric braids.

Facts & Assumptions

Given: AC, the presented groups P=⟨x∣x4=1⟩ and G=⟨g∣g2=1⟩ with their generator classes x∈P and g∈G, the additive groups Z/2 and Z/4 of The congruence class [a]n and the quotient set Z/n, and the surjection φn of The Artin presentation surjects onto the geometric braid group for the Artin presentation of The braid group by Artin presentation.

[F1]

Von Dyck (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group): for a presentation ⟨X∣R⟩, a group H and a function u ⁣:X→H whose evaluation sends every r∈R to eH, there is a unique homomorphism u‾ ⁣:⟨X∣R⟩→H with u‾([x])=u(x), and u‾ is surjective exactly when u(X) generates H.

[F2]

G=⟨g∣g2=1⟩ is the quotient of the free group on {g} by the normal closure of g2 (Group presentation by generators and relations), so the relator is the identity, g2=1G; consequently g4=(g2)2=1G and g−1=g, and every element of G is a power gk with k∈{0,1}. Hence G has at most two elements, and the class g generates G.

[F3]

P=⟨x∣x4=1⟩ is the quotient of the free group on {x} by the normal closure of x4 (Group presentation by generators and relations), so x4=1P; consequently x−1=x3 and every element of P is a power xk with k∈{0,1,2,3}, so P has at most four elements.

[F4]

For every n∈N, (Z/n,+,[0]n) is an abelian group with [a]n+[b]n=[a+b]n and −[a]n=[−a]n (For every natural n, (Z/n,+) is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold, Addition and multiplication on Z/n by [a]n+[b]n=[a+b]n and [a]n[b]n=[ab]n, The congruence class [a]n and the quotient set Z/n); in particular [1]44=[4]4=[0]4, [1]42=[2]4, and in Z/4 one has [2]4≠[0]4 because 0 and 2 are the unique representatives in {0,1,2,3} of their respective classes (For n≥1, every class in Z/n has one representative r with 0≤r<n, so ∣Z/n∣=n; while Z/0 is in bijection with Z), while in Z/2 the classes [1]2 and [0]2 are distinct for the same reason.

[F5]

The proposition The Artin presentation surjects onto the geometric braid group verifies that the relators of the Artin presentation evaluate to the identity in the geometric braid group Gn when the abstract generator σi is sent to the class of the elementary half twist, that these classes generate Gn, and that von Dyck therefore produces a unique surjective homomorphism φn ⁣:BnArtin→Gn; the proposition asserts only surjectivity, and no injectivity of φn is available from that route.

[F6]

Under AC the completeness theorem The Artin presentation is complete for geometric braids proves, by the combing kernel argument, that φn is injective for every n≥1; AC is needed because its combing suppliers use the choice-dependent Fadell–Neuwirth fibrations (The Axiom of Choice, AC implies DC implies countable choice).

Counterexample

technique · counterexample
1.1F1F2F3

The assignment x↦g induces a surjection of P onto G. By [F2] one has g2=1G, hence g4=(g2)2=1G; the evaluation of the single defining relator x4 of P under the function u(x):=g is therefore g4=1G, so [F1] provides a unique homomorphism φ ⁣:P→G with φ(x)=g. Its image contains g, and g generates G by [F2], so φ is surjective by the surjectivity criterion of [F1].

1.2F1F3F4

x2 is nontrivial in P. The evaluation of the relator x4 under the function u′(x):=[1]4 is [1]44=[4]4=[0]4 by [F4], so [F1] provides a homomorphism ψ ⁣:P→Z/4 with ψ(x)=[1]4. Then ψ(x2)=[1]42=[2]4≠[0]4=ψ(1P) by [F4], because a homomorphism carries the identity to the identity; hence x2≠1P in P.

2.1F1F2F3F4step 1.1step 1.2

The surjection is not injective and the groups are not isomorphic. By step 1.1, φ(x2)=φ(x)2=g2=1G using [F2], while x2≠1P by step 1.2, so the nontrivial element x2 lies in ker⁡φ and φ is not injective. In fact the two groups have different sizes: by [F3] every element of P is one of x0,x1,x2,x3, and ψ from step 1.2 is surjective onto the four-element group Z/4 by [F4] and the criterion of [F1], so P has exactly four elements; by [F2] every element of G is 1G or g, and the function v(g):=[1]2 evaluates the relator g2 to [2]2=[0]2, so [F1] yields a homomorphism G→Z/2 with g↦[1]2≠[0]2, whence g≠1G and G has exactly two elements. Since 4≠2, no bijection and hence no group isomorphism P→G exists: the presentation ⟨x∣x4=1⟩ does not present G, even though its defining relator holds in G and the image of its generator generates G. This refutes the inference under examination.

3.1F1F5F6step 2.1

The braid application. For the Artin presentation, [F5] verifies exactly the two hypotheses of the refuted inference — the Artin relators evaluate to the identity among the geometric half-twist classes, and these classes generate Gn — and von Dyck yields precisely the surjection φn, with no injectivity. The counterexample of step 2.1 shows that this pattern of hypotheses does not in general force the von Dyck map to be an isomorphism, so the published surjectivity argument alone cannot establish that the Artin presentation presents the geometric braid group. What it leaves open is the triviality of ker⁡φn; the combing kernel argument of [F6] supplies exactly that missing obligation, under AC.

4.1F5F6step 2.1step 3.1

Conclusion. The counterexample P→G refutes the general inference, and the parallel von Dyck pattern of the Artin surjection shows that the geometric completeness statement needs the separate kernel computation of [F6]; the counterexample's own arithmetic is choice-free, while AC is carried only because the completeness supplier it contrasts with is AC-dependent. ∎

Remarks

  • The two von Dyck constructions in steps 1.1 and 1.2 use the same presentation P with two different targets: the relator x4 dies in Z/2 as [4]2=[0]2 and in Z/4 as [4]4=[0]4, but the target Z/4 separates x2 from the identity. This is the mechanism by which a surjection out of a presented group fails to be injective.
  • The example is deliberately small: the point is not that Z/2 and Z/4 are hard, but that surjectivity plus verification of the relators is a strictly weaker conclusion than presentation completeness, which is what the combing argument of The Artin presentation is complete for geometric braids adds in the braid case.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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