dim_map_r_E
Rank 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 $V = \mathbb{F}_p^n \times \mathbb{F}_p^n$. For a set $E$ of coordinates, let $r_E \colon V \to V$ be the restriction map that leaves each coordinate in $E$ unchanged and sets every coordinate outside $E$ to zero, and for a set $C$ of coordinates let $V_C \le V$ be the subspace of vectors supported on $C$. Then for every subspace $S \le V$, \[ \dim_{\mathbb{F}_p} r_E(S) \;=\; \dim_{\mathbb{F}_p} S \;-\; \dim_{\mathbb{F}_p}\!\bigl(S \cap V_{E^c}\bigr), \] where $E^c$ denotes the complement of $E$ among the $n$ coordinates.
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 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 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 variable {n : ℕ} {p : ℕ} [Fact p.Prime] in lemma dim_map_r_E (S : Submodule (F p) (V n p)) (E : Finset (Fin n)) : Module.finrank (F p) ↥(S.map (r_E E)) = Module.finrank (F p) ↥S - Module.finrank (F p) ↥(S ⊓ V_sub (p:=p) (E_c E))
- Source
- TCSlib, `dim_map_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.dim_map_r_E← dim_map_r_E (TCSlib/ErrorCorrectingCodes/QuantumSingleton.lean:514): adapted
What was changed in
dim_map_r_E--- TCSlib/ErrorCorrectingCodes/QuantumSingleton.lean:514 (dim_map_r_E) +++ as compiled here @@ -1,2 +1,27 @@ -/-- Rank-nullity for restriction of S to E -/ +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 +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 +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 +variable {n : ℕ} {p : ℕ} [Fact p.Prime] in lemma dim_map_r_E (S : Submodule (F p) (V n p)) (E : Finset (Fin n)) : @@ -34,2 +59,3 @@ convert ker_r_E E using 1 + rfl - Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- 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…
- 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…
- V_subFor $C \subseteq \mathrm{Fin}\,n$, the support submodule $V_C = \{v \in V \mid \mathrm{supp}(v) \subseteq C\}$.
- r_EThe linear map $r_E : V \to V_E$ that zeroes out the coordinates of a vector outside $E$, keeping those in $E$ unchanged.
- VThe ambient space $V = \mathbb{F}_p^n \times \mathbb{F}_p^n$ of pairs of coordinate vectors.
- E_c$E^c = \mathrm{Fin}\,n \setminus E$, the complement finset of $E$.
- FThe prime field $\mathrm{GF}(p)$, realized as $\mathbb{Z}/p\mathbb{Z}$ via
ZMod.
- Used by 7
- LinearPMap.closure_smulLinearPMap.closure_smul
- LinearPMap.IsClosable.add_continuousClosability is preserved upon adding a continuous operator.
- LinearPMap.closure_domain_le_domain_closureLinearPMap.closure_domain_le_domain_closure
- LinearPMap.IsClosed.add_continuousClosedness is preserved upon adding a continuous operator.
- 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…
- g_add_dimsAdditive dimension identity for an isotropic subspace. Let $S$ be an isotropic submodule of the symplectic space…
- LinearPMap.HasDenseDomain.orthogonal_range
U.rangeᗮ = U†.kerc.f.LinearMap.orthogonal_rangeandContinuousLinearMap.orthogonal_range
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] invariable {n : ℕ} {p : ℕ} [Fact p.Prime] in/-- Rank-nullity for restriction of S to E -/lemma dim_map_r_E (S : Submodule (F p) (V n p)) (E : Finset (Fin n)) : Module.finrank (F p) ↥(S.map (r_E E)) = Module.finrank (F p) ↥S - Module.finrank (F p) ↥(S ⊓ V_sub (p:=p) (E_c E)) := by have h_rank_nullity : Module.finrank (F p) (↥(S.map (r_E E))) = Module.finrank (F p) S - Module.finrank (F p) (↥(S ⊓ LinearMap.ker (r_E E))) := by have h_rank_nullity : ∀ (f : (V n p) →ₗ[F p] V_sub (p:=p) E), Module.finrank (F p) (↥(Submodule.map f S)) = Module.finrank (F p) S - Module.finrank (F p) (↥(S ⊓ LinearMap.ker f)) := by intro f have h_rank_nullity : ∀ (f : (V n p) →ₗ[F p] V_sub (p:=p) E), Module.finrank (F p) (↥(Submodule.map f S)) = Module.finrank (F p) S - Module.finrank (F p) (↥(S ⊓ LinearMap.ker f)) := by intro f have h_rank_nullity : ∀ (f : (V n p) →ₗ[F p] V_sub (p:=p) E), ∀ (U : Submodule (F p) (V n p)), Module.finrank (F p) (↥(Submodule.map f U)) = Module.finrank (F p) U - Module.finrank (F p) (↥(U ⊓ LinearMap.ker f)) := by intros f U have h_rank_nullity : Module.finrank (F p) (↥(Submodule.map f U)) = Module.finrank (F p) U - Module.finrank (F p) (↥(LinearMap.ker (f.comp (Submodule.subtype U)))) := by have := LinearMap.finrank_range_add_finrank_ker ( f.comp ( Submodule.subtype U ) ); exact eq_tsub_of_add_eq <| by rw [ show LinearMap.range ( f ∘ₗ U.subtype ) = Submodule.map f U from by ext; aesop ] at this; linarith; convert h_rank_nullity using 3; rw [ ← Submodule.finrank_map_subtype_eq ]; congr ; ext ; rename_i x simp_all only [Submodule.mem_inf, LinearMap.mem_ker, Submodule.mem_map, LinearMap.coe_comp, Submodule.coe_subtype, Function.comp_apply, Submodule.subtype_apply, Subtype.exists, exists_and_left, exists_prop, exists_eq_right_right] obtain ⟨fst, snd⟩ := x apply Iff.intro · intro a simp_all only [and_self] · intro a simp_all only [and_self]; · ext ; aesop; · ext ; aesop; · infer_instance exact h_rank_nullity f S; exact h_rank_nullity f; convert h_rank_nullity ( r_E E ) using 1; rwa [ show LinearMap.ker ( r_E E ) = V_sub ( E_c E ) from ?_ ] at h_rank_nullity; convert ker_r_E E using 1 rfl/-Symplectic form of v (in V_M) and s is equal to symplectic form of v and r_E M s.-/