Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

A nontrivial five-strand braid lies in the Burau kernel

Statement

Assume AC, inherited from the topological definition of the Burau representations and from the reduced/unreduced same-kernel transfer. There exists a nontrivial element of B5 that acts trivially in the unreduced Burau representation ρ5mat of The unreduced Burau matrices. Explicitly, let α,β be the two embedded arcs on the five-punctured disk displayed in Figure 3 of the source, using the standard Artin labels fixed by its straightening words on p. 403, with α joining the marked points q2 and q4 and β joining the boundary basepoint p0 to the marked point q3, and put ψ:=[Tα,Tβ]=Tα−1Tβ−1TαTβ, the commutator of the clockwise half Dehn twist Tα about the boundary of a regular neighbourhood of α (whose induced permutation exchanges q2 and q4) with the full boundary-arc twist Tβ about the boundary of a regular neighbourhood of β∪∂D. Then ψ≠1 in B5 and ρ5mat(ψ)=I5. This is the explicit kernel element used by the counterexample on the companion page; it is not an instance of Δ2k. The boundary-arc twist uses the boundary-relative convention of Bigelow, Section 2; changing its representative by a central boundary full twist leaves this commutator unchanged.

Facts & Assumptions

Given: AC; the five-punctured disk (D,Δ5) with boundary basepoint p0; the oriented embedded arcs α,β of Bigelow's Figure 3; the half twist Tα and the full twist Tβ specified in the Statement; the commutator ψ=Tα−1Tβ−1TαTβ; and Λ1=Z[t±1].

[L1]

Write si=σi−1 for clockwise generators, since the positive geometric half twists of The elementary geometric half twist, its support disc, and its opposite are anticlockwise. Bigelow's printed p. 403 gives the words P=s3−1s2s12s2s43s3s2,Q=s4−1s3s2s1−2s2s12s22s1s45,R=s4s3s2s12s2s3s4. In the Figure 3 coordinates, P straightens α to the arc between q4,q5 and Q straightens β to the boundary arc ending at q5; hence its kernel witness is [P−1s4P,Q−1RQ]. We use these exact words to check the twist argument below, rather than assuming that the source's abbreviated digon check proves nontriviality.

[L2]

Put Si=ρ5mat(si)=Bi−1. Its nonidentity block is (01t−11−t−1). For a word V in the si±1, let M(V) be the ordered product of these blocks or their inverses. This is its unreduced Burau action (The unreduced Burau matrices, The unreduced Burau matrices satisfy the Artin relations).

[L3]

The Artin representation η:B5→Aut⁡(F5) is a homomorphism. In the clockwise convention its substitutions are η(si)(xi)=xi+1,η(si)(xi+1)=xi+1−1xixi+1; its inverse sends xi to xixi+1xi−1 and xi+1 to xi, fixing the other basis letters. Products compose with the rightmost letter first. Free reduction has unique normal forms (Artin automorphisms of the free group, The Artin representation on a free group, Reduced words form the free group on an alphabet). To prove that a braid is nontrivial it suffices that its image is nontrivial; no faithfulness theorem is needed.

[L4]

The topological reduced action is the action on H1(X~;Z) for the infinite cyclic cover of The Burau infinite cyclic cover. It agrees with the invariant reduced submodule of the matrix action, and the reduced and unreduced integral representations have the same kernel (The topological and matrix Burau representations agree, The reduced and unreduced Burau representations have the same kernel). A boundary full twist Δ2 acts on this homology by t5 (Bigelow, printed p. 400).

[L5]

Twists are boundary-fixed braid mapping classes, and twists supported on disjoint regular neighbourhoods commute (Boundary-fixed mapping class group of a punctured disk, The braid group by Artin presentation, The elementary geometric half twist, its support disc, and its opposite). Homotopic simple proper arcs are isotopic relative to their endpoints (Homotopic simple proper arcs in the punctured disk are isotopic relative to their endpoints); their geometric intersection number has the meaning in Curves and geometric intersection numbers on the marked disk. The half twist Tα exchanges q2,q4, so its induced permutation is an involution. The braid itself has infinite order: on the subgroup preserving these two punctures, forgetting the other strands sends its powers to powers of a generator of B2≅Z.

