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 be any finite-dimensional vector space over with a nondegenerate alternating form , and let . Call an invertible linear map symplectic when for all . For each , define the transvection . Every symplectic map is a finite composition of these transvections. The form on from Binary symplectic form is the application needed here. This is a choice-free finite-dimensional reduction.
Facts & Assumptions
Given: , is a finite-dimensional vector space over with , and is a nondegenerate alternating bilinear form.
Binary symplectic form: the coordinate form used in the application is nondegenerate, alternating, and symmetric.
Rank-nullity: : for a linear map between finite-dimensional vector spaces, dimension of domain equals rank plus nullity.
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis and Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis: finite-dimensional spaces have finite bases, and dimension is the size of a basis.
Linear map between vector spaces over the same field: a function between vector spaces is linear when it preserves finite linear combinations.
The principle of mathematical induction and The natural numbers (von Neumann): induction proves a statement for every natural number from a base case and a successor step.
Proof
For , the standard coordinate vectors form a basis of by coordinate expansion and coordinatewise independence, so . Let and let be a proper subspace of . Since is finite, choose a linearly independent subset maximal under inclusion; maximality makes it span , since any vector outside its span could be adjoined while preserving independence. If , its binary coefficient lists give distinct vectors by independence and exhaust by spanning, so . But and is proper, hence . Enumerate and define by . Each coordinate dot product is linear in , so is linear [F4]. Its domain and codomain have dimensions and by the coordinate-basis calculation. Its image is a finite subspace; a maximal independent subset spans it as above, and its distinct binary combinations lie among the vectors of , so its rank is at most . Thus rank-nullity [F2] gives . For nonzero , every basis vector satisfies , so linearity and spanning give for every . The functional is nonzero because its value on a coordinate vector with nonzero corresponding coordinate of is .
Alternation and bilinearity imply for all ; since subtraction equals addition in , is symmetric. For , is the identity. For any , alternation gives , so applying twice adds twice and returns . For , bilinearity gives Symmetry from the first sentence makes the last two terms the same product, which sums to zero in ; therefore preserves .
At , implies by [F3]. Its identity is the only symplectic map and is the empty composition of transvections.
These maps act transitively on nonzero vectors. If , no map is needed. If , then satisfies , hence . If and , then are independent over . Their pairing functionals are independent: a relation gives for every , so nondegeneracy gives , and independence gives . The map is linear by bilinearity. If its image were proper, step 1.1 would give a nonzero with for every . This would make a nontrivial linear combination of the pairing functionals zero, a contradiction. Thus is onto; choose with both pairings . By symmetry from step 1.2, , so and .
Fix with . If and both pair to with , then transvections fixing send to as follows. If , use the identity. If , the center lies in and . If and , the vectors are independent: pairing a relation with gives by symmetry from step 1.2; if , then , which would give either or , both impossible. Their pairing functionals are independent because a relation among them is the pairing with the corresponding linear combination of , which nondegeneracy forces to be zero. The map is linear by bilinearity. If its image were proper, step 1.1 would give a nonzero annihilating every value of , contradicting independence of the three pairing functionals. Hence is onto; choose with all three values . The centers and lie in , and ; both transvections fix .
Assume and the result for dimension . For the application , the nondegenerate alternating form hypotheses hold by [F1]; the following argument is for any such . Since , choose ; nondegeneracy gives with . Let be symplectic. By step 2.1, choose a finite product of transvections with , and set . The vector satisfies , so step 3.1 gives a finite product of transvections fixing and sending to . Thus is symplectic and fixes both and . Let . Bilinearity makes a subspace and , , linear by [F4]; it is onto because and , and its kernel is . Step 1.1 gives , so rank-nullity [F2] yields . For any , bilinearity and show that lies in , so every is a sum of an element of and an element of ; the intersection is zero since pairing with and gives . Thus . The restriction of to is nondegenerate: a vector in its radical is orthogonal to , hence to all of , and is zero. Since and fix and preserve , both map to itself, so is an invertible symplectic map. By the induction hypothesis, is a finite product of transvections centered in . Those same transvections fix in and agree with on , so their product is on . Since each transvection is its own inverse by step 1.2, is a finite product of transvections. All choices are finite-stage existential choices; the proof uses no choice principle.
Depends on
- Binary symplectic form
- Linear map between vector spaces over the same field
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- The principle of mathematical induction
- The natural numbers $\mathbb{N}$ (von Neumann)
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
- M. Hein et al., Entanglement in Graph States and Its Applications (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)