Dvd eval of root Multiplicity zero
GuruswamiSudan.dvd_eval_of_rootMultiplicity_zero
Plain-language statement
If Q has high multiplicity at (0,0) (meaning all coefficients c_{i,j} with i+j < m are zero) and P(0)=0, then Q(X, P(X)) is divisible by X^m.
Exact Lean statement
lemma dvd_eval_of_rootMultiplicity_zero (Q : F[X][Y]) (P : F[X]) (m : ℕ)
(hQ : ∀ i j, i + j < m → Bivariate.coeff Q i j = 0) (hP : P.coeff 0 = 0) :
X ^ m ∣ Q.eval PFormal artifact
Lean source
lemma dvd_eval_of_rootMultiplicity_zero (Q : F[X][Y]) (P : F[X]) (m : ℕ) (hQ : ∀ i j, i + j < m → Bivariate.coeff Q i j = 0) (hP : P.coeff 0 = 0) : X ^ m ∣ Q.eval P := by have h_div_Pj : ∀ j : ℕ, X ^ j ∣ P ^ j := fun j ↦ pow_dvd_pow_of_dvd (X_dvd_iff.mpr hP) j have h_div_term_all : ∀ i j : ℕ, (Q.coeff j).coeff i ≠ 0 → X ^ m ∣ Polynomial.monomial i ((Q.coeff j).coeff i) * P ^ j := by intros i j hij have h_div_term : X ^ (i + j) ∣ Polynomial.monomial i ((Q.coeff j).coeff i) * P ^ j := by simp only [pow_add] exact mul_dvd_mul (by simp [← C_mul_X_pow_eq_monomial]) (h_div_Pj j) exact dvd_trans (pow_dvd_pow _ (Nat.le_of_not_lt fun h ↦ hij <| by solve_by_elim)) h_div_term simp only [eval_eq_sum, sum_def] refine Finset.dvd_sum fun n hn ↦ ?_ rw [(Q.coeff n).as_sum_range_C_mul_X_pow] simp only [Finset.sum_mul, C_mul_X_pow_eq_monomial] classical exact Finset.dvd_sum fun i hi ↦ if hi0 : (Q.coeff n).coeff i = 0 then by simp [hi0] else h_div_term_all i n hi0- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Data/CodingTheory/GuruswamiSudan/Basic.lean:758-776
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.