Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

For every real ε>0 the set { x∈A:ωf(x)≥ε } is the intersection with A of a closed subset of R; in particular it is closed in R when A=R

Statement

Let A⊆R, let f:A→R and let ε∈R with ε>0. Put

Eε  :=  { x∈A:ωf(x)≥ε }

(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). Then there is a closed G⊆R (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen) with

Eε  =  A∩G.

In particular, if A=R then Eε is itself a closed subset of R.

The set G is produced explicitly and does not depend on any choice: it is the complement of

U  :=  { y∈R:ωf(A∩Nρ(y))<ε  for some real ρ>0 },

which the proof shows to be open. Note that y ranges over all of R here and not only over A; the expression ωf(A∩Nρ(y)) is the oscillation of f on a subset of A and makes sense for every real y, taking the value sup⁡∅=−∞ when A∩Nρ(y)=∅ (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, 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).

Facts & Assumptions

Given: A⊆R, a function f:A→R, and a real ε>0.

[L1]

ωf(S)=sup⁡{∣f(x)−f(y)∣:x,y∈S} in R‾, and ωf(S)≤ωf(T) whenever S⊆T⊆A; for c∈A, ωf(c)=inf⁡{ωf(A∩Nδ(c)):δ>0} (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, The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined).

[L2]

In R‾ every subset has a greatest lower bound; an infimum is ≥ an extended real ℓ exactly when ℓ bounds the set from below, and the infimum is ≤ every member of the set (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).

[L3]

Nδ(x)={y:∣y−x∣<δ}; if ∣y−x∣<ρ/2 then Nρ/2(y)⊆Nρ(x), since ∣z−y∣<ρ/2 gives ∣z−x∣≤∣z−y∣+∣y−x∣<ρ (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]

U⊆R is open when every point of U has a neighbourhood contained in U, and G⊆R is closed exactly when R∖G is open (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

Proof

technique · direct
1.1

Define U:={ y∈R:ωf(A∩Nρ(y))<ε for some real ρ>0 } and G:=R∖U.

construct
2.1

U is open. Let y∈U with witness ρ>0, and let z∈Nρ/2(y). Then Nρ/2(z)⊆Nρ(y), hence A∩Nρ/2(z)⊆A∩Nρ(y), hence ωf(A∩Nρ/2(z))≤ωf(A∩Nρ(y))<ε, so z∈U with witness ρ/2. Thus Nρ/2(y)⊆U.

step 1.1L1L3L4
2.2

Let x∈A with x∉U. Then ωf(A∩Nδ(x))≥ε for every real δ>0, so ε is a lower bound of the set whose infimum is ωf(x), and therefore ωf(x)≥ε, that is x∈Eε.

step 1.1L1L2
2.3

Let x∈Eε, so x∈A and ωf(x)≥ε. For every real δ>0 the value ωf(A∩Nδ(x)) is at least the infimum ωf(x), hence at least ε; so no ρ witnesses membership of x in U, that is x∉U.

step 1.1L1L2
3.1

G is closed, being the complement of the open set U.

step 1.1step 2.1L4
4.1

Steps 2.2 and 2.3 together say that for x∈A one has x∈Eε if and only if x∈G; hence Eε=A∩G with G closed.

step 3.1step 2.2step 2.3
5.1

If A=R then Eε=R∩G=G is closed in R.

step 4.1L4∎

Remarks

Depends on

Used by

Dependency tree · two levels

22 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