All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Gen matrix exists

LinearCode.gen_matrix_exists

Plain-language statement

Given a linear code of length ι and dimension dim over a field F, there exists a dim × ι matrix over F which generates the code. Theorem 2.2.7 [GRS25].

Exact Lean statement

lemma gen_matrix_exists [Field F] (LC : LinearCode ι F) :
    ∃ (G : Matrix (Fin (dim LC)) ι F), LC = fromRowGenMat G

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma gen_matrix_exists [Field F] (LC : LinearCode ι F) :     (G : Matrix (Fin (dim LC)) ι F), LC = fromRowGenMat G := by  unfold fromRowGenMat  have LC_basis := Module.finBasis F LC  let G : Matrix (Fin (Module.finrank F ↥LC)) ι F :=    fun i => LC_basis i  use G  simp only [range_vecMulLinear, G, Matrix.row]  ext x  rw [Submodule.mem_span_range_iff_exists_fun]  constructor  · intros h    use LC_basis.equivFun x, h    have x_to_lin_comb : (x, h : LC).1 = ∑ i, LC_basis.equivFun x, h i • (LC_basis i).1 := by      rw (occs := .pos [1]) [Module.Basis.sum_equivFun LC_basis x, h, @Submodule.coe_sum]      congr    simp only [Module.Basis.equivFun_apply] at x_to_lin_comb     exact x_to_lin_comb.symm  · rintro x, h    rw [h]    apply Submodule.sum_smul_mem LC x    intros c _    exact Submodule.coe_mem (LC_basis c)
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/CodingTheory/Basic/LinearCode.lean:315-337

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

Project-declaredLean 4.31.0

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...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

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.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record