The Minkowski functional, normed field version

In this file we define (egauge 𝕜 s ·) to be the Minkowski functional (gauge) of the set s in a topological vector space E over a normed field 𝕜, as a function E → ℝ≥0∞.

It is defined as the infimum of the norms of c : 𝕜 such that x ∈ c • s. In particular, for 𝕜 = ℝ≥0 this definition gives an ℝ≥0∞-valued version of gauge defined in Mathlib/Analysis/Convex/Gauge.lean.

This definition can be used to generalize the notion of Fréchet derivative to maps between topological vector spaces without norms.

Currently, we can't reuse results about egauge for gauge, because we lack a theory of normed semifields.

noncomputable def egauge (𝕜 : Type u_1) [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] (s : Set E) (x : E) : ENNReal

The Minkowski functional for vector spaces over normed fields. Given a set s in a vector space over a normed field 𝕜, egauge s is the functional which sends x : E to the infimum of ‖c‖₊ over c such that x belongs to s scaled by c.

The definition only requires 𝕜 to have a NNNorm instance and (· • ·) : 𝕜 → E → E to be defined. This way the definition applies, e.g., to 𝕜 = ℝ≥0. For 𝕜 = ℝ≥0, the function is equal (up to conversion to ℝ) to the usual Minkowski functional defined in gauge.

Equations

• egauge 𝕜 s x = ⨅ (c : 𝕜), ⨅ (_ : x ∈ c • s), ↑‖c‖₊

theorem egauge_anti (𝕜 : Type u_1) [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] {s t : Set E} (h : s ⊆ t) (x : E) : egauge 𝕜 t x ≤ egauge 𝕜 s x

@[simp]

theorem egauge_empty (𝕜 : Type u_1) [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] (x : E) : egauge 𝕜 ∅ x = ⊤

theorem egauge_le_of_mem_smul {𝕜 : Type u_1} [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] {c : 𝕜} {s : Set E} {x : E} (h : x ∈ c • s) : egauge 𝕜 s x ≤ ↑‖c‖₊

theorem le_egauge_iff {𝕜 : Type u_1} [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] {s : Set E} {x : E} {r : ENNReal} : r ≤ egauge 𝕜 s x ↔ ∀ (c : 𝕜), x ∈ c • s → r ≤ ↑‖c‖₊

theorem egauge_eq_top {𝕜 : Type u_1} [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] {s : Set E} {x : E} : egauge 𝕜 s x = ⊤ ↔ ∀ (c : 𝕜), x ∉ c • s

theorem egauge_lt_iff {𝕜 : Type u_1} [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] {s : Set E} {x : E} {r : ENNReal} : egauge 𝕜 s x < r ↔ ∃ (c : 𝕜), x ∈ c • s ∧ ↑‖c‖₊ < r

theorem egauge_union {𝕜 : Type u_1} [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] (s t : Set E) (x : E) : egauge 𝕜 (s ∪ t) x = egauge 𝕜 s x ⊓ egauge 𝕜 t x

theorem le_egauge_inter {𝕜 : Type u_1} [NNNorm 𝕜] {E : Type u_2} [SMul 𝕜 E] (s t : Set E) (x : E) : egauge 𝕜 s x ⊔ egauge 𝕜 t x ≤ egauge 𝕜 (s ∩ t) x

@[simp]

theorem egauge_zero_left_eq_top (𝕜 : Type u_1) [NNNorm 𝕜] [Nonempty 𝕜] {E : Type u_2} [Zero E] [SMulZeroClass 𝕜 E] {x : E} : egauge 𝕜 0 x = ⊤ ↔ x ≠ 0

@[simp]

theorem egauge_zero_left (𝕜 : Type u_1) [NNNorm 𝕜] [Nonempty 𝕜] {E : Type u_2} [Zero E] [SMulZeroClass 𝕜 E] {x : E} : x ≠ 0 → egauge 𝕜 0 x = ⊤

Alias of the reverse direction of egauge_zero_left_eq_top.

theorem egauge_le_of_smul_mem_of_ne {𝕜 : Type u_1} [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] {c : 𝕜} {s : Set E} {x : E} (h : c • x ∈ s) (hc : c ≠ 0) : egauge 𝕜 s x ≤ ↑‖c‖₊⁻¹

