Exact reciprocal polynomial facts used by the actual graph-line type
DefinitionHuangN13_ReciprocalPolynomialFactsCorehuang-n13mazur-full-torsion
Exactly the original integralReciprocal_monic and integralReciprocal_natDegree proof commands. Their constants occur in the original actual twoChartLine arguments of the saturation statement; the original type is retained.
Definition code
import Mathlib
import Definitions.Def_MazurN13_L4
set_option autoImplicit false
section
section
set_option autoImplicit false
open Polynomial
namespace MazurProof.N13ReciprocalQuadraticReflection
noncomputable section
attribute [local instance] MazurProof.N13TwoAdicMumfordTransport.instFactPrimeOfNatNat_fLT
theorem integralReciprocal_monic
(a b : R₂) :
(integralReciprocal a b).Monic := by
unfold integralReciprocal
monicity <;> norm_num
end
end MazurProof.N13ReciprocalQuadraticReflection
end
end
section
section
set_option autoImplicit false
open Polynomial
namespace MazurProof.N13ReciprocalQuadraticReflection
noncomputable section
attribute [local instance] MazurProof.N13TwoAdicMumfordTransport.instFactPrimeOfNatNat_fLT
theorem integralReciprocal_natDegree
(a b : R₂) :
(integralReciprocal a b).natDegree = 2 := by
unfold integralReciprocal
compute_degree <;> norm_num
end
end MazurProof.N13ReciprocalQuadraticReflection
end
end
Source
Xiang Huang, Apache-2.0. Original FLT source at https://github.com/xiangyazi24/FLT/tree/51bbb4f191ad0d3753b87123635c100a638ae580/FLT/Assumptions/MazurProof. Exact compiler-boundary source ranges and hashes are recorded in metadata.json; original-file line mapping is not asserted.