Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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 ωf(S)=sup{f(x)f(y):x,yS}\omega_f(S) = \sup\{\,|f(x) - f(y)| : x, y \in S\,\} of ff on a set and the oscillation ωf(c)=infδ>0ωf(ANδ(c))\omega_f(c) = \inf_{\delta > 0} \omega_f(A \cap N_\delta(c)) at a point, both taken in the extended reals

Definition

Let ARA \subseteq \mathbb{R} and let f:ARf : A \to \mathbb{R}. All suprema and infima below are taken in the extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\} (The extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}, 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 R\overline{\mathbb{R}} has a least upper bound and a greatest lower bound in R\overline{\mathbb{R}}, agreeing with the real supremum and infimum on nonempty sets bounded in R\mathbb{R}); no boundedness hypothesis on ff is therefore needed anywhere, and none is imposed.

Oscillation on a set. For SAS \subseteq A put

ωf(S)  :=  sup{f(x)f(y)  :  x,yS}    R.\omega_f(S) \;:=\; \sup\{\, |f(x) - f(y)| \;:\; x, y \in S \,\} \;\in\; \overline{\mathbb{R}} .

Oscillation at a point. For cAc \in A put

ωf(c)  :=  inf{ωf(ANδ(c))  :  δR, δ>0}    R,\omega_f(c) \;:=\; \inf\{\, \omega_f(A \cap N_\delta(c)) \;:\; \delta \in \mathbb{R},\ \delta > 0 \,\} \;\in\; \overline{\mathbb{R}},

where Nδ(c)=(cδ,c+δ)N_\delta(c) = (c - \delta, c + \delta) is the δ\delta-neighbourhood of cc (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

The two uses of the symbol ωf\omega_f are distinguished by their argument: a subset of AA in the first, a point of AA in the second. Where confusion is possible the first is written ωf(S)\omega_f(S) with SS 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 SS is, since x=ySx = y \in S gives the value f(x)f(x)=0|f(x) - f(x)| = 0; so ωf(S)0\omega_f(S) \ge 0 for nonempty SS, and ωf(S)=sup=\omega_f(S) = \sup \varnothing = -\infty for S=S = \varnothing (Every subset of R\overline{\mathbb{R}} has a least upper bound and a greatest lower bound in R\overline{\mathbb{R}}, agreeing with the real supremum and infimum on nonempty sets bounded in R\mathbb{R}). Only nonempty SS occurs below.

The set in the second display is nonempty, since some real δ>0\delta > 0 exists, and each of its members is 0\ge 0: for cAc \in A the set ANδ(c)A \cap N_\delta(c) contains cc itself, because cc=0<δ|c - c| = 0 < \delta, so it is nonempty and ωf(ANδ(c))0\omega_f(A \cap N_\delta(c)) \ge 0 (Basic properties of the absolute value). Hence 00 is a lower bound of that set and

0    ωf(c)    ωf(ANδ(c))for every real δ>0,0 \;\le\; \omega_f(c) \;\le\; \omega_f(A \cap N_\delta(c)) \qquad \text{for every real } \delta > 0,

the second inequality because ωf(c)\omega_f(c) is a lower bound of the set of which ωf(ANδ(c))\omega_f(A \cap N_\delta(c)) is a member. In particular ωf(c)\omega_f(c) is never -\infty.

Monotonicity, and the case of a bounded ff

ωf\omega_f is monotone under inclusion. If STAS \subseteq T \subseteq A then every value f(x)f(y)|f(x) - f(y)| with x,ySx, y \in S is also a value with x,yTx, y \in T, so the first set of values is contained in the second and ωf(S)ωf(T)\omega_f(S) \le \omega_f(T): a supremum of a subset is at most the supremum of the set. Consequently δωf(ANδ(c))\delta \mapsto \omega_f(A \cap N_\delta(c)) is nondecreasing in δ\delta, since δδ\delta \le \delta' gives Nδ(c)Nδ(c)N_\delta(c) \subseteq N_{\delta'}(c) (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

When ff is bounded, nonempty-set and point oscillations are real. Suppose there is a real MM with f(x)M|f(x)| \le M for every xAx \in A (Lower bound, bounded below, bounded set). Then for x,yAx, y \in A,

f(x)f(y)    f(x)+f(y)    2M|f(x) - f(y)| \;\le\; |f(x)| + |f(y)| \;\le\; 2M

(The triangle inequality, Basic properties of the absolute value), so ωf(S)2M\omega_f(S) \le 2M for every SAS \subseteq A. If SS is nonempty, ωf(S)\omega_f(S) is a real number in [0,2M][0,2M], and every point oscillation is also a real number in [0,2M][0,2M]: the supremum of a nonempty subset of R\mathbb{R} that is bounded above in R\mathbb{R} is the real supremum (Every subset of R\overline{\mathbb{R}} has a least upper bound and a greatest lower bound in R\overline{\mathbb{R}}, agreeing with the real supremum and infimum on nonempty sets bounded in R\mathbb{R}, Complete ordered field (least-upper-bound property), Greatest lower bound (infimum)). The convention ωf()=\omega_f(\varnothing)=-\infty remains the single empty-set exception. Apart from that exception, an infinite extended value can occur only when ff is unbounded.

The notation. The letter is ω\omega throughout this library, never "osc\operatorname{osc}", and the function is always in the subscript.

Depends on

Used by

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