Matrix Is MDS of Is MDS
CoreResults.matrix_IsMDS_of_IsMDS
Plain-language statement
If a linear code generated by a full-rank matrix is MDS, then the matrix is MDS.
Exact Lean statement
lemma matrix_IsMDS_of_IsMDS [Field F] [DecidableEq F] {G : Matrix (Fin k) (Fin n) F}
(hCode : (fromRowGenMat G).IsMDS) (hrank : G.rank = k) : Matrix.IsMDS GFormal artifact
Lean source
lemma matrix_IsMDS_of_IsMDS [Field F] [DecidableEq F] {G : Matrix (Fin k) (Fin n) F} (hCode : (fromRowGenMat G).IsMDS) (hrank : G.rank = k) : Matrix.IsMDS G := by contrapose! hCode simp_all only [Matrix.IsMDS, ne_eq, not_forall, Decidable.not_not] obtain ⟨σ, hσ⟩ := hCode obtain ⟨v, hv⟩ : ∃ v : Fin k → F, v ≠ 0 ∧ Matrix.vecMul v (G.submatrix id σ) = 0 := exists_vecMul_eq_zero_iff.mpr hσ set c : Fin n → F := v ᵥ* G have hc_ne_zero : c ≠ 0 := by have h_inj : Function.Injective (Matrix.vecMulLinear G) := by apply vecMul_injective_of_rank_eq assumption exact fun h => hv.1 (h_inj <| by simpa using h) have hc_in_code : c ∈ fromRowGenMat G := ⟨v, rfl⟩ have hc_norm : hammingNorm c ≤ n - k := by have hc_norm : ∀ j : Fin k, c (σ j) = 0 := by intro j specialize hv replace hv := congr_fun hv.2 j aesop have hc_norm : Finset.card (Finset.univ.filter (fun i => c i ≠ 0)) ≤ Finset.card (Finset.univ \ Finset.image σ Finset.univ) := Finset.card_le_card fun i hi => by aesop simp_all only [ne_eq, Finset.card_sdiff, Finset.card_univ, Fintype.card_fin, Finset.inter_univ, Finset.card_image_of_injective _ σ.injective, ge_iff_le] exact hc_norm have h_dist_le_norm : Code.dist (fromRowGenMat G).carrier ≤ hammingNorm c := by refine Nat.sInf_le ⟨c, hc_in_code, 0, ?_, ?_, ?_⟩ <;> simp [hc_ne_zero] unfold LinearCode.IsMDS simp_all only [ne_eq, Code.dist, Submodule.carrier_eq_coe, SetLike.mem_coe] refine ne_of_lt (lt_of_le_of_lt h_dist_le_norm (lt_of_le_of_lt hc_norm ?_)) simp [length, dim_fromRowGenMat, hrank]- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Data/CodingTheory/Basic/MDSCode.lean:125-158
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Affine gaps lifted to interleaved codes
affine_gaps_lifted_to_interleaved_codes
Project documentation
This lemma proves the final algebraic step in the DG25 Theorem 3.1 proof. It shows that if R > e + 1, then e * (R / (R - 1)) < e + 1. The intuition is that the fraction R / (R - 1) is always greater than 1, but as R gets larger, it gets closer to 1. The hypothesis R > e + 1 provides a strong enough bound to ensure the product e * (fraction) do...
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose coeff
ArkLib.Lattices.Ajtai.gadgetDecompose_coeff
Plain-language statement
The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose lawful
ArkLib.Lattices.Ajtai.gadgetDecompose_lawful
Plain-language statement
The base-b gadget decomposition is a lawful gadget decomposition.
Source project: ArkLib
Person-level attribution pending.