Ps nat degree resultant le
ps_nat_degree_resultant_le
Plain-language statement
The degree of resultant(B, A, n, m) is at most m · degX(B) + n · degX(A).
Exact Lean statement
lemma ps_nat_degree_resultant_le {F : Type} [Field F]
(A B : F[X][Y]) (m n : ℕ) :
(resultant B A n m).natDegree ≤
m * (degreeX B) + n * (degreeX A)Formal artifact
Lean source
lemma ps_nat_degree_resultant_le {F : Type} [Field F] (A B : F[X][Y]) (m n : ℕ) : (resultant B A n m).natDegree ≤ m * (degreeX B) + n * (degreeX A) := by classical let M : Matrix (Fin (n + m)) (Fin (n + m)) F[X] := sylvester B A n m have h_coeff (P : F[X][Y]) (k : ℕ) : (P.coeff k).natDegree ≤ degreeX P := by unfold degreeX by_cases hk : k ∈ P.support · simp [Finset.le_sup (f := fun t ↦ (P.coeff t).natDegree) hk] · simp [notMem_support_iff.mp hk] let cb : Fin (n + m) → ℕ := Fin.addCases (fun _ : Fin n ↦ degreeX A) (fun _ : Fin m ↦ degreeX B) have h_entry (σ : Equiv.Perm (Fin (n + m))) (i : Fin (n + m)) : (M (σ i) i).natDegree ≤ cb i := by cases i using Fin.addCases with | left i0 => simp only [cb, Fin.addCases_left] have hM : M (σ (.castAdd m i0)) (.castAdd m i0) = if ((σ (.castAdd m i0) : ℕ) ∈ Set.Icc (i0 : ℕ) ((i0 : ℕ) + m)) then A.coeff ((σ (.castAdd m i0) : ℕ) - i0) else 0 := by simp [M, sylvester, of_apply, Fin.addCases_left] by_cases h : (σ (.castAdd m i0) : ℕ) ∈ Set.Icc (i0 : ℕ) ((i0 : ℕ) + m) · simp only [hM, h, ↓reduceIte, ge_iff_le]; exact h_coeff A _ · simp [hM, h] | right i0 => simp only [cb, Fin.addCases_right] have hM : M (σ (.natAdd n i0)) (.natAdd n i0) = if ((σ (.natAdd n i0) : ℕ) ∈ Set.Icc (i0 : ℕ) ((i0 : ℕ) + n)) then B.coeff ((σ (.natAdd n i0) : ℕ) - i0) else 0 := by simp [M, sylvester, of_apply, Fin.addCases_right] by_cases h : (σ (.natAdd n i0) : ℕ) ∈ Set.Icc (i0 : ℕ) ((i0 : ℕ) + n) · simp only [hM, h, ↓reduceIte, ge_iff_le]; exact h_coeff B _ · simp [hM, h] have h_term (σ : Equiv.Perm (Fin (n + m))) : (Equiv.Perm.sign σ • ∏ i : Fin (n + m), M (σ i) i).natDegree ≤ m * degreeX B + n * degreeX A := by refine le_trans (natDegree_smul_le _ _) ?_ have hprod : (∏ i : Fin (n + m), M (σ i) i).natDegree ≤ ∑ i : Fin (n + m), (M (σ i) i).natDegree := by simpa using natDegree_prod_le _ (fun i ↦ M (σ i) i) refine le_trans (le_trans hprod (Finset.sum_le_sum fun i _ ↦ h_entry σ i)) ?_ simp [cb, Fin.sum_univ_add, Nat.add_comm] have hdet : M.det.natDegree ≤ m * degreeX B + n * degreeX A := by rw [det_apply] exact natDegree_sum_le_of_forall_le _ _ (fun σ _ ↦ h_term σ) simpa [resultant, M, Nat.add_comm, Nat.add_left_comm, Nat.add_assoc, Nat.mul_comm, Nat.mul_left_comm, Nat.mul_assoc] using hdet- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Data/CodingTheory/PolishchukSpielman/Resultant.lean:43-90
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.