Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Symplectic transvections generate the binary symplectic group

Statement

Let V be any finite-dimensional vector space over F2 with a nondegenerate alternating form ω, and let dim⁡V=2n. Call an invertible linear map T:V→V symplectic when ω(Tu,Tw)=ω(u,w) for all u,w∈V. For each v∈V, define the transvection τv(w)=w+ω(w,v)v. Every symplectic map is a finite composition of these transvections. The form on Vn from Binary symplectic form is the application needed here. This is a choice-free finite-dimensional reduction.

Facts & Assumptions

Given: n∈N, V is a finite-dimensional vector space over F2 with dim⁡V=2n, and ω is a nondegenerate alternating bilinear form.

[F1]

Binary symplectic form: the coordinate form used in the application is nondegenerate, alternating, and symmetric.

[F2]

Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T: for a linear map between finite-dimensional vector spaces, dimension of domain equals rank plus nullity.

[F4]

Linear map between vector spaces over the same field: a function between vector spaces is linear when it preserves finite linear combinations.

[F5]

The principle of mathematical induction and The natural numbers N (von Neumann): induction proves a statement for every natural number from a base case and a successor step.

Proof

1.1F2F3F4algebrachooseconstruct

For s∈{0,1,2,3}, the standard coordinate vectors form a basis of F2s by coordinate expansion and coordinatewise independence, so dim⁡F2s=s. Let d∈{2,3} and let U be a proper subspace of F2d. Since U is finite, choose a linearly independent subset B⊆U maximal under inclusion; maximality makes it span U, since any vector outside its span could be adjoined while preserving independence. If r=∣B∣, its 2r binary coefficient lists give distinct vectors by independence and exhaust U by spanning, so ∣U∣=2r. But ∣F2d∣=2d and U is proper, hence r<d. Enumerate B=(q1,…,qr) and define AB:F2d→F2r by AB(α)=(α⋅q1,…,α⋅qr). Each coordinate dot product is linear in α, so AB is linear [F4]. Its domain and codomain have dimensions d and r by the coordinate-basis calculation. Its image is a finite subspace; a maximal independent subset spans it as above, and its 2rank⁡AB distinct binary combinations lie among the 2r vectors of F2r, so its rank is at most r. Thus rank-nullity [F2] gives dim⁡ker⁡AB=d−rank⁡AB≥d−r>0. For nonzero α∈ker⁡AB, every basis vector qi satisfies α⋅qi=0, so linearity and spanning give α⋅u=0 for every u∈U. The functional u↦α⋅u is nonzero because its value on a coordinate vector with nonzero corresponding coordinate of α is 1.

1.2givenalgebra

Alternation and bilinearity imply 0=ω(u+w,u+w)=ω(u,w)+ω(w,u) for all u,w; since subtraction equals addition in F2, ω is symmetric. For v=0, τv is the identity. For any v, alternation gives ω(v,v)=0, so applying τv twice adds ω(w,v)v twice and returns w. For u,w∈V, bilinearity gives ω(τvu,τvw)=ω(u,w)+ω(w,v)ω(u,v)+ω(u,v)ω(v,w). Symmetry from the first sentence makes the last two terms the same product, which sums to zero in F2; therefore τv preserves ω.

1.3givenF3base

At n=0, dim⁡V=0 implies V={0} by [F3]. Its identity is the only symplectic map and is the empty composition of transvections.

2.1givenstep 1.1step 1.2algebrachoose

These maps act transitively on nonzero vectors. If a=b, no map is needed. If ω(a,b)=1, then v=a+b satisfies ω(a,v)=1, hence τv(a)=b. If a≠b and ω(a,b)=0, then a,b are independent over F2. Their pairing functionals are independent: a relation rω(a,⋅)+sω(b,⋅)=0 gives ω(ra+sb,w)=0 for every w, so nondegeneracy gives ra+sb=0, and independence gives r=s=0. The map L(w)=(ω(a,w),ω(b,w)) is linear by bilinearity. If its image were proper, step 1.1 would give a nonzero α∈F22 with α⋅L(w)=0 for every w. This would make a nontrivial linear combination of the pairing functionals zero, a contradiction. Thus L is onto; choose c with both pairings 1. By symmetry from step 1.2, ω(c,b)=1, so τa+c(a)=c and τc+b(c)=b.

3.1givenstep 1.1step 1.2step 2.1algebrachoose

Fix e,f with ω(e,f)=1. If y and f both pair to 1 with e, then transvections fixing e send y to f as follows. If y=f, use the identity. If ω(y,f)=1, the center y+f lies in e⊥ and τy+f(y)=f. If y≠f and ω(y,f)=0, the vectors e,y,f are independent: pairing a relation re+sy+tf=0 with e gives s=t by symmetry from step 1.2; if s=t=1, then y+f=re, which would give either y=f or ω(y,f)=ω(f+re,f)=r=1, both impossible. Their pairing functionals are independent because a relation among them is the pairing with the corresponding linear combination of e,y,f, which nondegeneracy forces to be zero. The map L(w)=(ω(e,w),ω(y,w),ω(f,w)) is linear by bilinearity. If its image were proper, step 1.1 would give a nonzero α∈F23 annihilating every value of L, contradicting independence of the three pairing functionals. Hence L is onto; choose c with all three values 1. The centers y+c and c+f lie in e⊥, and τc+fτy+c(y)=f; both transvections fix e.

4.1givenF1F2F3F4F5step 1.1step 1.2step 2.1step 3.1step 1.3algebrachooseinductiondischarge-induction∎

Assume n≥1 and the result for dimension 2(n−1). For the application V=Vn, the nondegenerate alternating form hypotheses hold by [F1]; the following argument is for any such V. Since dim⁡V=2n>0, choose e≠0; nondegeneracy gives f with ω(e,f)=1. Let T0 be symplectic. By step 2.1, choose a finite product A of transvections with A(T0e)=e, and set T1=AT0. The vector y=T1f satisfies ω(e,y)=1, so step 3.1 gives a finite product B of transvections fixing e and sending y to f. Thus G=BT1 is symplectic and fixes both e and f. Let W={w:ω(w,e)=ω(w,f)=0}. Bilinearity makes W a subspace and Φ:V→F22, Φ(u)=(ω(u,f),ω(u,e)), linear by [F4]; it is onto because Φ(e)=(1,0) and Φ(f)=(0,1), and its kernel is W. Step 1.1 gives dim⁡F22=2, so rank-nullity [F2] yields dim⁡W=dim⁡V−2=2(n−1). For any u, bilinearity and ω(e,f)=1 show that w=u+ω(u,f)e+ω(u,e)f lies in W, so every u is a sum of an element of E={re+sf:r,s∈F2} and an element of W; the intersection is zero since pairing re+sf∈W with f and e gives r=s=0. Thus V=E⊕W. The restriction of ω to W is nondegenerate: a vector in its radical is orthogonal to W,e,f, hence to all of V, and is zero. Since G and G−1 fix e,f and preserve ω, both map W to itself, so G∣W is an invertible symplectic map. By the induction hypothesis, G∣W is a finite product of transvections centered in W. Those same transvections fix e,f in V and agree with G on W, so their product is G on V=E⊕W. Since each transvection is its own inverse by step 1.2, T0=A−1B−1G is a finite product of transvections. All choices are finite-stage existential choices; the proof uses no choice principle.

Depends on

Used by

Dependency tree · two levels

35 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