mathlib docs: analysis.normed

@[class]

structure has_norm :

Type u_5 → Type u_5

norm : α → ℝ

Auxiliary class, endowing a type α with a function norm : α → ℝ. This class is designed to be extended in more interesting classes specifying the properties of the norm.

Instances

source

@[class]

structure normed_group :

Type u_5 → Type u_5

to_has_norm : has_norm α
to_add_comm_group : add_comm_group α
to_metric_space : metric_space α
dist_eq : ∀ (x y : α), dist x y = ∥x - y∥

A normed group is an additive group endowed with a norm for which dist x y = ∥x - y∥ defines a metric space structure.

Instances

source

def normed_group.of_add_dist {α : Type u_1} [has_norm α] [add_comm_group α] [metric_space α] :

(∀ (x : α), ∥x∥ = dist x 0) → (∀ (x y z : α), dist x y ≤ dist (x + z) (y + z)) → normed_group α

Construct a normed group from a translation invariant distance

Equations

normed_group.of_add_dist H1 H2 = {to_has_norm := _inst_1, to_add_comm_group := _inst_2, to_metric_space := _inst_3, dist_eq := _}

source

def normed_group.of_add_dist' {α : Type u_1} [has_norm α] [add_comm_group α] [metric_space α] :

(∀ (x : α), ∥x∥ = dist x 0) → (∀ (x y z : α), dist (x + z) (y + z) ≤ dist x y) → normed_group α

Construct a normed group from a translation invariant distance

Equations

normed_group.of_add_dist' H1 H2 = {to_has_norm := _inst_1, to_add_comm_group := _inst_2, to_metric_space := _inst_3, dist_eq := _}

source

structure normed_group.core (α : Type u_5) [add_comm_group α] [has_norm α] :

Prop

norm_eq_zero_iff : ∀ (x : α), ∥x∥ = 0 ↔ x = 0
triangle : ∀ (x y : α), ∥x + y∥ ≤ ∥x∥ + ∥y∥
norm_neg : ∀ (x : α), ∥-x∥ = ∥x∥

A normed group can be built from a norm that satisfies algebraic properties. This is formalised in this structure.

source

def normed_group.of_core (α : Type u_1) [add_comm_group α] [has_norm α] :

normed_group.core α → normed_group α

Constructing a normed group from core properties of a norm, i.e., registering the distance and the metric space structure from the norm properties.

Equations

normed_group.of_core α C = {to_has_norm := _inst_2, to_add_comm_group := _inst_1, to_metric_space := {to_has_dist := {dist := λ (x y : α), ∥x - y∥}, dist_self := _, eq_of_dist_eq_zero := _, dist_comm := _, dist_triangle := _, edist := λ (x y : α), ennreal.of_real ((λ (x y : α), ∥x - y∥) x y), edist_dist := _, to_uniform_space := uniform_space_of_dist (λ (x y : α), ∥x - y∥) _ _ _, uniformity_dist := _}, dist_eq := _}

source

theorem dist_eq_norm {α : Type u_1} [normed_group α] (g h : α) :

dist g h = ∥g - h∥

source

@[simp]

theorem dist_zero_right {α : Type u_1} [normed_group α] (g : α) :

dist g 0 = ∥g∥

source

theorem tendsto_norm_cocompact_at_top {α : Type u_1} [normed_group α] [proper_space α] :

filter.tendsto norm (filter.cocompact α) filter.at_top

source

theorem norm_sub_rev {α : Type u_1} [normed_group α] (g h : α) :

∥g - h∥ = ∥h - g∥

source

@[simp]

theorem norm_neg {α : Type u_1} [normed_group α] (g : α) :

∥-g∥ = ∥g∥

source

@[simp]

theorem dist_add_left {α : Type u_1} [normed_group α] (g h₁ h₂ : α) :

dist (g + h₁) (g + h₂) = dist h₁ h₂

source

@[simp]

theorem dist_add_right {α : Type u_1} [normed_group α] (g₁ g₂ h : α) :

dist (g₁ + h) (g₂ + h) = dist g₁ g₂

source

@[simp]

theorem dist_neg_neg {α : Type u_1} [normed_group α] (g h : α) :

dist (-g) (-h) = dist g h

source

@[simp]

theorem dist_sub_left {α : Type u_1} [normed_group α] (g h₁ h₂ : α) :

dist (g - h₁) (g - h₂) = dist h₁ h₂

source

@[simp]

theorem dist_sub_right {α : Type u_1} [normed_group α] (g₁ g₂ h : α) :

dist (g₁ - h) (g₂ - h) = dist g₁ g₂

source

theorem norm_add_le {α : Type u_1} [normed_group α] (g h : α) :

∥g + h∥ ≤ ∥g∥ + ∥h∥

Triangle inequality for the norm.

source

theorem norm_add_le_of_le {α : Type u_1} [normed_group α] {g₁ g₂ : α} {n₁ n₂ : ℝ} :

∥g₁∥ ≤ n₁ → ∥g₂∥ ≤ n₂ → ∥g₁ + g₂∥ ≤ n₁ + n₂

source

theorem dist_add_add_le {α : Type u_1} [normed_group α] (g₁ g₂ h₁ h₂ : α) :

dist (g₁ + g₂) (h₁ + h₂) ≤ dist g₁ h₁ + dist g₂ h₂

source

theorem dist_add_add_le_of_le {α : Type u_1} [normed_group α] {g₁ g₂ h₁ h₂ : α} {d₁ d₂ : ℝ} :

dist g₁ h₁ ≤ d₁ → dist g₂ h₂ ≤ d₂ → dist (g₁ + g₂) (h₁ + h₂) ≤ d₁ + d₂

source

theorem dist_sub_sub_le {α : Type u_1} [normed_group α] (g₁ g₂ h₁ h₂ : α) :

dist (g₁ - g₂) (h₁ - h₂) ≤ dist g₁ h₁ + dist g₂ h₂

source

theorem dist_sub_sub_le_of_le {α : Type u_1} [normed_group α] {g₁ g₂ h₁ h₂ : α} {d₁ d₂ : ℝ} :

dist g₁ h₁ ≤ d₁ → dist g₂ h₂ ≤ d₂ → dist (g₁ - g₂) (h₁ - h₂) ≤ d₁ + d₂

source

theorem abs_dist_sub_le_dist_add_add {α : Type u_1} [normed_group α] (g₁ g₂ h₁ h₂ : α) :

abs (dist g₁ h₁ - dist g₂ h₂) ≤ dist (g₁ + g₂) (h₁ + h₂)

source

@[simp]

theorem norm_nonneg {α : Type u_1} [normed_group α] (g : α) :

0 ≤ ∥g∥

source

@[simp]

theorem norm_eq_zero {α : Type u_1} [normed_group α] {g : α} :

∥g∥ = 0 ↔ g = 0

source

@[simp]

theorem norm_zero {α : Type u_1} [normed_group α] :

∥0∥ = 0

source

theorem norm_of_subsingleton {α : Type u_1} [normed_group α] [subsingleton α] (x : α) :

∥x∥ = 0

source

theorem norm_sum_le {α : Type u_1} [normed_group α] {β : Type u_2} (s : finset β) (f : β → α) :

