Documentation

TauCeti.RingTheory.Huber.LocalizationTopology.Evaluation

Evaluating A⟨X₁, …, Xₖ⟩ at the fractions of a rational localisation #

For numerators t₁, …, tₖ drawn from T, this file constructs the continuous A-algebra map

A⟨X₁, …, Xₖ⟩ → A⟨T/s⟩,      Xᵢ ↦ tᵢ/s

by instantiating the universal property of the completed restricted power-series algebra at the trivial weight family. Membership of each tᵢ in T is what makes the fraction tᵢ/s power-bounded, which is the hypothesis that universal property needs.

Main results #

The corresponding statements for polynomials, which need no completion theory, live one level down in TauCeti.RingTheory.Huber.LocalizationTopology.PolynomialEvaluation and are re-exported by this module — chiefly TauCeti.Huber.polyEvalHom and TauCeti.Huber.PairOfDefinition.isOpenQuotientMap_polyEvalHom.

What this is not #

TauCeti.Huber.PairOfDefinition.rationalEvalHom is an evaluation map, and for an arbitrary family of numerators it is not a presentation: the family may repeat elements of T and may omit every one of them, and then nothing exhibits A⟨T/s⟩ as generated by the chosen fractions. The surjectivity above is not free of that — it is exactly what the two hypotheses on the family buy.

Dense range is not surjectivity, and the two are proved separately here. TauCeti.Huber.PairOfDefinition.denseRange_rationalEvalHom gives density from the range containing the image of Aₛ; density alone does not make a subring the whole of a complete ring. Surjectivity additionally needs the range to be closed, which is what the open-quotient route supplies.

Strong noetherianity of A⟨T/s⟩ is not proved here: it follows from the finite-type result above by TauCeti.Huber.IsStrictlyTopologicallyFiniteType.isStronglyNoetherian, and that derivation lives in TauCeti.RingTheory.Huber.LocalizationTopology.StronglyNoetherian, beside the other strong-noetherianity results for localisations.

References #

noncomputable def TauCeti.Huber.PairOfDefinition.rationalEvalHom {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) :

The evaluation map A⟨X₁, …, Xₖ⟩ → A⟨T/s⟩, sending each variable Xᵢ to the fraction tᵢ/s and each constant to its image under the structure map.

It is TauCeti.Huber.weightedEvalHomCompletion — Wedhorn's Proposition 5.50 carried to the completion — at the trivial weight family, where the domain is A⟨X₁, …, Xₖ⟩ itself. The numerators are given as a family t : Fin k → A landing in T rather than as T itself, so that a caller may repeat or omit numerators. What their membership buys is power-boundedness of each tᵢ/s in A⟨T/s⟩, which is the hypothesis the universal property needs.

