SeminormFromConst #
In this file, we prove BGR, Proposition 1.3.2/2 : starting from a
power-multiplicative seminorm on a commutative ring R and a nonzero c : R, we create a new
power-multiplicative seminorm for which c is multiplicative.
Main Definitions #
seminormFromConst: for a ring seminormfonRandc ∈ R, the ring seminorm onRdefined as the limit off (x * c ^ n) / (f c) ^ n.
Main Results #
seminormFromConst_isNonarchimedean: the functionseminormFromConst c fis nonarchimedean whenfis nonarchimedean.seminormFromConst_isPowMul: the functionseminormFromConst c fis power-multiplicative whenfis power multiplicative.seminormFromConst_const_mul: iffis power multiplicative, thenseminormFromConst c f (c * x) = seminormFromConst c f c * seminormFromConst c f x.
References #
Tags #
SeminormFromConst, Seminorm, Nonarchimedean
For a ring seminorm f on R and c ∈ R, the sequence n ↦ f (x * c ^ n) / (f c) ^ n.
Instances For
The terms in the sequence seminormFromConst_seq c f x are nonnegative.
The image of seminormFromConst_seq c f x is bounded below by zero.
seminormFromConst_seq c f 0 is the constant sequence zero.
seminormFromConst_seq c f x is antitone.
The real-valued function sending x ∈ R to the limit of (f (x * c^n))/((f c)^n).
Equations
- seminormFromConst' c f x = iInf (seminormFromConst_seq c f x)
Instances For
We prove that seminormFromConst' c f x is the limit of the sequence
seminormFromConst_seq c f x as n tends to infinity.
For a ring seminorm f on R and c ∈ R, the ring seminorm on R defined as the limit of
f (x * c ^ n) / (f c) ^ n.
We leave this definition unexposed. Use the limit tendsto_seminormFromConst instead.
Equations
- seminormFromConst c f = let g := fun (x : R) => iInf (seminormFromConst_seq c f x); have hg := ⋯; { toFun := g, map_zero' := ⋯, add_le' := ⋯, neg' := ⋯, mul_le' := ⋯ }
Instances For
The function seminormFromConst c f is bounded above by f.
If 1 ≤ n, then seminormFromConst_seq c f 1 n = 1.
If x : R is multiplicative for f, then seminormFromConst c f x = f x.
If x : R is multiplicative for f, then it is multiplicative for
seminormFromConst c f.
If K is a field, the function seminormFromConst is a RingNorm on K.
Equations
- normFromConst hg_k hg_pm = (seminormFromConst k g).toRingNorm ⋯
Instances For
Alias of normFromConst_def.
If K is a field, seminormFromConst applied to an AlgebraNorm is an AlgebraNorm.
Equations
- algNormFromConst hg_k hg_pm = let __spread.0 := normFromConst hg_k hg_pm; { toRingNorm := __spread.0, smul' := ⋯ }