AFTD Auto-Formalizing Theoretical Domains

r_E

defimported Lean

The linear map $r_E : V \to V_E$ that zeroes out the coordinates of a vector outside $E$, keeping those in $E$ unchanged.

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
variable {n : ℕ} {p : ℕ} [Fact p.Prime] in
variable {n : ℕ} {p : ℕ} [Fact p.Prime] in
variable {n : ℕ} {p : ℕ} [Fact p.Prime] in
noncomputable def r_E (E : Finset (Fin n)) : V n p →ₗ[F p] V_sub (p:=p) E
Defined in
TCSlib, `r_E`
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 3
  • V_subFor $C \subseteq \mathrm{Fin}\,n$, the support submodule $V_C = \{v \in V \mid \mathrm{supp}(v) \subseteq C\}$.
  • VThe ambient space $V = \mathbb{F}_p^n \times \mathbb{F}_p^n$ of pairs of coordinate vectors.
  • FThe prime field $\mathrm{GF}(p)$, realized as $\mathbb{Z}/p\mathbb{Z}$ via ZMod.
Used by 11
  • r_E_VThe composition $r_E^V : V \to V$ of $r_E$ with the inclusion $V_E \hookrightarrow V$.
  • dim_map_r_ERank of a restricted subspace of $\mathbb{F}_p^n \times \mathbb{F}_p^n$. Fix a prime $p$ and an integer $n \ge 0$, and let…
  • 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…
  • ker_r_EKernel of the coordinate restriction map. Fix a prime $p$ and let $V = \bbf_p^n \times \bbf_p^n$. For a subset…
  • sym_form_nondegenerate_on_V_subNon-degeneracy of the symplectic form on a support submodule. Let $p$ be a prime, let $n$ be a natural number, and let…
  • sym_form_r_ESymplectic form is unchanged by restricting the second argument. Fix a prime $p$ and an integer $n$, and work in the space…
  • g_expansionExpansion of the operator count $g(S,M)$. Fix a prime $p$ and equip $V = \bbf_p^{\,n} \times \bbf_p^{\,n}$ with the symplectic form…
  • sym_form_left_restrictLeft restriction is invisible to the symplectic form on the support submodule. Fix a prime $p$ and a natural number $n$, and let…
  • g_add_dimsAdditive dimension identity for an isotropic subspace. Let $S$ be an isotropic submodule of the symplectic space…
  • g_le_two_card_CCorrectable part contributes nothing to the operator count. Let $p$ be prime and let $S$ be an $\mathbb{F}_p$-subspace of the symplectic…
  • dim_orth_interDimension of the orthogonal intersection over a coordinate set. Fix a prime $p$, an integer $n$, and work in the symplectic space…

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
variable {n : ℕ} {p : ℕ} [Fact p.Prime] in
variable {n : ℕ} {p : ℕ} [Fact p.Prime] in
variable {n : ℕ} {p : ℕ} [Fact p.Prime] in
/-- Restriction map r_E : V -> V_E -/
noncomputable def r_E (E : Finset (Fin n)) : V n p →ₗ[F p] V_sub (p:=p) E where
  toFun v := ⟨(fun i => if i ∈ E then v.1 i else 0, fun i => if i ∈ E then v.2 i else 0), by
    exact fun i hi => by simp_all only [↓reduceIte, and_self];⟩
  map_add' := by
    intro x y
    simp_all only [Prod.fst_add, Pi.add_apply, Prod.snd_add]
    obtain ⟨fst, snd⟩ := x
    obtain ⟨fst_1, snd_1⟩ := y
    simp_all only [AddMemClass.mk_add_mk, Prod.mk_add_mk, Subtype.mk.injEq, Prod.mk.injEq]
    apply And.intro
    · ext x : 1
      simp_all only [Pi.add_apply]
      split
      next h => simp_all only
      next h => simp_all only [add_zero]
    · ext x : 1
      simp_all only [Pi.add_apply]
      split
      next h => simp_all only
      next h => simp_all only [add_zero]
  map_smul' := by
    intro m x
    simp_all only [Prod.smul_fst, Pi.smul_apply, smul_eq_mul, Prod.smul_snd, RingHom.id_apply]
    obtain ⟨fst, snd⟩ := x
    simp_all only [SetLike.mk_smul_mk, Prod.smul_mk, Subtype.mk.injEq, Prod.mk.injEq]
    apply And.intro
    · ext x : 1
      simp_all only [Pi.smul_apply, smul_eq_mul, mul_ite, mul_zero]
    · ext x : 1
      simp_all only [Pi.smul_apply, smul_eq_mul, mul_ite, mul_zero]

/-
Definitions of symplectic orthogonal complement, isotropic subspace, and code distance.
-/
See it in the graphDiscuss this resultChallenge it