[L6]

For lifts of the oriented arcs to the cyclic cover, the lifted intersection polynomial is J(α,β)=∑k(tkα~,β~)tk, where the parentheses denote algebraic intersection. Changing lifts multiplies J by a power of t. Bigelow, Definition 1.3 and Section 3, records the crossing signs and all fifty terms; the exponents are determined by the total winding about punctures between crossings.

Proof

technique · direct
1.1L1L5

Fix the Figure 3 witness and the conventions. Set a=P−1s4P and b=Q−1RQ. The puncture permutation of P sends (1,2,3,4,5) to (1,5,2,4,3), and Q sends it to (2,1,5,4,3). Thus P−1s4P exchanges q2,q4 and Q−1RQ uses the boundary arc ending at q3. This fixes the Figure 3 labeling; The source's general arc criterion labels an arbitrary test arc's endpoints q1,q2; applying that criterion to these words requires a relabeling. By [L1] these are the source's half twist and boundary-arc twist; in particular ψ=[a,b] is the displayed geometric commutator. An ambiguity by a boundary full twist in b has no effect on [a,b], since a boundary twist is supported in a collar and each boundary-fixed mapping class has a representative that is the identity on a smaller collar, making the two supports disjoint. Every subsequent calculation uses si=σi−1, the source's clockwise convention, and ordinary left actions.

1.2L2algebra

The two block calculations. Let u0=−e4+t−1e5 and v0=e4∗−e5∗, so S4=I+u0v0. Multiplying the eight blocks of R gives M(R)=(t−10001−t−10t−1001−t−100t−101−t−1000t−11−t−1t−4−t−5t−3−t−4t−2−t−3t−1−t−21−t−1+t−5). Put u=M(P)−1u0 and v=v0M(P). The ten blocks of P give u=(t3−t2, t−2t2+2t3−t4+t5, t3−t2, −t2, t−1−1+t−t2)T, v=(t−2−t−3, −t−5+t−4−t−3, t−5−2t−4+2t−3−2t−2+t−1, t−4−t−3+2t−2−2t−1+1, t−3−t−2+t−1−1). Thus M(a)=I+uv. These computations use only the displayed two-by-two blocks; in particular they take place over the integral Laurent ring.

1.3L6algebra

The source's lifted intersection calculation. Normalize lifts so the first crossing along β contributes +t0. Upward crossings are positive and downward crossings negative. When successive crossing subarcs bound a disk containing k punctures, the exponent changes by k with the sign of the orientation around that disk. In the fifty-term calculation on Bigelow's printed p. 403, the positive terms at exponents −3,−2,−1,0,1,2,3,4,5 have respective multiplicities (1,2,3,4,5,4,3,2,1), and the negative terms have exactly the same multiplicities. Therefore every coefficient cancels and J(α,β)=0, independently of the choice of lifts. The explicit matrix calculation below verifies the resulting commuting twist action in the frozen convention.

2.1L2step 1.2algebra

The intersection cancellation in matrix coordinates. Put y=M(Q)u and z=vM(Q)−1. Multiplication by the sixteen blocks of Q gives the four scalar identities y5=0, y1+ty2+t2y3+t3y4=0, z5=0, and z1+z2+z3+z4=0. These can be checked without forming any full matrix: a positive letter si changes a column pair (ci,ci+1) to (ci+1,t−1ci+(1−t−1)ci+1) and a row pair (di,di+1) to (t−1di+1,di+(1−t−1)di+1); a negative letter uses the inverse pair operations. For columns apply the word from right to left, and for rows from left to right. With those four identities, the displayed matrix M(R) gives M(R)y=t−1y and zM(R)=t−1z: its fifth column pairs to zero with z, and its fifth row pairs to zero with y. Consequently M(b)u=t−1u and vM(b)=t−1v. Hence M(b)(I+uv)=M(b)+t−1uv=(I+uv)M(b), proving ρ5mat(ψ)=I5. This explicitly checks the boundary-arc case of the source's intersection/twist argument.

