Alphabeta Math
Pipeline-generated
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.

Lawrence–Krammer–Bigelow Representations and Linearity — Examples

1 · Prerequisites

2 · Summary

These four worked entries make the companion page's constructions concrete. The first two examine the fork–noodle pairing of Forks, noodles and the LKB intersection pairing on explicit configurations in the three-punctured disk: one example lists every intersection point, sign, deck monomial and cancellation and assembles the Laurent polynomial, while a counterexample exhibits a configuration whose ordinary algebraic intersection number vanishes even though the LKB pairing does not, showing that the deck monomials, not the bare count of crossings, carry the information. The third entry restricts Krammer's seven-case formula to B3 and records the two 3×3 generator matrices over Z[q±1,t±1]; direct multiplication checks the braid relation, exhibits the common half-twist matrix, and verifies that its square is the scalar q6t2. The fourth entry separates the existence of a linear representation from linearity in the sense of a faithful representation: for n≥2, the endpoint-permutation homomorphism Bn→Sn is a linear representation of degree n over any field whose kernel is the nontrivial pure braid group, so the content of the linearity theorem is the faithfulness proved by Lawrence–Krammer–Bigelow, not the mere existence of some representation.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Ordinary intersection number alone does not give the LKB pairing

Statement refuted

The LKB fork–noodle polynomial is determined by the ordinary total algebraic intersection number of the projected surfaces in C.

Counterexample

Given: p1=(−0.4,0), p2=(0,0), p3=(0.4,0), d1=(−0.8,−0.6) and d2=(0.8,−0.6). A bracketed vertex list denotes its polygonal arc. Use the noodle N=[d1,(0.2,−0.3),(0.2,0.3),(0.7,0.3),(0.7,−0.3),d2], the tine and parallel tine T=[p1,(−0.3,0.1),(0.5,0.1),(0.5,−0.15),(−0.1,−0.15),p2],T′=[p1,(−0.3,0.08),(−0.28,0.08),(0.48,0.08),(0.48,−0.13),(−0.08,−0.13),p2], and handles H=[d1,(−0.3,−0.3),(−0.3,0.1)],H′=[d2,(−0.28,−0.35),(−0.28,0.08)]. These give embedded forks with disjoint tine interiors and the standard parallel-copy orientation of Forks, noodles and the LKB intersection pairing. Each handle stays on the right of its oriented tine. The noodle and lower boundary arc enclose only p3.

1.1givenconstructalgebra

The tine crossings are z1=(15,−320) and z2=(15,110); their parallel crossings are z1′=(15,−13100) and z2′=(15,225). Their order along N is z1,z1′,z2′,z2. The handle–tine–noodle loops ξ1,ξ2 go clockwise around respectively p2,p3 and only p2, so (a1,a2)=(−2,−1); the noodle–lower-boundary loop has A0=−1. The explicit labelled-loop formula of The lexicographic order on fork-noodle deck monomials gives (ai,j)=(−5−4−4−3).

2.1givenstep 1.1constructalgebra

Parametrize each segment of each track by equal time within its stage of δi,j, and merge their rational breakpoints. The difference path D is nonzero and piecewise affine. Counting crossings of the ray in direction 1+i/10 is exact rational arithmetic: on a segment from (x,y) to (X,Y) solve y+u(Y−y)=(x+u(X−x))/10 and retain the solution only when 0<u<1 and the real coordinate in that ray direction is positive. The sign is that of (Y−X/10)−(y−x/10). For each returning pair the closed difference path has total count −1; for each exchanged pair D followed by −D has count −1. Thus (bi,j)=(−2−2−1−1),(ϵi,j)=(−11−11), the sign matrix following from ϵi,j=−(−1)bi,i+bj,j+bi,j. The four projected intersections are distinct and transverse, and their signed count is −1+1−1+1=0.

3.1step 1.1step 2.1algebra∎

The four monomial-weighted terms instead give ⟨N,F⟩=−q−5t−2+q−4t−2−q−4t−1+q−3t−1=q−5t−2(q−1)(1+qt)≠0. The four exponent vectors are distinct, so this Laurent polynomial is nonzero without any specialization. For comparison, a fork tine placed to the left of x=15 misses N and has both ordinary count and pairing zero. The two configurations have the same ordinary count, zero, and different LKB values. Hence the proposed determination by ordinary intersection number alone fails.

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

A fork-noodle pairing computation

Example

