Rising sun lemma
DefinitionRising sun set#✓fully proved
For real numbers \(a, b\) and a function \(f : \mathbb{R} \to \mathbb{R}\), the rising sun set of \(f\) on \((a, b)\) is the set of points \(x \in (a, b)\) for which there is some \(t\) with \(x < t \le b\) and \(f(x) < f(t)\).
def risingSunSet (a b : ℝ) (f : ℝ → ℝ) : Set ℝ :=
{x | x ∈ Ioo a b ∧ ∃ t ∈ Icc x b, x < t ∧ f x < f t}
Used by 1
DefinitionRising sun decomposition#✓fully proved
A set \(E \subseteq \mathbb{R}\) has a rising sun decomposition for a function \(f : \mathbb{R} \to \mathbb{R}\) if there are sequences \((c_n)_{n \in \mathbb{N}}\) and \((d_n)_{n \in \mathbb{N}}\) of real numbers such that \(E\) is the union of the open intervals \((c_n, d_n)\), these intervals are pairwise disjoint, and \(f(c_n) \le f(d_n)\) for every \(n\).
No condition \(c_n < d_n\) is imposed, so some of the intervals may be empty.
def HasRisingSunDecomposition (E : Set ℝ) (f : ℝ → ℝ) : Prop :=
∃ c d : ℕ → ℝ,
E = ⋃ n : ℕ, Ioo (c n) (d n) ∧
(Set.PairwiseDisjoint (Set.univ : Set ℕ) fun n => Ioo (c n) (d n)) ∧
∀ n : ℕ, f (c n) ≤ f (d n)
Used by 1
DefinitionRising sun property#✓fully proved
Let \(a, b\) be real numbers, let \(f : \mathbb{R} \to \mathbb{R}\), and let \(S\) be the rising sun set of \(f\) on \((a, b)\). Then \(f\) has the rising sun property on \([a, b]\) if \(S\) is open, \(S\) is empty if and only if \(f\) is antitone (non-increasing) on \([a, b]\), and, whenever \(S\) is nonempty, \(S\) has a rising sun decomposition for \(f\).
def HasRisingSunProperty (a b : ℝ) (f : ℝ → ℝ) : Prop :=
IsOpen (risingSunSet a b f) ∧
(risingSunSet a b f = ∅ ↔ AntitoneOn f (Icc a b)) ∧
((risingSunSet a b f).Nonempty → HasRisingSunDecomposition (risingSunSet a b f) f)
def risingSunSet (a b : ℝ) (f : ℝ → ℝ) : Set ℝ :=
{x | x ∈ Ioo a b ∧ ∃ t ∈ Icc x b, x < t ∧ f x < f t}
WantedExt/Analysis/RisingSunWanted.lean:61
def HasRisingSunDecomposition (E : Set ℝ) (f : ℝ → ℝ) : Prop :=
∃ c d : ℕ → ℝ,
E = ⋃ n : ℕ, Ioo (c n) (d n) ∧
(Set.PairwiseDisjoint (Set.univ : Set ℕ) fun n => Ioo (c n) (d n)) ∧
∀ n : ℕ, f (c n) ≤ f (d n)
WantedExt/Analysis/RisingSunWanted.lean:66
Uses 2 · Used by 1
TheoremRiesz's rising sun lemma#●ready to prove
Let \(a < b\) be real numbers and let \(f : \mathbb{R} \to \mathbb{R}\) be continuous on \([a, b]\). Then \(f\) has the rising sun property on \([a, b]\).
public theorem_wanted rising_sun_lemma {a b : ℝ} (hab : a < b) {f : ℝ → ℝ}
(hf : ContinuousOn f (Icc a b)) :
HasRisingSunProperty a b f
def HasRisingSunProperty (a b : ℝ) (f : ℝ → ℝ) : Prop :=
IsOpen (risingSunSet a b f) ∧
(risingSunSet a b f = ∅ ↔ AntitoneOn f (Icc a b)) ∧
((risingSunSet a b f).Nonempty → HasRisingSunDecomposition (risingSunSet a b f) f)
WantedExt/Analysis/RisingSunWanted.lean:73
Sources
- F. Riesz (1932). Knill, §163. Problem
rising_sun_lemmaof the lean-eval benchmark.
Uses 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.