2.2L3step 1.1algebra

The geometric twists do not commute. Conjugate by P, so the two twists become s4 and w=PQ−1RQP−1. Compute their actions on x1 using [L3]. Successively applying P−1,Q,R,Q−1,P and then s4 gives freely reduced lengths 13,83,185,1993,14095,19199. The reduced word η(w)(x1) begins x5−1x3−1x5−1, while η(s4w)(x1) begins x5−1x4−1x5. The full substitutions and reductions, including the two different prefixes, are given by the finite certificate below. Since s4 fixes x1, η(ws4)(x1)=η(w)(x1); the two different reduced prefixes show η(s4w)≠η(ws4). Thus s4w≠ws4, and after conjugating back, ab≠ba and ψ≠1.

3.1L5step 2.2

Why Figure 3 has essential intersection. If α could be homotoped off β relative to endpoints, the proper-arc homotopy/isotopy identification in [L5] would allow disjoint representatives. Their regular neighbourhoods, including the boundary collar in the boundary-arc construction, could then be chosen disjoint, so their supported twists would commute. This contradicts step 2.2. Thus the Figure 3 arcs cannot be homotoped apart. This gives a local proof of the geometric conclusion, including the boundary-arc case, through their explicit actions rather than the source's abbreviated digon argument. The induced permutation of Tα is the involution in [L5], and the half twist itself is not an order-two braid.

4.1L4step 2.1step 2.2algebra∎

Conclusion and exclusion of boundary full twists. Steps 2.1 and 2.2 prove the claimed nontrivial kernel element. By [L4] its reduced action is also the identity. If ψ=Δ2k, that reduced action would be t5kI4, so t5k=1 in Z[t±1] and k=0; this contradicts ψ≠1. The statement retains AC through its topological suppliers; the explicit matrix and reduced-word computations are finite and require no choice.

Remarks

Here is the complete finite free-word certificate for step 2.2. A signed integer j denotes xj and −j denotes xj−1; signed braid integers refer to sj. The stack cancels adjacent inverse letters, and therefore returns the unique free-group reduced word. No truncation of an intermediate word occurs. The displayed assertions follow by these explicit substitutions.

P = [-3, 2, 1, 1, 2, 4, 4, 4, 3, 2]
Q = [-4, 3, 2, -1, -1, 2, 1, 1, 2, 2, 1, 4, 4, 4, 4, 4]
R = [4, 3, 2, 1, 1, 2, 3, 4]

def inverse(word):
    return [-j for j in reversed(word)]

def reduce(word):
    stack = []
    for j in word:
        if stack and stack[-1] == -j:
            stack.pop()
        else:
            stack.append(j)
    return stack

def substitute(word, braid_letter):
    i = abs(braid_letter)
    if braid_letter > 0:
        images = {i: [i+1], i+1: [-i-1, i, i+1]}
    else:
        images = {i: [i, i+1, -i], i+1: [i]}
    expanded = []
    for j in word:
        image = images.get(abs(j), [abs(j)])
        expanded.extend(image if j > 0 else inverse(image))
    return reduce(expanded)

def act(braid_word, word):
    for j in reversed(braid_word):
        word = substitute(word, j)
    return word

word = [1]
for factor, length in zip(
    [inverse(P), Q, R, inverse(Q), P], [13, 83, 185, 1993, 14095]
):
    word = act(factor, word)
    assert len(word) == length
assert word[:3] == [-5, -3, -5]
other = act([4], word)
assert len(other) == 19199 and other[:3] == [-5, -4, 5]
assert act([4], [1]) == [1]

Depends on

Used by

Dependency tree · two levels

83 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