We compute a fork–noodle polynomial with four tine crossings and actual cancellation, using Forks, noodles and the LKB intersection pairing and The lexicographic order on fork-noodle deck monomials. All coordinates below are exact terminating decimals. Write [v0,…,vr] for the polygonal arc through those vertices, oriented in that order, and set p1=(−0.4,0),p2=(0,0),p3=(0.4,0),d1=(−0.8,−0.6),d2=(0.8,−0.6). The noodle is N=[d1,(0.2,−0.3),(0.2,0.3),(0.7,0.3),(0.7,−0.3),d2]. Its union with the lower boundary arc encloses only p3. The fork tine and its right-hand parallel tine are T=[p1,(−0.3,0.1),(0.25,0.1),(0.25,0.07),(0.15,0.07),(0.15,0.04),(0.3,0.04),(0.3,0.1),(0.5,0.1),(0.5,−0.15),(−0.1,−0.15),p2], T′=[p1,(−0.3,0.095),(−0.28,0.095),(0.245,0.095),(0.245,0.075),(0.145,0.075),(0.145,0.035),(0.305,0.035),(0.305,0.095),(0.495,0.095),(0.495,−0.145),(−0.095,−0.145),p2]. The handles are H=[d1,(−0.3,−0.3),(−0.3,0.1)],H′=[d2,(−0.28,−0.35),(−0.28,0.095)]. They end at the indicated tine vertices. Each tree is embedded, meets the outer boundary only at its handle start, and meets P only at p1,p2. The tine interiors are disjoint. Their orientations put their respective handles to the right. The narrow parallel strips and the handle strip give the parallel-copy convention of Bigelow 2001 Figure 1; the handles need not avoid the other tree's tine. The extra hairpin near (0.2,0.07) lies in a puncture-free rectangle and adds two removable crossings.

Verification

Given: the exact polygonal configuration above. In each of the three stages defining δi,j, give each segment of each mobile track equal time within that track; this supplies explicit continuous parametrizations. The handles are disjoint, the tine interiors are disjoint, and the returns run to opposite ends of N, so each paired path stays in C.

1.1givenconstructalgebra

All intersections lie on x=15. In increasing order along N the tine points have heights (−320,125,7100,110) and the parallel points have heights (−29200,7200,340,19200). Thus the combined order is z1,z1′,z2′,z2,z3,z3′,z4′,z4. The loops ξi that follow the handle and tine to zi and return to d1 along N have total puncture windings (−2,−1,−1,−1): the first clockwise loop encloses p2,p3, while each of the other loops encloses only p2. The hairpin changes none of these windings. The clockwise loop N followed by the lower boundary return has A0=−1. The labelled-loop formula ai,j=ai+aj+A0 therefore gives (ai,j)=(−5−4−4−4−4−3−3−3−4−3−3−3−4−3−3−3).

2.1givenstep 1.1constructalgebra

Here is an exact ray-crossing calculation of the mutual exponents, rather than an inference from their parities. Let Di,j be the difference of the two labelled tracks along δi,j. Merge the rational segment-time breakpoints of the two tracks; the resulting difference is piecewise affine with rational vertices and never zero. Count signed crossings of the ray in direction 1+i/10: for consecutive difference vertices (x,y),(X,Y) a crossing occurs when g=y−x/10 and G=Y−X/10 have opposite signs and, at u=−g/(G−g), x+u(X−x)+(y+u(Y−y))/10>0. Its sign is positive when g<0<G, negative in the reverse case. No difference vertex lies on this ray. If the labels return, this closed difference path has signed count −1, so b=2(−1)=−2. If they exchange, concatenate the difference path with its negative; the resulting closed path has signed count −1, so b=−1. Substitution of the listed vertices gives these counts for every pair. The returning case is exactly zi preceding zj′ along N, yielding (bi,j)=(−2−2−2−2−1−1−2−2−1−1−2−2−1−1−1−1). Together with step 1.1 this specifies every monomial mi,j=qai,jtbi,j.

3.1step 1.1step 2.1algebra

The diagonal exponents are (−2,−1,−2,−1). Applying ϵi,j=−(−1)bi,i+bj,j+bi,j to step 2.1 gives (ϵi,j)=(−11−11−111−11−1−11−11−11). The two exponent matrices and this sign matrix list all sixteen labelled contributions; no pair is omitted.

4.1step 1.1step 2.1step 3.1algebra∎

Rows two and three of the signed monomial table cancel entry by entry. In row one, columns two and three cancel; in row four, columns three and four cancel. The four remaining terms give ⟨N,F⟩=−q−5t−2+q−4t−2−q−4t−1+q−3t−1=q−5t−2(q−1)(1+qt)≠0. Thus geometrically distinct terms really do cancel, although the collected polynomial is nonzero. The sum of the sixteen signs is zero, so the ordinary algebraic intersection number of the projected surfaces vanishes. The deck-labelled polynomial retains information lost by this unweighted count.

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Krammer fraction-field generator matrices for B three

Example

For n=3 Krammer's fraction-field model of the The Lawrence-Krammer-Bigelow representation is a free module with basis x12,x13,x23 over Λ=Z[q±1,t±1], on which the generators act by the seven-case formula σkxk,k+1=tq2xk,k+1;σkxik=(1−q)xik+qxi,k+1 (i<k); σkxi,k+1=xik+tqk−i+1(q−1)xk,k+1 (i<k); σkxkj=tq(q−1)xk,k+1+qxk+1,j (k+1<j); σkxk+1,j=xkj+(1−q)xk+1,j (k+1<j); σkxij=xij (i<j<k or k+1<i<j);σkxij=xij+tqk−i(q−1)2xk,k+1 (i<k<k+1<j).

