Finite approximation in Dedekind domains #
This file gives the finite approximation theorem in the form used to patch local data over a Dedekind domain. Given residue classes modulo powers of the maximal ideals in finitely many localizations, one global element realizes all of them.
The proof combines the Chinese remainder theorem
Ideal.pi_quotient_surjective with the canonical comparison
IsLocalization.AtPrime.equivQuotMaximalIdealPow between a prime-power quotient and the
corresponding quotient after localization.
Main results #
TauCeti.DedekindDomain.exists_eq_mod_localized_prime_pow: simultaneous approximation of finitely many classes in localized prime-power quotients.TauCeti.DedekindDomain.exists_forall_sub_mem_map_localizationAtPrime: one element ofRagrees with a prescribed element of every localizationR_vmodulo a fixed nonzero ideal. Only the finitely many primes containing the ideal impose a condition.TauCeti.DedekindDomain.exists_forall_sub_mem_span_singleton_localizationAtPrime: the specialization to a nonzero principal modulus.
This is the finite approximation input for the local-to-global patching arguments in Silverman, The Arithmetic of Elliptic Curves, Chapter VIII, Section 8.
Finite approximation at height-one primes.
For pairwise distinct height-one primes v i, arbitrary residue classes modulo the indicated
powers of the maximal ideals of R_{v i} are simultaneously represented by a single element
of R.
Allowing exponent zero is harmless: the corresponding quotient is the zero ring, so that component imposes no condition.
Approximation modulo a nonzero ideal at every height-one prime.
Given an element x v of every localization R_v, a single a ∈ R is congruent to each x v
modulo the extension of I to R_v. The family is indexed by all height-one primes; only the
finitely many containing I constrain a, since at every other prime the extension is the
unit ideal.
Approximation modulo a nonzero element at every height-one prime.
Given an element x v of every localization R_v, a single a ∈ R is congruent to each x v
modulo d. Only the finitely many primes containing d constrain a.