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
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Applications of the Fundamental Group
- Approximation and Compactness in C(K)
- Asymptotic Cones and the Sublinear Triangle Criterion
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Braids as Fundamental Groups of Configuration Spaces
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Classification of Compact Connected Surfaces
- Classification of Covering Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Cup Cap Cross Products and Cohomology Rings
- Cw Complexes and Cellular Homology
- Derived Functors
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exactness and the Member Calculus
- Ext and Balanced Resolutions
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Garside Structure, Normal Forms, and the Center
- Geometric Braids and Artin Generators
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homology Axioms Degree and Classical Applications
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Kunneth Exactness and Splittings over Principal Ideal Domains
- Lawrence–Krammer–Bigelow Representations and Linearity
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Long Exact Sequences in Homology
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Orientations Poincare Lefschetz and Alexander Duality
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Plane Graphs, Euler's Formula and the Five Colour Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Projective and Injective Resolutions
- Properties of the Integral and the Working FTC
- Punctured Disks, Mapping Classes, and Point Pushing
- Rank Theorems and Embedded Submanifolds
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Relative Homology Excision and Mayer Vietoris
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Simply Connected Plane Domains: the Grand Equivalence
- Singular Chains and Singular Homology
- Singular Cohomology and Coefficient Theorems
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Products of Modules
- The Artin Action on a Free Group
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Diagram Lemmas in an Abelian Category
- The Exponential Function
- The Field of Fractions and Localisation
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Universal Coefficients and Kunneth Theorems
- Universal Properties, Representables and the Yoneda Lemma
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 and records the two generator matrices over ; direct multiplication checks the braid relation, exhibits the common half-twist matrix, and verifies that its square is the scalar . The fourth entry separates the existence of a linear representation from linearity in the sense of a faithful representation: for , the endpoint-permutation homomorphism is a linear representation of degree 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
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 .
Counterexample
Given: , , , and . A bracketed vertex list denotes its polygonal arc. Use the noodle the tine and parallel tine and handles 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 .
The tine crossings are and ; their parallel crossings are and . Their order along is . The handle–tine–noodle loops go clockwise around respectively and only , so ; the noodle–lower-boundary loop has . The explicit labelled-loop formula of The lexicographic order on fork-noodle deck monomials gives
Parametrize each segment of each track by equal time within its stage of , and merge their rational breakpoints. The difference path is nonzero and piecewise affine. Counting crossings of the ray in direction is exact rational arithmetic: on a segment from to solve and retain the solution only when and the real coordinate in that ray direction is positive. The sign is that of . For each returning pair the closed difference path has total count ; for each exchanged pair followed by has count . Thus the sign matrix following from . The four projected intersections are distinct and transverse, and their signed count is .
The four monomial-weighted terms instead give 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 misses 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.
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 for the polygonal arc through those vertices, oriented in that order, and set The noodle is Its union with the lower boundary arc encloses only . The fork tine and its right-hand parallel tine are The handles are They end at the indicated tine vertices. Each tree is embedded, meets the outer boundary only at its handle start, and meets only at . 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 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 , 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 , so each paired path stays in .
All intersections lie on . In increasing order along the tine points have heights and the parallel points have heights . Thus the combined order is . The loops that follow the handle and tine to and return to along have total puncture windings : the first clockwise loop encloses , while each of the other loops encloses only . The hairpin changes none of these windings. The clockwise loop followed by the lower boundary return has . The labelled-loop formula therefore gives
Here is an exact ray-crossing calculation of the mutual exponents, rather than an inference from their parities. Let be the difference of the two labelled tracks along . 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 : for consecutive difference vertices a crossing occurs when and have opposite signs and, at , . Its sign is positive when , negative in the reverse case. No difference vertex lies on this ray. If the labels return, this closed difference path has signed count , so . If they exchange, concatenate the difference path with its negative; the resulting closed path has signed count , so . Substitution of the listed vertices gives these counts for every pair. The returning case is exactly preceding along , yielding Together with step 1.1 this specifies every monomial .
The diagonal exponents are . Applying to step 2.1 gives The two exponent matrices and this sign matrix list all sixteen labelled contributions; no pair is omitted.
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 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.
The Krammer fraction-field generator matrices for B three
Example
For Krammer's fraction-field model of the The Lawrence-Krammer-Bigelow representation is a free module with basis over , on which the generators act by the seven-case formula
This example records the two resulting matrices over , checks the braid relation by direct multiplication, and checks the full-twist value at . 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 when , and the parameter translation between Krammer's and Bigelow's conventions is .
Verification
Given: the seven-case formula displayed above with (so ), the basis ordered as , and matrices acting on column vectors, the columns being the images of the basis vectors.
The columns for . Every case with is vacuous for . The case gives the first column ; the case applied to gives ; and the case for with gives . Hence
The columns for . For the case with gives ; the case with gives ; and the case gives . Hence
The braid relation by direct multiplication. Multiplying the two matrices gives Multiplying this product on the right by and on the left by gives, by expansion of the nine entries of each of the two products, 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 holds.
The full twist. The matrix has a single nonzero entry in each row and column, so squaring it multiplies the diagonal entries , , and kills all off-diagonal entries: which is the value of the full-twist scalar at . The columns of are exactly the values , , predicted by the half-twist identity of the source Section 3, .
Invertibility and conventions. Since is a unit of , both matrices lie in . The matrices above are those of Krammer's fraction-field model with basis , not matrices in Bigelow's integral closed-surface basis; the two models are isomorphic as -representations only after fraction-field extension for , and the translation between the parameters is , so the displayed formulas record Krammer's normalization and not Bigelow's.
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: , the classical braid group with its Artin presentation and generators (The braid group by Artin presentation), and a field .
The endpoint permutation. Since the transpositions satisfy and for , the assignment , , respects the Artin presentation and is a homomorphism. Composing it with the standard permutation representation gives a linear representation of degree over any field.
The kernel is nontrivial. The exponent-sum map , , is well defined because every Artin relator has equal total exponent on both sides; hence and in . The element is pure: its image under is . Therefore is a nontrivial element of , and a fortiori of ; for the kernel of the permutation representation is the nontrivial pure braid group.
Linear does not mean faithful. Thus for every the group admits the linear representation of degree with . Linearity of is therefore not witnessed by an arbitrary representation: the content of Every classical braid group is linear lies in the faithfulness of , not merely in the existence of a representation, and the claim stated above is refuted.