AFTD Auto-Formalizing Theoretical Domains

sym_form_swap

theoremverifiedimported Lean

Antisymmetry of the symplectic form. Fix a prime $p$ and an integer $n$, and equip $V = \bbf_p^n \times \bbf_p^n$ with the bilinear form $\omega(u,v) = \sum_{i=0}^{n-1}(x_i z'_i - z_i x'_i)$, where $u = (x,z)$ and $v = (x',z')$. Then $\omega$ is antisymmetric: for all $u, v \in V$, \[ \omega(u,v) = -\,\omega(v,u). \]

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
lemma sym_form_swap (u v : V n p) :
    sym_form u v = - sym_form v u
Source
TCSlib, `sym_form_swap`
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
Classical.choiceQuot.soundpropext
Built on 2
  • 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). \]
  • VThe ambient space $V = \mathbb{F}_p^n \times \mathbb{F}_p^n$ of pairs of coordinate vectors.
Used by 2
  • sym_form_sub_isReflReflexivity of the restricted symplectic form. Fix a prime $p$, a natural number $n$, and a subset $M \subseteq \{0,1,\dots,n-1\}$, and…
  • 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 inset_option linter.mathlibStandardSet false inopen scoped BigOperators inopen scoped Real inopen scoped Nat inopen Classical inopen scoped Pointwise inset_option maxRecDepth 4000 inset_option synthInstance.maxHeartbeats 20000 inset_option synthInstance.maxSize 128 inset_option relaxedAutoImplicit false inset_option autoImplicit false inset_option linter.unnecessarySimpa false invariable {n : ℕ} {p : ℕ} [Fact p.Prime] in/-- The symplectic form is antisymmetric: `sym_form u v = -sym_form v u`. -/lemma sym_form_swap (u v : V n p) :    sym_form u v = - sym_form v u := by  unfold sym_form  rw [← Finset.sum_neg_distrib]  congr with i  ring
See it in the graphDiscuss this resultChallenge it