Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Every classical braid group is linear

Statement

Assume AC. For every n≥1 the representation ρLKB embeds Bn into GL(n2)(Λ), hence also into GL(n2)(Q(q,t)); therefore every classical braid group is linear.

Facts & Assumptions

Given: the braid group Bn, the ring Λ=Z[q±1,t±1] and its fraction field K=Q(q,t).

[F1]

The Lawrence-Krammer-Bigelow representation is faithful: ρLKB:Bn→GL(n2)(Λ) has trivial kernel.

[F2]

The integral LKB module is free of rank n choose two: the target is the full matrix group of the free Λ-module of rank (n2), and extension of scalars to K presents it as GL(n2)(K).

Proof

1.1F1F2

By [F1] the homomorphism ρLKB is injective, so Bn is isomorphic to a subgroup of the matrix group GL(n2)(Λ); this already exhibits a faithful finite-dimensional representation of Bn over the commutative ring Λ.

2.1F1F2algebra∎

Extending scalars along the inclusion Λ↪K gives a group homomorphism GL(n2)(Λ)→GL(n2)(K) which is injective, because its entries are the entries of the matrix and the inclusion Λ↪K is injective; the composite with ρLKB is therefore an injective homomorphism from Bn to GL(n2)(K). By [F2] the size (n2) is finite for every n, so Bn is a linear group. For n=1 the group B1 is trivial and therefore linear as well.

Depends on

Used by

Dependency tree · two levels

15 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