Ultrametric norms #
This file contains results on the behavior of norms in ultrametric groups.
Main results #
IsUltrametricDist.isUltrametricDist_of_isNonarchimedean_norm
: a normed additive group has an ultrametric iff the norm is nonarchimedeanIsUltrametricDist.nonarchimedeanGroup
and its additive version: instance showing that a commutative group with a nonarchimedean seminorm is a nonarchimedean topological group (i.e. there is a neighbourhood basis of the identity consisting of open subgroups).
Implementation details #
Some results are proved first about nnnorm : X → ℝ≥0
because the bottom element
in NNReal
is 0, so easier to make statements about maxima of empty sets.
Tags #
ultrametric, nonarchimedean
In a group with an ultrametric norm, open balls around 1 of positive radius are open subgroups.
Equations
- IsUltrametricDist.ball_openSubgroup S hr = { carrier := Metric.ball 1 r, mul_mem' := ⋯, one_mem' := ⋯, inv_mem' := ⋯, isOpen' := ⋯ }
Instances For
In an additive group with an ultrametric norm, open balls around 0 of positive radius are open subgroups.
Equations
- IsUltrametricDist.ball_openAddSubgroup S hr = { carrier := Metric.ball 0 r, add_mem' := ⋯, zero_mem' := ⋯, neg_mem' := ⋯, isOpen' := ⋯ }
Instances For
In a group with an ultrametric norm, closed balls around 1 of positive radius are open subgroups.
Equations
- IsUltrametricDist.closedBall_openSubgroup S hr = { carrier := Metric.closedBall 1 r, mul_mem' := ⋯, one_mem' := ⋯, inv_mem' := ⋯, isOpen' := ⋯ }
Instances For
In an additive group with an ultrametric norm, closed balls around 0 of positive radius are open subgroups.
Equations
- IsUltrametricDist.closedBall_openAddSubgroup S hr = { carrier := Metric.closedBall 0 r, add_mem' := ⋯, zero_mem' := ⋯, neg_mem' := ⋯, isOpen' := ⋯ }
Instances For
A commutative group with an ultrametric group seminorm is nonarchimedean (as a topological group, i.e. every neighborhood of 1 contains an open subgroup).
Equations
- ⋯ = ⋯
A commutative additive group with an ultrametric group seminorm is nonarchimedean (as a topological group, i.e. every neighborhood of 0 contains an open subgroup).
Equations
- ⋯ = ⋯
Nonarchimedean norm of a product is less than or equal the norm of any term in the product.
This version is phrased using Finset.sup'
and Finset.Nonempty
due to Finset.sup
operating over an OrderBot
, which ℝ
is not.
Nonarchimedean norm of a sum is less than or equal the norm of any term in the sum.
This version is phrased using Finset.sup'
and Finset.Nonempty
due to Finset.sup
operating over an OrderBot
, which ℝ
is not.
Nonarchimedean norm of a product is less than or equal to the largest norm of a term in the product.
Nonarchimedean norm of a sum is less than or equal to the largest norm of a term in the sum.
Generalised ultrametric triangle inequality for finite products in commutative groups with an ultrametric norm.
Generalised ultrametric triangle inequality for finite sums in additive commutative groups with an ultrametric norm.
Generalised ultrametric triangle inequality for nonempty finite products in commutative groups with an ultrametric norm.
Generalised ultrametric triangle inequality for nonempty finite sums in additive commutative groups with an ultrametric norm.
Generalised ultrametric triangle inequality for finite products in commutative groups with an ultrametric norm.
Generalised ultrametric triangle inequality for finite sums in additive commutative groups with an ultrametric norm.
Given a function f : ι → M
and a nonempty finite set t ⊆ ι
, we can always find i ∈ t
such that
‖∏ j in t, f j‖ ≤ ‖f i‖
.
Given a function f : ι → M
and a nonempty finite set t ⊆ ι
, we can always find
i ∈ t
such that ‖∑ j in t, f j‖ ≤ ‖f i‖
.
Given a function f : ι → M
and a finite set t ⊆ ι
, we can always find i : ι
, belonging to t
if t
is nonempty, such that ‖∏ j in t, f j‖ ≤ ‖f i‖
.
Given a function f : ι → M
and a finite set t ⊆ ι
, we can always find i : ι
,
belonging to t
if t
is nonempty, such that ‖∑ j in t, f j‖ ≤ ‖f i‖
.
Given a function f : ι → M
and a multiset t : Multiset ι
, we can always find i : ι
, belonging
to t
if t
is nonempty, such that ‖(s.map f).prod‖ ≤ ‖f i‖
.
Given a function f : ι → M
and a multiset t : Multiset ι
, we can always find
i : ι
, belonging to t
if t
is nonempty, such that ‖(s.map f).sum‖ ≤ ‖f i‖
.