If c • x ∈ s and c ≠ 0, then egauge 𝕜 s x is at most `((‖c‖₊⁻¹ : ℝ≥0) : ℝ≥0∞).

See also egauge_le_of_smul_mem.

theorem egauge_le_of_smul_mem {𝕜 : Type u_1} [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] {c : 𝕜} {s : Set E} {x : E} (h : c • x ∈ s) : egauge 𝕜 s x ≤ (↑‖c‖₊)⁻¹

If c • x ∈ s, then egauge 𝕜 s x is at most `(‖c‖₊ : ℝ≥0∞)⁻¹.

See also egauge_le_of_smul_mem_of_ne.

theorem mem_of_egauge_lt_one {𝕜 : Type u_1} [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] {s : Set E} {x : E} (hs : Balanced 𝕜 s) (hx : egauge 𝕜 s x < 1) : x ∈ s

theorem egauge_eq_zero_iff {𝕜 : Type u_1} [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] {s : Set E} {x : E} : egauge 𝕜 s x = 0 ↔ ∃ᶠ (c : 𝕜) in nhds 0, x ∈ c • s

@[simp]

theorem egauge_zero_right (𝕜 : Type u_1) [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] {s : Set E} (hs : s.Nonempty) : egauge 𝕜 s 0 = 0

theorem egauge_zero_zero (𝕜 : Type u_1) [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] : egauge 𝕜 0 0 = 0

theorem egauge_le_one (𝕜 : Type u_1) [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] {s : Set E} {x : E} (h : x ∈ s) : egauge 𝕜 s x ≤ 1

theorem le_egauge_smul_left {𝕜 : Type u_1} [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] (c : 𝕜) (s : Set E) (x : E) : egauge 𝕜 s x / ↑‖c‖₊ ≤ egauge 𝕜 (c • s) x

theorem egauge_smul_left {𝕜 : Type u_1} [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] {c : 𝕜} (hc : c ≠ 0) (s : Set E) (x : E) : egauge 𝕜 (c • s) x = egauge 𝕜 s x / ↑‖c‖₊

theorem le_egauge_smul_right {𝕜 : Type u_1} [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] (c : 𝕜) (s : Set E) (x : E) : ↑‖c‖₊ * egauge 𝕜 s x ≤ egauge 𝕜 s (c • x)

theorem egauge_smul_right {𝕜 : Type u_1} [NormedDivisionRing 𝕜] {E : Type u_2} [AddCommGroup E] [Module 𝕜 E] {c : 𝕜} {s : Set E} (h : c = 0 → s.Nonempty) (x : E) : egauge 𝕜 s (c • x) = ↑‖c‖₊ * egauge 𝕜 s x

theorem div_le_egauge_closedBall (𝕜 : Type u_1) [NormedField 𝕜] {E : Type u_2} [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] (r : NNReal) (x : E) : ↑‖x‖₊ / ↑r ≤ egauge 𝕜 (Metric.closedBall 0 ↑r) x

theorem le_egauge_closedBall_one (𝕜 : Type u_1) [NormedField 𝕜] {E : Type u_2} [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] (x : E) : ↑‖x‖₊ ≤ egauge 𝕜 (Metric.closedBall 0 1) x

theorem div_le_egauge_ball (𝕜 : Type u_1) [NormedField 𝕜] {E : Type u_2} [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] (r : NNReal) (x : E) : ↑‖x‖₊ / ↑r ≤ egauge 𝕜 (Metric.ball 0 ↑r) x

theorem le_egauge_ball_one (𝕜 : Type u_1) [NormedField 𝕜] {E : Type u_2} [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] (x : E) : ↑‖x‖₊ ≤ egauge 𝕜 (Metric.ball 0 1) x

theorem egauge_ball_le_of_one_lt_norm {𝕜 : Type u_1} [NormedField 𝕜] {E : Type u_2} [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] {c : 𝕜} {x : E} {r : NNReal} (hc : 1 < ‖c‖) (h₀ : r ≠ 0 ∨ ‖x‖ ≠ 0) : egauge 𝕜 (Metric.ball 0 ↑r) x ≤ ↑‖c‖₊ * ↑‖x‖₊ / ↑r

theorem egauge_ball_one_le_of_one_lt_norm {𝕜 : Type u_1} [NormedField 𝕜] {E : Type u_2} [SeminormedAddCommGroup E] [NormedSpace 𝕜 E] {c : 𝕜} (hc : 1 < ‖c‖) (x : E) : egauge 𝕜 (Metric.ball 0 1) x ≤ ↑‖c‖₊ * ↑‖x‖₊