Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 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,y∈S } of f on a set and the oscillation ωf(c)=inf⁡δ>0ωf(A∩Nδ(c)) at a point, both taken in the extended reals

Definition

Let A⊆R and let f:A→R. All suprema and infima below are taken in the extended real line R‾=R∪{−∞,+∞} (The extended real line R‾=R∪{−∞,+∞}, 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‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R); no boundedness hypothesis on f is therefore needed anywhere, and none is imposed.

Oscillation on a set. For S⊆A put

ωf(S)  :=  sup⁡{ ∣f(x)−f(y)∣  :  x,y∈S }  ∈  R‾.

Oscillation at a point. For c∈A put

ωf(c)  :=  inf⁡{ ωf(A∩Nδ(c))  :  δ∈R, δ>0 }  ∈  R‾,

where Nδ(c)=(c−δ,c+δ) is the δ-neighbourhood of c (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

The two uses of the symbol ωf are distinguished by their argument: a subset of A in the first, a point of A in the second. Where confusion is possible the first is written ωf(S) with S 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 S is, since x=y∈S gives the value ∣f(x)−f(x)∣=0; so ωf(S)≥0 for nonempty S, and ωf(S)=sup⁡∅=−∞ for S=∅ (Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R). Only nonempty S occurs below.

The set in the second display is nonempty, since some real δ>0 exists, and each of its members is ≥0: for c∈A the set A∩Nδ(c) contains c itself, because ∣c−c∣=0<δ, so it is nonempty and ωf(A∩Nδ(c))≥0 (Basic properties of the absolute value). Hence 0 is a lower bound of that set and

0  ≤  ωf(c)  ≤  ωf(A∩Nδ(c))for every real δ>0,

the second inequality because ωf(c) is a lower bound of the set of which ωf(A∩Nδ(c)) is a member. In particular ωf(c) is never −∞.

Monotonicity, and the case of a bounded f

ωf is monotone under inclusion. If S⊆T⊆A then every value ∣f(x)−f(y)∣ with x,y∈S is also a value with x,y∈T, so the first set of values is contained in the second and ωf(S)≤ωf(T): a supremum of a subset is at most the supremum of the set. Consequently δ↦ωf(A∩Nδ(c)) is nondecreasing in δ, since δ≤δ′ gives Nδ(c)⊆Nδ′(c) (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

When f is bounded, nonempty-set and point oscillations are real. Suppose there is a real M with ∣f(x)∣≤M for every x∈A (Lower bound, bounded below, bounded set). Then for x,y∈A,

∣f(x)−f(y)∣  ≤  ∣f(x)∣+∣f(y)∣  ≤  2M

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

The notation. The letter is ω throughout this library, never "osc⁡", and the function is always in the subscript.

Depends on

Used by

Dependency tree · two levels

20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources