How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The oscillation of on a set and the oscillation at a point, both taken in the extended reals
Definition
Let and let . All suprema and infima below are taken in the extended real line (The extended real line , its order, and the arithmetic that is left undefined), where every subset has a least upper bound and a greatest lower bound (Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in ); no boundedness hypothesis on is therefore needed anywhere, and none is imposed.
Oscillation on a set. For put
Oscillation at a point. For put
where is the -neighbourhood of (The -neighbourhood and the punctured -neighbourhood of a point of ).
The two uses of the symbol are distinguished by their argument: a subset of in the first, a point of in the second. Where confusion is possible the first is written with named as a set.
Both values are well posed; point oscillation and nonempty-set oscillation are nonnegative
The set in the first display is nonempty whenever is, since gives the value ; so for nonempty , and for (Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in ). Only nonempty occurs below.
The set in the second display is nonempty, since some real exists, and each of its members is : for the set contains itself, because , so it is nonempty and (Basic properties of the absolute value). Hence is a lower bound of that set and
the second inequality because is a lower bound of the set of which is a member. In particular is never .
Monotonicity, and the case of a bounded
is monotone under inclusion. If then every value with is also a value with , so the first set of values is contained in the second and : a supremum of a subset is at most the supremum of the set. Consequently is nondecreasing in , since gives (The -neighbourhood and the punctured -neighbourhood of a point of ).
When is bounded, nonempty-set and point oscillations are real. Suppose there is a real with for every (Lower bound, bounded below, bounded set). Then for ,
(The triangle inequality, Basic properties of the absolute value), so for every . If is nonempty, is a real number in , and every point oscillation is also a real number in : the supremum of a nonempty subset of that is bounded above in is the real supremum (Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in , Complete ordered field (least-upper-bound property), Greatest lower bound (infimum)). The convention remains the single empty-set exception. Apart from that exception, an infinite extended value can occur only when is unbounded.
The notation. The letter is throughout this library, never "", and the function is always in the subscript.
Depends on
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
- Lower bound, bounded below, bounded set
- Greatest lower bound (infimum)
- Basic properties of the absolute value
- The triangle inequality
- Complete ordered field (least-upper-bound property)
Used by
- For bounded f on [a,b] and a partition P: the infimum mᵢ and supremum Mᵢ of f on the i-th subinterval, and the lower and upper Darboux sums L(f,P) = ∑ᵢ mᵢ Δᵢ and U(f,P) = ∑ᵢ Mᵢ Δᵢ Definition
- Oscillation of a real function on subsets of ℝᵐ and at a point Definition
- The function equal to q at a rational p/q in lowest terms and to 0 at every irrational is finite at every point and unbounded on every nondegenerate interval Example
- Thomae's function computed: t(1/2) = 1/2, t(2/3) = 1/3, t(m) = 1 at every integer m, t(x) = 0 at every irrational, and ωₜ(c) = t(c) at every real c Example
- For every real ε > 0 the set { x ∈ A : ω_f(x) ≥ ε } is the intersection with A of a closed subset of ℝ; in particular it is closed in ℝ when A = ℝ Lemma
- Baire's theorem: a Baire class one function on a closed bounded interval [a,b] is continuous at the points of a dense subset of [a,b] that is the trace of a G_δ set, so its set of discontinuities is meager Theorem
- f : A → ℝ is continuous at c ∈ A if and only if ω_f(c) = 0 Theorem
- For f : A → ℝ the set of points of A at which f is discontinuous is the intersection with A of an F_σ subset of ℝ, and the set of points at which f is continuous is the intersection with A of a G_δ subset; for A = ℝ the two sets are F_σ and G_δ outright Theorem
- If f is integrable on [a,b] with values in [m,M] and φ is continuous on [m,M], then φ ∘ f is integrable Theorem
- Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero Theorem
- The Dirichlet function is continuous at no point of ℝ, and Thomae's function is continuous at every irrational and at no rational, so its set of continuity points is exactly the set of irrationals and its oscillation at c equals t(c) Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 32 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Oscillation (mathematics) (Wikipedia) (standard reference, not scraped)