Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-01
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.

Oscillation of a real function on subsets of Rm and at a point

Definition

Let f:A→R, A⊆Rm. For S⊆A, define ωf(S):=sup⁡R‾{∣f(x)−f(y)∣:x,y∈S}, with value 0 when S=∅. For c∈A, define ωf(c):=inf⁡r>0ωf(A∩B(c,r)). The extended supremum exists by The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined and 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; for bounded f all values are finite. Balls are Open ball, closed ball and sphere in a metric space for the Euclidean metric (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, Each ∥⋅∥p is a norm on Rn, and the induced metrics are exactly d1, d2 and d∞ of the published metric-spaces page).

If S⊆T, then ωf(S)≤ωf(T), directly from the supremum definition; hence the ball oscillations decrease as the radius shrinks and the infimum is well posed (Greatest lower bound (infimum), Basic properties of the absolute value). At m=1 this agrees with 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 on every nonempty set; only the empty-set convention differs, being 0 here and −∞ there.

Depends on

Used by

Dependency tree · two levels

47 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