∥∑ (a : β) in s, f a∥ ≤ ∑ (a : β) in s, ∥f a∥

source

theorem norm_sum_le_of_le {α : Type u_1} [normed_group α] {β : Type u_2} (s : finset β) {f : β → α} {n : β → ℝ} :

(∀ (b : β), b ∈ s → ∥f b∥ ≤ n b) → ∥∑ (b : β) in s, f b∥ ≤ ∑ (b : β) in s, n b

source

@[simp]

theorem norm_pos_iff {α : Type u_1} [normed_group α] {g : α} :

0 < ∥g∥ ↔ g ≠ 0

source

@[simp]

theorem norm_le_zero_iff {α : Type u_1} [normed_group α] {g : α} :

∥g∥ ≤ 0 ↔ g = 0

source

theorem norm_sub_le {α : Type u_1} [normed_group α] (g h : α) :

∥g - h∥ ≤ ∥g∥ + ∥h∥

source

theorem norm_sub_le_of_le {α : Type u_1} [normed_group α] {g₁ g₂ : α} {n₁ n₂ : ℝ} :

∥g₁∥ ≤ n₁ → ∥g₂∥ ≤ n₂ → ∥g₁ - g₂∥ ≤ n₁ + n₂

source

theorem dist_le_norm_add_norm {α : Type u_1} [normed_group α] (g h : α) :

dist g h ≤ ∥g∥ + ∥h∥

source

theorem abs_norm_sub_norm_le {α : Type u_1} [normed_group α] (g h : α) :

abs (∥g∥ - ∥h∥) ≤ ∥g - h∥

source

theorem norm_sub_norm_le {α : Type u_1} [normed_group α] (g h : α) :

∥g∥ - ∥h∥ ≤ ∥g - h∥

source

theorem dist_norm_norm_le {α : Type u_1} [normed_group α] (g h : α) :

dist ∥g∥ ∥h∥ ≤ ∥g - h∥

source

theorem eq_of_norm_sub_eq_zero {α : Type u_1} [normed_group α] {u v : α} :

∥u - v∥ = 0 → u = v

source

theorem norm_le_insert {α : Type u_1} [normed_group α] (u v : α) :

∥v∥ ≤ ∥u∥ + ∥u - v∥

source

theorem ball_0_eq {α : Type u_1} [normed_group α] (ε : ℝ) :

metric.ball 0 ε = {x : α | ∥x∥ < ε}

source

theorem norm_le_of_mem_closed_ball {α : Type u_1} [normed_group α] {g h : α} {r : ℝ} :

h ∈ metric.closed_ball g r → ∥h∥ ≤ ∥g∥ + r

source

theorem norm_lt_of_mem_ball {α : Type u_1} [normed_group α] {g h : α} {r : ℝ} :

h ∈ metric.ball g r → ∥h∥ < ∥g∥ + r

source

theorem normed_group.tendsto_nhds_zero {α : Type u_1} {γ : Type u_3} [normed_group α] {f : γ → α} {l : filter γ} :

filter.tendsto f l (𝓝 0) ↔ ∀ (ε : ℝ), ε > 0 → (∀ᶠ (x : γ) in l, ∥f x∥ < ε)

source

theorem normed_group.tendsto_nhds_nhds {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] {f : α → β} {x : α} {y : β} :