This example records the two resulting 3×3 matrices over Λ, checks the braid relation by direct multiplication, and checks the full-twist value q2nt2=q6t2 at n=3. The model is a fraction-field model: by The integral LKB module is free of rank n choose two it is not integrally identified with the closed-surface basis {vi,j} when n≥3, and the parameter translation between Krammer's and Bigelow's conventions is tKrammer=−tBigelow.

Verification

Given: the seven-case formula displayed above with n=3 (so k∈{1,2}), the basis ordered as (x12,x13,x23), and matrices acting on column vectors, the columns being the images of the basis vectors.

1.1givenalgebra

The columns for σ1. Every case with i<k is vacuous for k=1. The case σ1x1,2=tq2x1,2 gives the first column (tq2,0,0); the case k+1<j applied to (k,j)=(1,3) gives σ1x1,3=tq(q−1)x1,2+qx2,3; and the case for xk+1,j with (k+1,j)=(2,3) gives σ1x2,3=x1,3+(1−q)x2,3. Hence M1=(tq2tq(q−1)00010q1−q).

1.2givenalgebra

The columns for σ2. For k=2 the case i<k with i=1 gives σ2x1,2=(1−q)x1,2+qx1,3; the case xi,k+1 with i=1 gives σ2x1,3=x1,2+tq2(q−1)x2,3; and the case xk,k+1 gives σ2x2,3=tq2x2,3. Hence M2=(1−q10q000tq2(q−1)tq2).

2.1step 1.1step 1.2algebra

The braid relation by direct multiplication. Multiplying the two matrices gives M1M2=(0tq200tq2(q−1)tq2q2−q2t(q−1)2−q2t(q−1)). Multiplying this product on the right by M1 and on the left by M2 gives, by expansion of the nine entries of each of the two products, M1M2M1=M2M1M2=(00tq20tq30tq400)=:Δ. Each entry of the two triple products is a sum of at most three Laurent monomials; collecting the terms in each of the nine positions gives the displayed common value, so the braid relation ρ(σ1)ρ(σ2)ρ(σ1)=ρ(σ2)ρ(σ1)ρ(σ2) holds.

3.1step 2.1algebra

The full twist. The matrix Δ has a single nonzero entry in each row and column, so squaring it multiplies the diagonal entries tq2⋅tq4=t2q6, (tq3)2=t2q6, tq4⋅tq2=t2q6 and kills all off-diagonal entries: (ρ(σ1)ρ(σ2)ρ(σ1))2=Δ2=q6t2I3, which is the value q2nt2 of the full-twist scalar at n=3. The columns of Δ are exactly the values Δx2,3=tq2x1,2, Δx1,3=tq3x1,3, Δx1,2=tq4x2,3 predicted by the half-twist identity of the source Section 3, Δxn+1−j,n+1−i=tqi+j−1xij.

4.1step 2.1step 3.1algebra∎

Invertibility and conventions. Since det⁡M1=det⁡M2=−q3t is a unit of Λ, both matrices lie in GL3(Λ). The matrices above are those of Krammer's fraction-field model with basis x12,x13,x23, not matrices in Bigelow's integral closed-surface basis; the two models are isomorphic as Bn-representations only after fraction-field extension for n≥3, and the translation between the parameters is tKrammer=−tBigelow, so the displayed formulas record Krammer's normalization and not Bigelow's.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

A linear representation need not be faithful

Statement refuted

Exhibiting a finite-dimensional linear representation of a group already exhibits a faithful one.

Counterexample

Given: n≥2, the classical braid group Bn with its Artin presentation and generators σ1,…,σn−1 (The braid group by Artin presentation), and a field F.

1.1givenconstruct

The endpoint permutation. Since the transpositions si=(i i+1)∈Sn satisfy sisi+1si=si+1sisi+1 and sisj=sjsi for ∣i−j∣>1, the assignment π:Bn→Sn, π(σi)=si, respects the Artin presentation and is a homomorphism. Composing it with the standard permutation representation Sn→GLn(F) gives a linear representation πF:Bn⟶GLn(F) of degree n over any field.

2.1givenstep 1.1algebra

The kernel is nontrivial. The exponent-sum map ε:Bn→Z, ε(σi)=1, is well defined because every Artin relator has equal total exponent on both sides; hence ε(σ12)=2≠0 and σ12≠1 in Bn. The element σ12 is pure: its image under π is s12=1. Therefore σ12 is a nontrivial element of ker⁡π, and a fortiori of ker⁡πF; for n≥2 the kernel of the permutation representation is the nontrivial pure braid group.

3.1step 2.1algebra∎

Linear does not mean faithful. Thus for every n≥2 the group Bn admits the linear representation πF of degree n with ker⁡πF≠1. Linearity of Bn is therefore not witnessed by an arbitrary representation: the content of Every classical braid group is linear lies in the faithfulness of ρLKB, not merely in the existence of a representation, and the claim stated above is refuted.

Sources