Exists nonzero solution
GuruswamiSudan.exists_nonzero_solution
Plain-language statement
There exists a non-zero polynomial satisfying the conditions.
Exact Lean statement
lemma exists_nonzero_solution (k n m : ℕ) (ωs : Fin n ↪ F) (f : Fin n → F) :
∃ c : (weigthBoundIndices k (proximity_gap_degree_bound k n m)) → F,
c ≠ 0 ∧ constraintMap k n m ωs f (proximity_gap_degree_bound k n m) c = 0Formal artifact
Lean source
lemma exists_nonzero_solution (k n m : ℕ) (ωs : Fin n ↪ F) (f : Fin n → F) : ∃ c : (weigthBoundIndices k (proximity_gap_degree_bound k n m)) → F, c ≠ 0 ∧ constraintMap k n m ωs f (proximity_gap_degree_bound k n m) c = 0 := by have h_kernel_nontrivial : Module.finrank F ((weigthBoundIndices k (proximity_gap_degree_bound k n m)) → F) > Module.finrank F ((Fin n → constraintIndices m → F)) := by convert numVars_gt_numConstraints k n m using 1 · simp [numVars] · simp [numConstraints] norm_num [Module.finrank] have h_inj : ¬ Function.Injective (constraintMap k n m ωs f (proximity_gap_degree_bound k n m)) := by intro h_inj exact h_kernel_nontrivial.not_ge (LinearMap.finrank_range_of_inj h_inj ▸ Submodule.finrank_le _) contrapose! h_inj exact LinearMap.ker_eq_bot.mp (eq_bot_iff.mpr fun x hx ↦ by_contra fun hx' ↦ h_inj x hx' <| by simpa using hx)- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Data/CodingTheory/GuruswamiSudan/Basic.lean:370-387
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.