filter.tendsto f (𝓝 x) (𝓝 y) ↔ ∀ (ε : ℝ), ε > 0 → (∃ (δ : ℝ) (H : δ > 0), ∀ (x' : α), ∥x' - x∥ < δ → ∥f x' - y∥ < ε)

source

theorem add_monoid_hom.lipschitz_of_bound {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] (f : α →+ β) (C : ℝ) :

(∀ (x : α), ∥⇑f x∥ ≤ C * ∥x∥) → lipschitz_with (nnreal.of_real C) ⇑f

A homomorphism f of normed groups is Lipschitz, if there exists a constant C such that for all x, one has ∥f x∥ ≤ C * ∥x∥. The analogous condition for a linear map of normed spaces is in normed_space.operator_norm.

source

theorem lipschitz_on_with_iff_norm_sub_le {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] {f : α → β} {C : ℝ≥0} {s : set α} :

lipschitz_on_with C f s ↔ ∀ (x : α), x ∈ s → ∀ (y : α), y ∈ s → ∥f x - f y∥ ≤ (↑C) * ∥x - y∥

source

theorem lipschitz_on_with.norm_sub_le {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] {f : α → β} {C : ℝ≥0} {s : set α} (h : lipschitz_on_with C f s) {x y : α} :

x ∈ s → y ∈ s → ∥f x - f y∥ ≤ (↑C) * ∥x - y∥

source

theorem add_monoid_hom.continuous_of_bound {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] (f : α →+ β) (C : ℝ) :

(∀ (x : α), ∥⇑f x∥ ≤ C * ∥x∥) → continuous ⇑f

A homomorphism f of normed groups is continuous, if there exists a constant C such that for all x, one has ∥f x∥ ≤ C * ∥x∥. The analogous condition for a linear map of normed spaces is in normed_space.operator_norm.

source

def nnnorm {α : Type u_1} [normed_group α] :

α → ℝ≥0

Version of the norm taking values in nonnegative reals.

Equations

nnnorm a = ⟨∥a∥, _⟩

source

@[simp]

theorem coe_nnnorm {α : Type u_1} [normed_group α] (a : α) :

↑(nnnorm a) = ∥a∥

source

theorem nndist_eq_nnnorm {α : Type u_1} [normed_group α] (a b : α) :

nndist a b = nnnorm (a - b)

source

@[simp]

theorem nnnorm_eq_zero {α : Type u_1} [normed_group α] {a : α} :

nnnorm a = 0 ↔ a = 0

source

@[simp]

theorem nnnorm_zero {α : Type u_1} [normed_group α] :

nnnorm 0 = 0

source

theorem nnnorm_add_le {α : Type u_1} [normed_group α] (g h : α) :

nnnorm (g + h) ≤ nnnorm g + nnnorm h

source

@[simp]

theorem nnnorm_neg {α : Type u_1} [normed_group α] (g : α) :

nnnorm (-g) = nnnorm g

source

theorem nndist_nnnorm_nnnorm_le {α : Type u_1} [normed_group α] (g h : α) :

nndist (nnnorm g) (nnnorm h) ≤ nnnorm (g - h)

source

theorem of_real_norm_eq_coe_nnnorm {β : Type u_2} [normed_group β] (x : β) :

ennreal.of_real ∥x∥ = ↑(nnnorm x)

source

theorem edist_eq_coe_nnnorm_sub {β : Type u_2} [normed_group β] (x y : β) :

edist x y = ↑(nnnorm (x - y))

source

theorem edist_eq_coe_nnnorm {β : Type u_2} [normed_group β] (x : β) :

edist x 0 = ↑(nnnorm x)

source

theorem nndist_add_add_le {α : Type u_1} [normed_group α] (g₁ g₂ h₁ h₂ : α) :

nndist (g₁ + g₂) (h₁ + h₂) ≤ nndist g₁ h₁ + nndist g₂ h₂

source

theorem edist_add_add_le {α : Type u_1} [normed_group α] (g₁ g₂ h₁ h₂ : α) :

edist (g₁ + g₂) (h₁ + h₂) ≤ edist g₁ h₁ + edist g₂ h₂

source

theorem nnnorm_sum_le {α : Type u_1} [normed_group α] {β : Type u_2} (s : finset β) (f : β → α) :

nnnorm (∑ (a : β) in s, f a) ≤ ∑ (a : β) in s, nnnorm (f a)

source

theorem lipschitz_with.neg {β : Type u_2} [normed_group β] {α : Type u_1} [emetric_space α] {K : ℝ≥0} {f : α → β} :

lipschitz_with K f → lipschitz_with K (λ (x : α), -f x)

source

theorem lipschitz_with.add {β : Type u_2} [normed_group β] {α : Type u_1} [emetric_space α] {Kf : ℝ≥0} {f : α → β} (hf : lipschitz_with Kf f) {Kg : ℝ≥0} {g : α → β} :

lipschitz_with Kg g → lipschitz_with (Kf + Kg) (λ (x : α), f x + g x)

source

theorem lipschitz_with.sub {β : Type u_2} [normed_group β] {α : Type u_1} [emetric_space α] {Kf : ℝ≥0} {f : α → β} (hf : lipschitz_with Kf f) {Kg : ℝ≥0} {g : α → β} :

lipschitz_with Kg g → lipschitz_with (Kf + Kg) (λ (x : α), f x - g x)

source

theorem antilipschitz_with.add_lipschitz_with {β : Type u_2} [normed_group β] {α : Type u_1} [metric_space α] {Kf : ℝ≥0} {f : α → β} (hf : antilipschitz_with Kf f) {Kg : ℝ≥0} {g : α → β} :

lipschitz_with Kg g → Kg < Kf⁻¹ → antilipschitz_with (Kf⁻¹ - Kg)⁻¹ (λ (x : α), f x + g x)

source

@[instance]

def submodule.normed_group {𝕜 : Type u_1} {_x : ring 𝕜} {E : Type u_2} [normed_group E] {_x_1 : module 𝕜 E} (s : submodule 𝕜 E) :

normed_group ↥s

A submodule of a normed group is also a normed group, with the restriction of the norm. As all instances can be inferred from the submodule s, they are put as implicit instead of typeclasses.

Equations

s.normed_group = {to_has_norm := {norm := λ (x : ↥s), ∥↑x∥}, to_add_comm_group := s.add_comm_group, to_metric_space := subtype.metric_space normed_group.to_metric_space, dist_eq := _}

source

@[instance]

def prod.normed_group {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] :

normed_group (α × β)

normed group instance on the product of two normed groups, using the sup norm.

Equations

prod.normed_group = {to_has_norm := {norm := λ (x : α × β), max ∥x.fst ∥ ∥x.snd ∥}, to_add_comm_group := prod.add_comm_group normed_group.to_add_comm_group, to_metric_space := prod.metric_space_max normed_group.to_metric_space, dist_eq := _}

source

theorem prod.norm_def {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] (x : α × β) :

∥x∥ = max ∥x.fst ∥ ∥x.snd ∥

source

theorem prod.nnnorm_def {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] (x : α × β) :

nnnorm x = max (nnnorm x.fst) (nnnorm x.snd)

source

theorem norm_fst_le {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] (x : α × β) :

∥x.fst ∥ ≤ ∥x∥

source

theorem norm_snd_le {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] (x : α × β) :

∥x.snd ∥ ≤ ∥x∥

source

theorem norm_prod_le_iff {α : Type u_1} {β : Type u_2} [normed_group α] [normed_group β] {x : α × β} {r : ℝ} :

∥x∥ ≤ r ↔ ∥x.fst ∥ ≤ r ∧ ∥x.snd ∥ ≤ r

source

@[instance]

def pi.normed_group {ι : Type u_4} {π : ι → Type u_1} [fintype ι] [Π (i : ι), normed_group («π» i)] :

normed_group (Π (i : ι), «π» i)

normed group instance on the product of finitely many normed groups, using the sup norm.

Equations

pi.normed_group = {to_has_norm := {norm := λ (f : Π (i : ι), «π» i), ↑(finset.univ.sup (λ (b : ι), nnnorm (f b)))}, to_add_comm_group := pi.add_comm_group (λ (i : ι), normed_group.to_add_comm_group), to_metric_space := metric_space_pi (λ (b : ι), normed_group.to_metric_space), dist_eq := _}

source

theorem pi_norm_le_iff {ι : Type u_4} {π : ι → Type u_1} [fintype ι] [Π (i : ι), normed_group («π» i)] {r : ℝ} (hr : 0 ≤ r) {x : Π (i : ι), «π» i} :

∥x∥ ≤ r ↔ ∀ (i : ι), ∥x i∥ ≤ r

The norm of an element in a product space is ≤ r if and only if the norm of each component is.

source

theorem norm_le_pi_norm {ι : Type u_4} {π : ι → Type u_1} [fintype ι] [Π (i : ι), normed_group («π» i)] (x : Π (i : ι), «π» i) (i : ι) :

∥x i∥ ≤ ∥x∥

source

theorem tendsto_iff_norm_tendsto_zero {β : Type u_2} {ι : Type u_4} [normed_group β] {f : ι → β} {a : filter ι} {b : β} :

filter.tendsto f a (𝓝 b) ↔ filter.tendsto (λ (e : ι), ∥f e - b∥) a (𝓝 0)

source

theorem tendsto_zero_iff_norm_tendsto_zero {β : Type u_2} {γ : Type u_3} [normed_group β] {f : γ → β} {a : filter γ} :

filter.tendsto f a (𝓝 0) ↔ filter.tendsto (λ (e : γ), ∥f e∥) a (𝓝 0)

source

theorem squeeze_zero_norm' {α : Type u_1} {γ : Type u_3} [normed_group α] {f : γ → α} {g : γ → ℝ} {t₀ : filter γ} :

(∀ᶠ (n : γ) in t₀, ∥f n∥ ≤ g n) → filter.tendsto g t₀ (𝓝 0) → filter.tendsto f t₀ (𝓝 0)

Special case of the sandwich theorem: if the norm of f is eventually bounded by a real function g which tends to 0, then f tends to 0. In this pair of lemmas (squeeze_zero_norm' and squeeze_zero_norm), following a convention of similar lemmas in topology.metric_space.basic and topology.algebra.ordered, the ' version is phrased using "eventually" and the non-' version is phrased absolutely.

source

theorem squeeze_zero_norm {α : Type u_1} {γ : Type u_3} [normed_group α] {f : γ → α} {g : γ → ℝ} {t₀ : filter γ} :

(∀ (n : γ), ∥f n∥ ≤ g n) → filter.tendsto g t₀ (𝓝 0) → filter.tendsto f t₀ (𝓝 0)

Special case of the sandwich theorem: if the norm of f is bounded by a real function g which tends to 0, then f tends to 0.

source

theorem lim_norm {α : Type u_1} [normed_group α] (x : α) :

filter.tendsto (λ (g : α), ∥g - x∥) (𝓝 x) (𝓝 0)

source

theorem lim_norm_zero {α : Type u_1} [normed_group α] :

filter.tendsto (λ (g : α), ∥g∥) (𝓝 0) (𝓝 0)

source

theorem continuous_norm {α : Type u_1} [normed_group α] :

continuous (λ (g : α), ∥g∥)

source

theorem filter.tendsto.norm {α : Type u_1} [normed_group α] {β : Type u_2} {l : filter β} {f : β → α} {a : α} :

filter.tendsto f l (𝓝 a) → filter.tendsto (λ (x : β), ∥f x∥) l (𝓝 ∥a∥)

source

theorem continuous.norm {α : Type u_1} {γ : Type u_3} [normed_group α] [topological_space γ] {f : γ → α} :

continuous f → continuous (λ (x : γ), ∥f x∥)

source

theorem continuous_nnnorm {α : Type u_1} [normed_group α] :

continuous nnnorm

source

theorem filter.tendsto.nnnorm {α : Type u_1} [normed_group α] {β : Type u_2} {l : filter β} {f : β → α} {a : α} :

filter.tendsto f l (𝓝 a) → filter.tendsto (λ (x : β), nnnorm (f x)) l (𝓝 (nnnorm a))

source

theorem eventually_ne_of_tendsto_norm_at_top {α : Type u_1} {γ : Type u_3} [normed_group α] {l : filter γ} {f : γ → α} (h : filter.tendsto (λ (y : γ), ∥f y∥) l filter.at_top) (x : α) :

∀ᶠ (y : γ) in l, f y ≠ x

If ∥y∥→∞, then we can assume y≠x for any fixed x.

source

@[instance]

def normed_uniform_group {α : Type u_1} [normed_group α] :

uniform_add_group α

A normed group is a uniform additive group, i.e., addition and subtraction are uniformly continuous.

source

@[instance]

def normed_top_monoid {α : Type u_1} [normed_group α] :

has_continuous_add α

source

@[instance]

def normed_top_group {α : Type u_1} [normed_group α] :

topological_add_group α

source

@[class]

structure normed_ring :

Type u_5 → Type u_5

to_has_norm : has_norm α
to_ring : ring α
to_metric_space : metric_space α
dist_eq : ∀ (x y : α), dist x y = ∥x - y∥
norm_mul : ∀ (a b : α), ∥a * b∥ ≤ ∥a∥ * ∥b∥

A normed ring is a ring endowed with a norm which satisfies the inequality ∥x y∥ ≤ ∥x∥ ∥y∥.

Instances

source

@[class]

structure normed_comm_ring :

Type u_5 → Type u_5

to_normed_ring : normed_ring α
mul_comm : ∀ (x y : α), x * y = y * x

A normed commutative ring is a commutative ring endowed with a norm which satisfies the inequality ∥x y∥ ≤ ∥x∥ ∥y∥.

Instances

source

@[class]

structure norm_one_class (α : Type u_5) [has_norm α] [has_one α] :

Prop

norm_one : ∥1∥ = 1

A mixin class with the axiom ∥1∥ = 1. Many normed_rings and all normed_fields satisfy this axiom.

Instances

source

@[simp]

theorem nnnorm_one {α : Type u_1} [normed_group α] [has_one α] [norm_one_class α] :

nnnorm 1 = 1

source

@[instance]

def normed_comm_ring.to_comm_ring {α : Type u_1} [β : normed_comm_ring α] :

comm_ring α

Equations

normed_comm_ring.to_comm_ring = {add := ring.add normed_ring.to_ring, add_assoc := _, zero := ring.zero normed_ring.to_ring, zero_add := _, add_zero := _, neg := ring.neg normed_ring.to_ring, add_left_neg := _, add_comm := _, mul := ring.mul normed_ring.to_ring, mul_assoc := _, one := ring.one normed_ring.to_ring, one_mul := _, mul_one := _, left_distrib := _, right_distrib := _, mul_comm := _}

source

@[instance]

def normed_ring.to_normed_group {α : Type u_1} [β : normed_ring α] :

normed_group α

Equations

normed_ring.to_normed_group = {to_has_norm := normed_ring.to_has_norm β, to_add_comm_group := {add := ring.add normed_ring.to_ring, add_assoc := _, zero := ring.zero normed_ring.to_ring, zero_add := _, add_zero := _, neg := ring.neg normed_ring.to_ring, add_left_neg := _, add_comm := _}, to_metric_space := normed_ring.to_metric_space β, dist_eq := _}

source

@[instance]

def prod.norm_one_class {α : Type u_1} {β : Type u_2} [normed_group α] [has_one α] [norm_one_class α] [normed_group β] [has_one β] [norm_one_class β] :

norm_one_class (α × β)

source

theorem norm_mul_le {α : Type u_1} [normed_ring α] (a b : α) :

∥a * b∥ ≤ ∥a∥ * ∥b∥

source

theorem list.norm_prod_le' {α : Type u_1} [normed_ring α] {l : list α} :

l ≠ list.nil → ∥l.prod ∥ ≤ (list.map norm l).prod

source

theorem list.norm_prod_le {α : Type u_1} [normed_ring α] [norm_one_class α] (l : list α) :

∥l.prod ∥ ≤ (list.map norm l).prod

source

theorem finset.norm_prod_le' {ι : Type u_4} {α : Type u_1} [normed_comm_ring α] (s : finset ι) (hs : s.nonempty) (f : ι → α) :

∥∏ (i : ι) in s, f i∥ ≤ ∏ (i : ι) in s, ∥f i∥

source

theorem finset.norm_prod_le {ι : Type u_4} {α : Type u_1} [normed_comm_ring α] [norm_one_class α] (s : finset ι) (f : ι → α) :

∥∏ (i : ι) in s, f i∥ ≤ ∏ (i : ι) in s, ∥f i∥

source

theorem norm_pow_le' {α : Type u_1} [normed_ring α] (a : α) {n : ℕ} :

0 < n → ∥a ^ n∥ ≤ ∥a∥ ^ n

If α is a normed ring, then ∥a^n∥≤ ∥a∥^n for n > 0. See also norm_pow_le.

source

theorem norm_pow_le {α : Type u_1} [normed_ring α] [norm_one_class α] (a : α) (n : ℕ) :

∥a ^ n∥ ≤ ∥a∥ ^ n

If α is a normed ring with ∥1∥=1, then ∥a^n∥≤ ∥a∥^n. See also norm_pow_le'.

source

theorem eventually_norm_pow_le {α : Type u_1} [normed_ring α] (a : α) :

∀ᶠ (n : ℕ) in filter.at_top, ∥a ^ n∥ ≤ ∥a∥ ^ n

source

theorem units.norm_pos {α : Type u_1} [normed_ring α] [nontrivial α] (x : units α) :

0 < ∥↑x∥

source

theorem mul_left_bound {α : Type u_1} [normed_ring α] (x y : α) :

∥⇑(add_monoid_hom.mul_left x) y∥ ≤ ∥x∥ * ∥y∥

In a normed ring, the left-multiplication add_monoid_hom is bounded.

source

theorem mul_right_bound {α : Type u_1} [normed_ring α] (x y : α) :

∥⇑(add_monoid_hom.mul_right x) y∥ ≤ ∥x∥ * ∥y∥

In a normed ring, the right-multiplication add_monoid_hom is bounded.

source

@[instance]

def prod.normed_ring {α : Type u_1} {β : Type u_2} [normed_ring α] [normed_ring β] :

normed_ring (α × β)

Normed ring structure on the product of two normed rings, using the sup norm.

Equations

prod.normed_ring = {to_has_norm := normed_group.to_has_norm prod.normed_group, to_ring := prod.ring normed_ring.to_ring, to_metric_space := normed_group.to_metric_space prod.normed_group, dist_eq := _, norm_mul := _}

source

@[instance]

def normed_ring_top_monoid {α : Type u_1} [normed_ring α] :

has_continuous_mul α

source

@[instance]

def normed_top_ring {α : Type u_1} [normed_ring α] :

topological_ring α

A normed ring is a topological ring.

source

@[class]

structure normed_field :

Type u_5 → Type u_5

to_has_norm : has_norm α
to_field : field α
to_metric_space : metric_space α
dist_eq : ∀ (x y : α), dist x y = ∥x - y∥
norm_mul' : ∀ (a b : α), ∥a * b∥ = ∥a∥ * ∥b∥

A normed field is a field with a norm satisfying ∥x y∥ = ∥x∥ ∥y∥.

Instances

source

@[class]

structure nondiscrete_normed_field :

Type u_5 → Type u_5

to_normed_field : normed_field α
non_trivial : ∃ (x : α), 1 < ∥x∥

A nondiscrete normed field is a normed field in which there is an element of norm different from 0 and 1. This makes it possible to bring any element arbitrarily close to 0 by multiplication by the powers of any element, and thus to relate algebra and topology.

Instances

source

@[simp]

theorem normed_field.norm_mul {α : Type u_1} [normed_field α] (a b : α) :

∥a * b∥ = ∥a∥ * ∥b∥

source

@[instance]

def normed_field.to_normed_comm_ring {α : Type u_1} [normed_field α] :

normed_comm_ring α

Equations

normed_field.to_normed_comm_ring = {to_normed_ring := {to_has_norm := normed_field.to_has_norm _inst_1, to_ring := {add := field.add normed_field.to_field, add_assoc := _, zero := field.zero normed_field.to_field, zero_add := _, add_zero := _, neg := field.neg normed_field.to_field, add_left_neg := _, add_comm := _, mul := field.mul normed_field.to_field, mul_assoc := _, one := field.one normed_field.to_field, one_mul := _, mul_one := _, left_distrib := _, right_distrib := _}, to_metric_space := normed_field.to_metric_space _inst_1, dist_eq := _, norm_mul := _}, mul_comm := _}

source

@[instance]

def normed_field.to_norm_one_class {α : Type u_1} [normed_field α] :

norm_one_class α

source

def normed_field.norm_hom {α : Type u_1} [normed_field α] :

α →* ℝ

norm as a monoid_hom.

Equations

normed_field.norm_hom = {to_fun := norm normed_field.to_has_norm, map_one' := _, map_mul' := _}

source

@[simp]

theorem normed_field.norm_hom_to_fun {α : Type u_1} [normed_field α] (a : α) :

⇑normed_field.norm_hom a = ∥a∥

source

@[simp]

theorem normed_field.norm_pow {α : Type u_1} [normed_field α] (a : α) (n : ℕ) :

∥a ^ n∥ = ∥a∥ ^ n

source

@[simp]

theorem normed_field.norm_prod {α : Type u_1} {β : Type u_2} [normed_field α] (s : finset β) (f : β → α) :

∥∏ (b : β) in s, f b∥ = ∏ (b : β) in s, ∥f b∥

source

@[simp]

theorem normed_field.norm_div {α : Type u_1} [normed_field α] (a b : α) :

∥a / b∥ = ∥a∥ / ∥b∥

source

@[simp]

theorem normed_field.norm_inv {α : Type u_1} [normed_field α] (a : α) :

∥a⁻¹ ∥ = ∥a∥⁻¹

source

@[simp]

theorem normed_field.nnnorm_inv {α : Type u_1} [normed_field α] (a : α) :

nnnorm a⁻¹ = (nnnorm a)⁻¹

source

@[simp]

theorem normed_field.norm_fpow {α : Type u_1} [normed_field α] (a : α) (n : ℤ) :

∥a ^ n∥ = ∥a∥ ^ n

source

theorem normed_field.tendsto_inv {α : Type u_1} [normed_field α] {r : α} :

r ≠ 0 → filter.tendsto (λ (q : α), q⁻¹) (𝓝 r) (𝓝 r⁻¹)

source

theorem normed_field.continuous_on_inv {α : Type u_1} [normed_field α] :

continuous_on (λ (x : α), x⁻¹) {x : α | x ≠ 0}

source

theorem normed_field.exists_one_lt_norm (α : Type u_1) [nondiscrete_normed_field α] :

∃ (x : α), 1 < ∥x∥

source

theorem normed_field.exists_norm_lt_one (α : Type u_1) [nondiscrete_normed_field α] :

∃ (x : α), 0 < ∥x∥ ∧ ∥x∥ < 1

source

theorem normed_field.exists_lt_norm (α : Type u_1) [nondiscrete_normed_field α] (r : ℝ) :

∃ (x : α), r < ∥x∥

source

theorem normed_field.exists_norm_lt (α : Type u_1) [nondiscrete_normed_field α] {r : ℝ} :

0 < r → (∃ (x : α), 0 < ∥x∥ ∧ ∥x∥ < r)

source

@[instance]

theorem normed_field.punctured_nhds_ne_bot {α : Type u_1} [nondiscrete_normed_field α] (x : α) :

(𝓝[{x}ᶜ ] x).ne_bot

source

@[instance]

theorem normed_field.nhds_within_is_unit_ne_bot {α : Type u_1} [nondiscrete_normed_field α] :

(𝓝[{x : α | is_unit x}] 0).ne_bot

source

@[instance]

def real.normed_field :

normed_field ℝ

Equations

real.normed_field = {to_has_norm := {norm := λ (x : ℝ), abs x}, to_field := real.field, to_metric_space := real.metric_space, dist_eq := real.normed_field._proof_1, norm_mul' := _}

source

@[instance]

def real.nondiscrete_normed_field :

nondiscrete_normed_field ℝ

Equations

real.nondiscrete_normed_field = {to_normed_field := real.normed_field, non_trivial := real.nondiscrete_normed_field._proof_1}

source

theorem filter.tendsto.inv' {α : Type u_1} {β : Type u_2} [normed_field α] {l : filter β} {f : β → α} {y : α} :

y ≠ 0 → filter.tendsto f l (𝓝 y) → filter.tendsto (λ (x : β), (f x)⁻¹) l (𝓝 y⁻¹)

If a function converges to a nonzero value, its inverse converges to the inverse of this value. We use the name tendsto.inv' as tendsto.inv is already used in multiplicative topological groups.

source

theorem continuous_at.inv' {α : Type u_1} {β : Type u_2} [topological_space α] [normed_field β] {f : α → β} {x : α} :

continuous_at f x → f x ≠ 0 → continuous_at (λ (x : α), (f x)⁻¹) x

source

theorem continuous_within_at.inv' {α : Type u_1} {β : Type u_2} [topological_space α] [normed_field β] {f : α → β} {x : α} {s : set α} :

continuous_within_at f s x → f x ≠ 0 → continuous_within_at (λ (x : α), (f x)⁻¹) s x

source

theorem continuous.inv' {α : Type u_1} {β : Type u_2} [topological_space α] [normed_field β] {f : α → β} :

continuous f → (∀ (x : α), f x ≠ 0) → continuous (λ (x : α), (f x)⁻¹)

source

theorem continuous_on.inv' {α : Type u_1} {β : Type u_2} [topological_space α] [normed_field β] {f : α → β} {s : set α} :

continuous_on f s → (∀ (x : α), x ∈ s → f x ≠ 0) → continuous_on (λ (x : α), (f x)⁻¹) s

source

theorem filter.tendsto.div_const {α : Type u_1} {β : Type u_2} [normed_field α] {l : filter β} {f : β → α} {x y : α} :

filter.tendsto f l (𝓝 x) → filter.tendsto (λ (a : β), f a / y) l (𝓝 (x / y))

source

theorem filter.tendsto.div {α : Type u_1} {β : Type u_2} [normed_field α] {l : filter β} {f g : β → α} {x y : α} :

filter.tendsto f l (𝓝 x) → filter.tendsto g l (𝓝 y) → y ≠ 0 → filter.tendsto (λ (a : β), f a / g a) l (𝓝 (x / y))

source

theorem continuous_within_at.div {α : Type u_1} {β : Type u_2} [topological_space α] [normed_field β] {f g : α → β} {s : set α} {x : α} :

continuous_within_at f s x → continuous_within_at g s x → g x ≠ 0 → continuous_within_at (λ (x : α), f x / g x) s x

source

theorem continuous_on.div {α : Type u_1} {β : Type u_2} [topological_space α] [normed_field β] {f g : α → β} {s : set α} :

continuous_on f s → continuous_on g s → (∀ (x : α), x ∈ s → g x ≠ 0) → continuous_on (λ (x : α), f x / g x) s

source

theorem continuous_at.div {α : Type u_1} {β : Type u_2} [topological_space α] [normed_field β] {f g : α → β} {x : α} :

continuous_at f x → continuous_at g x → g x ≠ 0 → continuous_at (λ (x : α), f x / g x) x

Continuity at a point of the result of dividing two functions continuous at that point, where the denominator is nonzero.

source

theorem continuous.div {α : Type u_1} {β : Type u_2} [topological_space α] [normed_field β] {f g : α → β} :

continuous f → continuous g → (∀ (x : α), g x ≠ 0) → continuous (λ (x : α), f x / g x)

source

theorem real.norm_eq_abs (r : ℝ) :

∥r∥ = abs r

source

theorem real.norm_of_nonneg {x : ℝ} :

0 ≤ x → ∥x∥ = x

source

@[simp]

theorem real.norm_coe_nat (n : ℕ) :

∥↑n∥ = ↑n

source

@[simp]

theorem real.nnnorm_coe_nat (n : ℕ) :

nnnorm ↑n = ↑n

source

@[simp]

theorem real.norm_two :

∥2∥ = 2

source

@[simp]

theorem real.nnnorm_two :

nnnorm 2 = 2

source

@[simp]

theorem real.nnreal.norm_eq (x : ℝ≥0) :

∥↑x∥ = ↑x

source

theorem real.nnnorm_coe_eq_self {x : ℝ≥0} :

nnnorm ↑x = x

source

theorem real.nnnorm_of_nonneg {x : ℝ} (hx : 0 ≤ x) :

nnnorm x = ⟨x, hx⟩

source

theorem real.ennnorm_eq_of_real {x : ℝ} :

0 ≤ x → ↑(nnnorm x) = ennreal.of_real x

source

@[simp]

theorem norm_norm {α : Type u_1} [normed_group α] (x : α) :

∥∥x∥∥ = ∥x∥

source

@[simp]

theorem nnnorm_norm {α : Type u_1} [normed_group α] (a : α) :

nnnorm ∥a∥ = nnnorm a

source

@[instance]

def int.normed_comm_ring :

normed_comm_ring ℤ

Equations

int.normed_comm_ring = {to_normed_ring := {to_has_norm := {norm := λ (n : ℤ), ∥↑n∥}, to_ring := int.ring, to_metric_space := int.metric_space, dist_eq := int.normed_comm_ring._proof_1, norm_mul := int.normed_comm_ring._proof_2}, mul_comm := _}

source

theorem int.norm_cast_real (m : ℤ) :

∥↑m∥ = ∥m∥

source

@[instance]

def int.norm_one_class :

norm_one_class ℤ

source

@[instance]

def rat.normed_field :

normed_field ℚ

Equations

rat.normed_field = {to_has_norm := {norm := λ (r : ℚ), ∥↑r∥}, to_field := rat.field, to_metric_space := rat.metric_space, dist_eq := rat.normed_field._proof_1, norm_mul' := rat.normed_field._proof_2}

source

@[instance]

def rat.nondiscrete_normed_field :

nondiscrete_normed_field ℚ

Equations

rat.nondiscrete_normed_field = {to_normed_field := rat.normed_field, non_trivial := rat.nondiscrete_normed_field._proof_1}

source

@[simp]

theorem rat.norm_cast_real (r : ℚ) :

∥↑r∥ = ∥r∥

source

@[simp]

theorem int.norm_cast_rat (m : ℤ) :

∥↑m∥ = ∥m∥

source

@[class]

structure normed_space (α : Type u_5) (β : Type u_6) [normed_field α] [normed_group β] :

Type (max u_5 u_6)

to_semimodule : semimodule α β
norm_smul_le : ∀ (a : α) (b : β), ∥a • b∥ ≤ ∥a∥ * ∥b∥

A normed space over a normed field is a vector space endowed with a norm which satisfies the equality ∥c • x∥ = ∥c∥ ∥x∥. We require only ∥c • x∥ ≤ ∥c∥ ∥x∥ in the definition, then prove ∥c • x∥ = ∥c∥ ∥x∥ in norm_smul.

Instances

source

@[instance]

def normed_field.to_normed_space {α : Type u_1} [normed_field α] :

normed_space α α

Equations

normed_field.to_normed_space = {to_semimodule := semiring.to_semimodule ring.to_semiring, norm_smul_le := _}

source

theorem norm_smul {α : Type u_1} {β : Type u_2} [normed_field α] [normed_group β] [normed_space α β] (s : α) (x : β) :

∥s • x∥ = ∥s∥ * ∥x∥

source

@[simp]

theorem abs_norm_eq_norm {β : Type u_2} [normed_group β] (z : β) :

abs ∥z∥ = ∥z∥

source

theorem dist_smul {α : Type u_1} {β : Type u_2} [normed_field α] [normed_group β] [normed_space α β] (s : α) (x y : β) :

dist (s • x) (s • y) = ∥s∥ * dist x y

source

theorem nnnorm_smul {α : Type u_1} {β : Type u_2} [normed_field α] [normed_group β] [normed_space α β] (s : α) (x : β) :

nnnorm (s • x) = (nnnorm s) * nnnorm x

source

theorem nndist_smul {α : Type u_1} {β : Type u_2} [normed_field α] [normed_group β] [normed_space α β] (s : α) (x y : β) :

nndist (s • x) (s • y) = (nnnorm s) * nndist x y

source

theorem norm_smul_of_nonneg {β : Type u_2} [normed_group β] [normed_space ℝ β] {t : ℝ} (ht : 0 ≤ t) (x : β) :

∥t • x∥ = t * ∥x∥

source

@[instance]

def normed_space.topological_vector_space {α : Type u_1} [normed_field α] {E : Type u_5} [normed_group E] [normed_space α E] :

topological_vector_space α E

source

theorem closure_ball {E : Type u_5} [normed_group E] [normed_space ℝ E] (x : E) {r : ℝ} :

0 < r → closure (metric.ball x r) = metric.closed_ball x r

source

theorem frontier_ball {E : Type u_5} [normed_group E] [normed_space ℝ E] (x : E) {r : ℝ} :

0 < r → frontier (metric.ball x r) = metric.sphere x r

source

theorem interior_closed_ball {E : Type u_5} [normed_group E] [normed_space ℝ E] (x : E) {r : ℝ} :

0 < r → interior (metric.closed_ball x r) = metric.ball x r

source

theorem interior_closed_ball' {E : Type u_5} [normed_group E] [normed_space ℝ E] [nontrivial E] (x : E) (r : ℝ) :

interior (metric.closed_ball x r) = metric.ball x r

source

theorem frontier_closed_ball {E : Type u_5} [normed_group E] [normed_space ℝ E] (x : E) {r : ℝ} :

0 < r → frontier (metric.closed_ball x r) = metric.sphere x r

source

theorem frontier_closed_ball' {E : Type u_5} [normed_group E] [normed_space ℝ E] [nontrivial E] (x : E) (r : ℝ) :

frontier (metric.closed_ball x r) = metric.sphere x r

source

theorem rescale_to_shell {α : Type u_1} [normed_field α] {E : Type u_5} [normed_group E] [normed_space α E] {c : α} (hc : 1 < ∥c∥) {ε : ℝ} (εpos : 0 < ε) {x : E} :

x ≠ 0 → (∃ (d : α), d ≠ 0 ∧ ∥d • x∥ ≤ ε ∧ ε / ∥c∥ ≤ ∥d • x∥ ∧ ∥d∥⁻¹ ≤ (ε⁻¹ * ∥c∥) * ∥x∥)

If there is a scalar c with ∥c∥>1, then any element can be moved by scalar multiplication to any shell of width ∥c∥. Also recap information on the norm of the rescaling element that shows up in applications.

source

@[instance]

def prod.normed_space {α : Type u_1} [normed_field α] {E : Type u_5} {F : Type u_6} [normed_group E] [normed_space α E] [normed_group F] [normed_space α F] :

normed_space α (E × F)

The product of two normed spaces is a normed space, with the sup norm.

Equations

prod.normed_space = {to_semimodule := {to_distrib_mul_action := {to_mul_action := distrib_mul_action.to_mul_action semimodule.to_distrib_mul_action, smul_add := _, smul_zero := _}, add_smul := _, zero_smul := _}, norm_smul_le := _}

source

@[instance]

def pi.normed_space {α : Type u_1} {ι : Type u_4} [normed_field α] {E : ι → Type u_2} [fintype ι] [Π (i : ι), normed_group (E i)] [Π (i : ι), normed_space α (E i)] :

normed_space α (Π (i : ι), E i)

The product of finitely many normed spaces is a normed space, with the sup norm.

Equations

pi.normed_space = {to_semimodule := pi.semimodule ι (λ (i : ι), E i) α (λ (i : ι), normed_space.to_semimodule), norm_smul_le := _}

source

@[instance]

def submodule.normed_space {𝕜 : Type u_1} [normed_field 𝕜] {E : Type u_2} [normed_group E] [normed_space 𝕜 E] (s : submodule 𝕜 E) :

normed_space 𝕜 ↥s

A subspace of a normed space is also a normed space, with the restriction of the norm.

Equations

s.normed_space = {to_semimodule := submodule.restricted_module 𝕜 𝕜 E s, norm_smul_le := _}

source

@[class]

structure normed_algebra (𝕜 : Type u_5) (𝕜' : Type u_6) [normed_field 𝕜] [normed_ring 𝕜'] :

Type (max u_5 u_6)

to_algebra : algebra 𝕜 𝕜'
norm_algebra_map_eq : ∀ (x : 𝕜), ∥⇑(algebra_map 𝕜 𝕜') x∥ = ∥x∥

A normed algebra 𝕜' over 𝕜 is an algebra endowed with a norm for which the embedding of 𝕜 in 𝕜' is an isometry.

Instances

source

@[simp]

theorem norm_algebra_map_eq {𝕜 : Type u_1} (𝕜' : Type u_2) [normed_field 𝕜] [normed_ring 𝕜'] [h : normed_algebra 𝕜 𝕜'] (x : 𝕜) :

∥⇑(algebra_map 𝕜 𝕜') x∥ = ∥x∥

source

@[instance]

def normed_algebra.to_normed_space (𝕜 : Type u_5) [normed_field 𝕜] (𝕜' : Type u_6) [normed_ring 𝕜'] [h : normed_algebra 𝕜 𝕜'] :

normed_space 𝕜 𝕜'

Equations

normed_algebra.to_normed_space 𝕜 𝕜' = {to_semimodule := algebra.to_semimodule normed_algebra.to_algebra, norm_smul_le := _}

source

@[instance]

def normed_algebra.id (𝕜 : Type u_5) [normed_field 𝕜] :

normed_algebra 𝕜 𝕜

Equations

normed_algebra.id 𝕜 = {to_algebra := {to_has_scalar := algebra.to_has_scalar (algebra.id 𝕜), to_ring_hom := algebra.to_ring_hom (algebra.id 𝕜), commutes' := _, smul_def' := _}, norm_algebra_map_eq := _}

source

@[simp]

theorem normed_algebra.norm_one (𝕜 : Type u_5) [normed_field 𝕜] {𝕜' : Type u_6} [normed_ring 𝕜'] [normed_algebra 𝕜 𝕜'] :

∥1∥ = 1

source

theorem normed_algebra.norm_one_class (𝕜 : Type u_5) [normed_field 𝕜] {𝕜' : Type u_6} [normed_ring 𝕜'] [normed_algebra 𝕜 𝕜'] :

norm_one_class 𝕜'

source

theorem normed_algebra.zero_ne_one (𝕜 : Type u_5) [normed_field 𝕜] {𝕜' : Type u_6} [normed_ring 𝕜'] [normed_algebra 𝕜 𝕜'] :

0 ≠ 1

source

theorem normed_algebra.nontrivial (𝕜 : Type u_5) [normed_field 𝕜] {𝕜' : Type u_6} [normed_ring 𝕜'] [normed_algebra 𝕜 𝕜'] :

nontrivial 𝕜'

source

def normed_space.restrict_scalars (𝕜 : Type u_5) (𝕜' : Type u_6) [normed_field 𝕜] [normed_field 𝕜'] [normed_algebra 𝕜 𝕜'] (E : Type u_7) [normed_group E] [normed_space 𝕜' E] :

normed_space 𝕜 E

Warning: This declaration should be used judiciously. Please consider using is_scalar_tower instead.

𝕜-normed space structure induced by a 𝕜'-normed space structure when 𝕜' is a normed algebra over 𝕜. Not registered as an instance as 𝕜' can not be inferred.

The type synonym semimodule.restrict_scalars 𝕜 𝕜' E will be endowed with this instance by default.

Equations

normed_space.restrict_scalars 𝕜 𝕜' E = {to_semimodule := {to_distrib_mul_action := semimodule.to_distrib_mul_action (restrict_scalars.semimodule 𝕜 𝕜' E), add_smul := _, zero_smul := _}, norm_smul_le := _}

source

@[instance]

def restrict_scalars.normed_group {𝕜 : Type u_1} {𝕜' : Type u_2} {E : Type u_3} [I : normed_group E] :

normed_group (restrict_scalars 𝕜 𝕜' E)

Equations

restrict_scalars.normed_group = I

source

@[instance]

def semimodule.restrict_scalars.normed_space_orig {𝕜 : Type u_1} {𝕜' : Type u_2} {E : Type u_3} [normed_field 𝕜'] [normed_group E] [I : normed_space 𝕜' E] :

normed_space 𝕜' (restrict_scalars 𝕜 𝕜' E)

Equations

semimodule.restrict_scalars.normed_space_orig = I

source

@[instance]

def restrict_scalars.normed_space (𝕜 : Type u_5) (𝕜' : Type u_6) [normed_field 𝕜] [normed_field 𝕜'] [normed_algebra 𝕜 𝕜'] (E : Type u_7) [normed_group E] [normed_space 𝕜' E] :

normed_space 𝕜 (restrict_scalars 𝕜 𝕜' E)

Equations

restrict_scalars.normed_space 𝕜 𝕜' E = normed_space.restrict_scalars 𝕜 𝕜' E

source

theorem cauchy_seq_finset_iff_vanishing_norm {α : Type u_1} {ι : Type u_4} [normed_group α] {f : ι → α} :

cauchy_seq (λ (s : finset ι), ∑ (i : ι) in s, f i) ↔ ∀ (ε : ℝ), ε > 0 → (∃ (s : finset ι), ∀ (t : finset ι), disjoint t s → ∥∑ (i : ι) in t, f i∥ < ε)

source

theorem summable_iff_vanishing_norm {α : Type u_1} {ι : Type u_4} [normed_group α] [complete_space α] {f : ι → α} :

summable f ↔ ∀ (ε : ℝ), ε > 0 → (∃ (s : finset ι), ∀ (t : finset ι), disjoint t s → ∥∑ (i : ι) in t, f i∥ < ε)

source

theorem cauchy_seq_finset_of_norm_bounded {α : Type u_1} {ι : Type u_4} [normed_group α] {f : ι → α} (g : ι → ℝ) :

summable g → (∀ (i : ι), ∥f i∥ ≤ g i) → cauchy_seq (λ (s : finset ι), ∑ (i : ι) in s, f i)

source

theorem cauchy_seq_finset_of_summable_norm {α : Type u_1} {ι : Type u_4} [normed_group α] {f : ι → α} :

summable (λ (a : ι), ∥f a∥) → cauchy_seq (λ (s : finset ι), ∑ (a : ι) in s, f a)

source

theorem has_sum_of_subseq_of_summable {α : Type u_1} {γ : Type u_3} {ι : Type u_4} [normed_group α] {f : ι → α} (hf : summable (λ (a : ι), ∥f a∥)) {s : γ → finset ι} {p : filter γ} [p.ne_bot] (hs : filter.tendsto s p filter.at_top) {a : α} :

filter.tendsto (λ (b : γ), ∑ (i : ι) in s b, f i) p (𝓝 a) → has_sum f a

If a function f is summable in norm, and along some sequence of finsets exhausting the space its sum is converging to a limit a, then this holds along all finsets, i.e., f is summable with sum a.

source

theorem norm_tsum_le_tsum_norm {α : Type u_1} {ι : Type u_4} [normed_group α] {f : ι → α} :

summable (λ (i : ι), ∥f i∥) → (∥(∑' (i : ι), f i)∥ ≤ ∑' (i : ι), ∥f i∥)

If ∑' i, ∥f i∥ is summable, then ∥(∑' i, f i)∥ ≤ (∑' i, ∥f i∥). Note that we do not assume that ∑' i, f i is summable, and it might not be the case if α is not a complete space.

source

theorem has_sum_iff_tendsto_nat_of_summable_norm {α : Type u_1} [normed_group α] {f : ℕ → α} {a : α} :

summable (λ (i : ℕ), ∥f i∥) → (has_sum f a ↔ filter.tendsto (λ (n : ℕ), ∑ (i : ℕ) in finset.range n, f i) filter.at_top (𝓝 a))

source

theorem summable_of_norm_bounded {α : Type u_1} {ι : Type u_4} [normed_group α] [complete_space α] {f : ι → α} (g : ι → ℝ) :

summable g → (∀ (i : ι), ∥f i∥ ≤ g i) → summable f

The direct comparison test for series: if the norm of f is bounded by a real function g which is summable, then f is summable.

source

theorem tsum_of_norm_bounded {α : Type u_1} {ι : Type u_4} [normed_group α] {f : ι → α} {g : ι → ℝ} {a : ℝ} :

has_sum g a → (∀ (i : ι), ∥f i∥ ≤ g i) → ∥(∑' (i : ι), f i)∥ ≤ a

Quantitative result associated to the direct comparison test for series: If ∑' i, g i is summable, and for all i, ∥f i∥ ≤ g i, then ∥(∑' i, f i)∥ ≤ (∑' i, g i). Note that we do not assume that ∑' i, f i is summable, and it might not be the case if α is not a complete space.

source

theorem summable_of_norm_bounded_eventually {α : Type u_1} {ι : Type u_4} [normed_group α] [complete_space α] {f : ι → α} (g : ι → ℝ) :

summable g → (∀ᶠ (i : ι) in filter.cofinite, ∥f i∥ ≤ g i) → summable f

Variant of the direct comparison test for series: if the norm of f is eventually bounded by a real function g which is summable, then f is summable.

source

theorem summable_of_nnnorm_bounded {α : Type u_1} {ι : Type u_4} [normed_group α] [complete_space α] {f : ι → α} (g : ι → ℝ≥0) :

summable g → (∀ (i : ι), nnnorm (f i) ≤ g i) → summable f

source

theorem summable_of_summable_norm {α : Type u_1} {ι : Type u_4} [normed_group α] [complete_space α] {f : ι → α} :

summable (λ (a : ι), ∥f a∥) → summable f

source

theorem summable_of_summable_nnnorm {α : Type u_1} {ι : Type u_4} [normed_group α] [complete_space α] {f : ι → α} :

summable (λ (a : ι), nnnorm (f a)) → summable f

mathlib documentation

Normed spaces