AFTD Auto-Formalizing Theoretical Domains

symB

defimported Lean

$\omega$ packaged as a LinearMap.BilinForm.

Statement

open scoped BigOperators in
set_option linter.mathlibStandardSet false in
open scoped BigOperators in
open scoped Real in
open scoped Nat in
open Classical in
open scoped Pointwise in
set_option maxRecDepth 4000 in
set_option synthInstance.maxHeartbeats 20000 in
set_option synthInstance.maxSize 128 in
set_option relaxedAutoImplicit false in
set_option autoImplicit false in
set_option linter.unnecessarySimpa false in
variable {n : ℕ} {p : ℕ} [Fact p.Prime] in
noncomputable def symB : LinearMap.BilinForm (F p) (V n p)
Defined in
TCSlib, `symB`
Lean proof
By Allan Li, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
none listed
Built on 7
  • sym_form_smul_leftAdditivity of the symplectic form in the first argument. Let $p$ be prime and work over the space $V = \bbf_p^n \times \bbf_p^n$ equipped…
  • sym_formFor $u = (x,z), v = (x',z') \in V = \mathbb{F}_p^n \times \mathbb{F}_p^n$, \[ \omega(u,v) \;=\; \sum_{i=0}^{n-1}(x_i z'_i - z_i x'_i). \]
  • sym_form_add_leftAdditivity of the symplectic form in the first argument. Let $p$ be prime and work over the space $V = \bbf_p^n \times \bbf_p^n$ equipped…
  • VThe ambient space $V = \mathbb{F}_p^n \times \mathbb{F}_p^n$ of pairs of coordinate vectors.
  • sym_form_add_rightAdditivity of the symplectic form in the first argument. Let $p$ be prime and work over the space $V = \bbf_p^n \times \bbf_p^n$ equipped…
  • sym_form_smul_rightAdditivity of the symplectic form in the first argument. Let $p$ be prime and work over the space $V = \bbf_p^n \times \bbf_p^n$ equipped…
  • FThe prime field $\mathrm{GF}(p)$, realized as $\mathbb{Z}/p\mathbb{Z}$ via ZMod.
Used by 8
  • sym_orthFor a submodule $S \le V$, $S^{\perp_\omega} = \{v \in V \mid \forall s \in S,\; \omega(v,s) = 0\}$.
  • symB_nondegenerateNon-degeneracy of the standard symplectic form. Fix a prime $p$ and an integer $n$, and let $V = \bbf_p^n \times \bbf_p^n$ carry the…
  • finrank_sym_orthDimension of the symplectic orthogonal complement. Let $p$ be a prime and equip the $2n$-dimensional space…
  • orth_inter_eq_orth_sub_imageOrthogonal complement of a subspace, intersected with a support submodule. Let $p$ be a prime and let $\omega$ be the symplectic form on…
  • symB_applyEvaluation of the bundled symplectic form. Fix a prime $p$ and an integer $n$, and set $V = \bbf_p^n \times \bbf_p^n$, equipped with the…
  • symB_subThe symplectic bilinear form $\mathrm{symB}$ restricted to the subspace $V_M$.
  • exists_physical_pairs_bijectiveLet L be a 2l-dimensional submodule of V k 2 over F 2 that is nondegenerate under the symplectic bilinear form symB. Then there exists a…
  • symB_isReflReflexivity of the symplectic form. Let $p$ be a prime, $n$ a natural number, and let $\omega$ be the bilinear form on…

Lean source view module on GitHub

open scoped BigOperators in
set_option linter.mathlibStandardSet false in
open scoped BigOperators in
open scoped Real in
open scoped Nat in
open Classical in
open scoped Pointwise in
set_option maxRecDepth 4000 in
set_option synthInstance.maxHeartbeats 20000 in
set_option synthInstance.maxSize 128 in
set_option relaxedAutoImplicit false in
set_option autoImplicit false in
set_option linter.unnecessarySimpa false in
variable {n : ℕ} {p : ℕ} [Fact p.Prime] in
/-- The standard symplectic form `sym_form` packaged as a `LinearMap.BilinForm`. -/
noncomputable def symB : LinearMap.BilinForm (F p) (V n p) :=
  LinearMap.mk₂ (F p) (fun x y => sym_form (n:=n) (p:=p) x y)
    (by intro x y z; simpa using sym_form_add_left (n:=n) (p:=p) x y z)
    (by intro c x y; simpa using sym_form_smul_left (n:=n) (p:=p) c x y)
    (by intro x y z; simpa using sym_form_add_right (n:=n) (p:=p) x y z)
    (by intro c x y; simpa using sym_form_smul_right (n:=n) (p:=p) c x y)
See it in the graphDiscuss this resultChallenge it