YukonModule.ProximityPrize.SubmissionLower.TransverseBudgetUse6814.part0
DefinitionYukon_82654001b76f2786fe41eaa7better-codes
Source module ProximityPrize.SubmissionLower.TransverseBudgetUse6814.
Definition code
import Definitions.Def_Yukon_d22cb8a5c15e464b96e1f345
set_option backward.isDefEq.respectTransparency.types false
/-! Local controls for the repeated common-factor case. These are not
counterexamples to the full received-word packet hypotheses. -/
namespace ProximityPrize.SubmissionLower.TransverseBudgetUse6814
noncomputable section
set_option autoImplicit false
set_option maxHeartbeats 1000000
open Polynomial
variable {K : Type*} [CommRing K]
def cheap (f : K) : Polynomial K := Polynomial.X^3+Polynomial.C f
def thick (f : K) : Polynomial K := (Polynomial.X-1)*(cheap f)^2
theorem thick_expansion (f : K) : thick f =
Polynomial.X^7-Polynomial.X^6+Polynomial.C (2*f)*Polynomial.X^4-
Polynomial.C (2*f)*Polynomial.X^3+Polynomial.C (f^2)*Polynomial.X-Polynomial.C (f^2) := by
simp only [thick,cheap,map_mul,map_ofNat,map_pow]
ring
theorem thick_low_coeffs (f : K) :
(thick f).coeff 0 = -(f^2) ∧
(thick f).coeff 1 = f^2 ∧
(thick f).coeff 2 = 0 := by
rw [thick_expansion]
simp only [Polynomial.coeff_add,Polynomial.coeff_sub,Polynomial.coeff_C_mul,
Polynomial.coeff_mul_X,Polynomial.coeff_X_pow,Polynomial.coeff_C]
norm_num
theorem reduced_thick : thick (0 : K)=Polynomial.X^6*(Polynomial.X-1) := by
simp only [thick,cheap,map_zero,add_zero]
ring
end
end ProximityPrize.SubmissionLower.TransverseBudgetUse6814
Source