Equations
Instances For
    theorem TauCeti.Huber.PairOfDefinition.continuous_rationalEvalHom {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) :
    Continuous ⇑(P.rationalEvalHom T s S hden t ht)

    The evaluation map is continuous.

    @[simp]
    theorem TauCeti.Huber.PairOfDefinition.rationalEvalHom_coe_weightedC {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (a : A) :
    (P.rationalEvalHom T s S hden t ht) ↑((weightedC (fun (x : Fin k) => {1}) ⋯) a) = (P.toCompletionLoc T s S hden) a

    The evaluation map sends a constant to its image under the structure map A → A⟨T/s⟩.

    @[simp]
    theorem TauCeti.Huber.PairOfDefinition.rationalEvalHom_coe_weightedX {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (i : Fin k) :
    (P.rationalEvalHom T s S hden t ht) ↑(weightedX (fun (x : Fin k) => {1}) ⋯ i) = ↑(Localization.divBy (t i) s)

    The evaluation map sends Xᵢ to tᵢ/s — the defining property.

    theorem TauCeti.Huber.PairOfDefinition.rationalEvalHom_comp_algebraMap {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) :

    The evaluation map is a map over A: composing it with the structure map of A⟨X₁, …, Xₖ⟩ returns the structure map of A⟨T/s⟩.

    This is the commutative triangle a finite-type presentation is asked for — see TauCeti.Huber.IsStrictlyTopologicallyFiniteType, whose definition pairs an open quotient map with exactly this compatibility — so it is the form a consumer needs, rather than the pointwise rationalEvalHom_coe_weightedC.

    theorem TauCeti.Huber.PairOfDefinition.coe_mem_range_rationalEvalHom_of_mem_adjoin {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) {x : S} (hx : x ∈ Algebra.adjoin A (Set.range fun (i : Fin k) => Localization.divBy (t i) s)) :
    ↑x ∈ Set.range ⇑(P.rationalEvalHom T s S hden t ht)

    An element of the A-subalgebra generated by the fractions is already in the range of the evaluation map, after the completion map.

    This is the general statement, with no hypothesis on the numerators: TauCeti.Huber.PairOfDefinition.coe_mem_range_rationalEvalHom is the special case where that subalgebra is everything, which is what the numerators and s generating the unit ideal buys.

    theorem TauCeti.Huber.PairOfDefinition.coe_mem_range_rationalEvalHom {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (hspan : Ideal.span (insert s (Set.range t)) = ⊤) (x : S) :
    ↑x ∈ Set.range ⇑(P.rationalEvalHom T s S hden t ht)

    Every element of Aₛ is already in the range of the evaluation map, when the numerators together with the denominator s generate the unit ideal.

    Including s among the generators is the weaker hypothesis, and the one a rational subset supplies: dividing 1 = c · s + ∑ cₜ · t through by s makes the s term contribute the coefficient c, which lies in A, rather than a new fraction.

    This is the sharp form of the statement: not merely that the range is dense, but that it contains the image of the whole localisation.

    theorem TauCeti.Huber.PairOfDefinition.denseRange_rationalEvalHom {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (hspan : Ideal.span (insert s (Set.range t)) = ⊤) :
    DenseRange ⇑(P.rationalEvalHom T s S hden t ht)

    The evaluation map has dense range when the numerators together with the denominator s generate the unit ideal.

    Density on its own does not give surjectivity: a dense subring of a complete ring need not be all of it. What closes the gap is the open-quotient route, not this theorem.

    The two evaluations agree on polynomials #

    @[simp]
    theorem TauCeti.Huber.PairOfDefinition.rationalEvalHom_coe_weightedPolynomialHom {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (p : MvPolynomial (Fin k) A) :
    (P.rationalEvalHom T s S hden t ht) ↑((weightedPolynomialHom (fun (x : Fin k) => {1}) ⋯) p) = ↑((MvPolynomial.aeval fun (i : Fin k) => Localization.divBy (t i) s) p)

    On a polynomial the two evaluations agree: evaluating it in A⟨X₁, …, Xₖ⟩ by TauCeti.Huber.PairOfDefinition.rationalEvalHom gives the image in the completion of its value at the fractions.

    On the copy of a polynomial inside A⟨X₁, …, Xₖ⟩ the completed evaluation is therefore determined by the elementary one at the fractions: the two agree once both are carried into the completions, the polynomial along A[X₁, …, Xₖ] → A⟨X₁, …, Xₖ⟩ and its value along Aₛ → A⟨T/s⟩.

    Surjectivity on the completions #

    theorem TauCeti.Huber.PairOfDefinition.continuous_polyEvalHom_locUniformSpace {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) :

    TauCeti.Huber.PairOfDefinition.continuous_polyEvalHom read at the packaged uniformity. locTopology and locUniformSpace have unexposed bodies, so the two statements are not interchangeable by unfolding; locUniformSpace_toTopologicalSpace is what relates them.

    theorem TauCeti.Huber.PairOfDefinition.isOpenMap_polyEvalHom_locUniformSpace {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (hTt : (Set.range fun (y : ↥T) => Localization.divBy (↑y) s) ⊆ Set.range fun (i : Fin k) => Localization.divBy (t i) s) :

    TauCeti.Huber.PairOfDefinition.isOpenMap_polyEvalHom read at the packaged uniformity.

    theorem TauCeti.Huber.PairOfDefinition.completion_polyEvalHom_surjective {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) [(nhds 0).IsCountablyGenerated] {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (hspan : Ideal.span (insert s (Set.range t)) = ⊤) (hTt : (Set.range fun (y : ↥T) => Localization.divBy (↑y) s) ⊆ Set.range fun (i : Fin k) => Localization.divBy (t i) s) :

    The completed polynomial evaluation is surjective: the completion of A[X₁,…,Xₖ] maps onto the completion of Aₛ.

    The hypotheses are those under which the polynomial evaluation is an open quotient map: the numerators generate the unit ideal with s, and their fractions cover those of T. Countable generation of 𝓝 (0 : A) is what makes the completions metrisable, and is a hypothesis rather than a background assumption.

    theorem TauCeti.Huber.PairOfDefinition.rationalEvalHom_comp_completionMap {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) :
    (fun (w : UniformSpace.Completion ↥(weightedPolynomials (fun (x : Fin k) => {1}) ⋯)) => (P.rationalEvalHom T s S hden t ht) (UniformSpace.Completion.map (fun (x : ↥(weightedPolynomials (fun (x : Fin k) => {1}) ⋯)) => ↑x) w)) = fun (w : UniformSpace.Completion ↥(weightedPolynomials (fun (x : Fin k) => {1}) ⋯)) => ((polyEvalHom s S t).toAddMonoidHom.completion ⋯) w

    The comparison square on the completions. Evaluating in A⟨X₁, …, Xₖ⟩ after the map induced by the inclusion of the polynomials is the completion of the polynomial evaluation.

    What the equality transports is surjectivity, in one direction: the left-hand side is rationalEvalHom precomposed with the map induced by the polynomial inclusion, so if the completed polynomial evaluation is onto then so is rationalEvalHom. That is the use made of it in TauCeti.Huber.PairOfDefinition.rationalEvalHom_surjective.

    theorem TauCeti.Huber.PairOfDefinition.rationalEvalHom_surjective {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) [(nhds 0).IsCountablyGenerated] {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (hspan : Ideal.span (insert s (Set.range t)) = ⊤) (hTt : (Set.range fun (y : ↥T) => Localization.divBy (↑y) s) ⊆ Set.range fun (i : Fin k) => Localization.divBy (t i) s) :
    Function.Surjective ⇑(P.rationalEvalHom T s S hden t ht)

    The evaluation map A⟨X₁, …, Xₖ⟩ → A⟨T/s⟩ is surjective, for numerators which together with the denominator s generate the unit ideal, and whose fractions cover those of T.

    Every element of A⟨T/s⟩ is thus the value of a restricted power series in the fractions tᵢ/s. This is the surjectivity half of exhibiting A⟨T/s⟩ as a quotient of A⟨X₁, …, Xₖ⟩; openness is the other half, and TauCeti.Huber.PairOfDefinition.isOpenMap_rationalEvalHom supplies it.

    theorem TauCeti.Huber.PairOfDefinition.isOpenMap_rationalEvalHom {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) [IsTateRing A] [(nhds 0).IsCountablyGenerated] {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (hspan : Ideal.span (insert s (Set.range t)) = ⊤) (hTt : (Set.range fun (y : ↥T) => Localization.divBy (↑y) s) ⊆ Set.range fun (i : Fin k) => Localization.divBy (t i) s) :
    IsOpenMap ⇑(P.rationalEvalHom T s S hden t ht)

    The evaluation map A⟨X₁, …, Xₖ⟩ → A⟨T/s⟩ is open, under the hypotheses that make it surjective.

    Over a Tate ring openness is not an independent hypothesis: it already follows from the surjectivity and continuity of the same map. The hypotheses are therefore exactly those of TauCeti.Huber.PairOfDefinition.rationalEvalHom_surjective, with A additionally Tate.

    theorem TauCeti.Huber.PairOfDefinition.isOpenQuotientMap_rationalEvalHom {A : Type u_1} [CommRing A] [TopologicalSpace A] [NonarchimedeanRing A] (P : PairOfDefinition A) (T : Finset A) (s : A) (S : Type u_2) [CommRing S] [Algebra A S] [IsLocalization.Away s S] (hden : P.HasDenominatorPower T s S) [IsTateRing A] [(nhds 0).IsCountablyGenerated] {k : ℕ} (t : Fin k → A) (ht : ∀ (i : Fin k), t i ∈ T) (hspan : Ideal.span (insert s (Set.range t)) = ⊤) (hTt : (Set.range fun (y : ↥T) => Localization.divBy (↑y) s) ⊆ Set.range fun (i : Fin k) => Localization.divBy (t i) s) :
    IsOpenQuotientMap ⇑(P.rationalEvalHom T s S hden t ht)

    The evaluation map A⟨X₁, …, Xₖ⟩ → A⟨T/s⟩ is an open quotient map: it presents A⟨T/s⟩ as a topological quotient of the restricted power series ring.

    This is the form Wedhorn's Definition 6.28 asks for, and the form TauCeti.Huber.isStrictlyTopologicallyFiniteType_iff consumes; it bundles TauCeti.Huber.PairOfDefinition.rationalEvalHom_surjective, TauCeti.Huber.PairOfDefinition.continuous_rationalEvalHom and TauCeti.Huber.PairOfDefinition.isOpenMap_rationalEvalHom with no further hypotheses.

    A rational localisation is strictly topologically of finite type over A, whenever the numerators together with the denominator s generate the unit ideal.

    That is the rational-subset condition itself, and it is all this asks: no auxiliary family and no choice of covering fractions.

    This is Wedhorn's Definition 6.28 at Example 6.38. The presenting algebra is the trivial-weight one, A⟨X₁, …, Xₖ⟩, which is what makes this strict topological finite type rather than the weaker notion of Definition 6.29.

    Strict finite type is the hypothesis under which strong noetherianity descends from A to A⟨T/s⟩; TauCeti.Huber.PairOfDefinition.isStronglyNoetherian_completion is that consequence.