Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck 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.

One-sided limits of a monotone function always exist: for f nondecreasing on an interval I and c∈I, lim⁡x→c−f(x)=sup⁡{f(x):x∈I, x<c} whenever I has points below c, lim⁡x→c+f(x)=inf⁡{f(x):x∈I, x>c} whenever it has points above c, and these satisfy lim⁡x→c−f(x)≤f(c)≤lim⁡x→c+f(x)

Statement

Let I⊆R be order-convex (Intervals of R: the nine order-convex forms, nondegeneracy, and length), let f:I→R be nondecreasing (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R, with the dictionary to monotone sequences) and let c∈I. Write

I−:=I∩(−∞,c),I+:=I∩(c,∞)

(The left and right limits of f at c, as limits of the restrictions of f to A∩(−∞,c) and A∩(c,∞)).

  1. Left. If I−≠∅ then c is a limit point of I− (Limit point, isolated point, adherent point, derived set, and dense subset of R), the set { f(x):x∈I− } is nonempty and bounded above by f(c), and lim⁡x→c−f(x)  =  sup⁡{ f(x):x∈I, x<c }  ≤  f(c).
  2. Right. If I+≠∅ then c is a limit point of I+, the set { f(x):x∈I+ } is nonempty and bounded below by f(c), and lim⁡x→c+f(x)  =  inf⁡{ f(x):x∈I, x>c }  ≥  f(c).
  3. Together. If both I− and I+ are nonempty then lim⁡x→c−f(x)  ≤  f(c)  ≤  lim⁡x→c+f(x).

In particular a nondecreasing function on an interval has, at every point of that interval, every one-sided limit that is well posed at all: no hypothesis of continuity, of boundedness, or of any other kind is needed.

The nonincreasing case is not a separate theorem. If g:I→R is nonincreasing then −g is nondecreasing (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R, with the dictionary to monotone sequences), and a real L is the left limit of −g at c exactly when −L is the left limit of g at c, since ∣(−g)(x)−L∣=∣g(x)−(−L)∣; so claims 1 to 3 hold for g with the suprema and infima exchanged and the inequalities reversed.

Order-convexity of I is what makes the limits well posed. Without it the symbol lim⁡x→c−f(x) need not be defined even though I− is nonempty: for I={0}∪[1,2] and c=1 the set I−={0} is nonempty but 1 is not a limit point of it, and The left and right limits of f at c, as limits of the restrictions of f to A∩(−∞,c) and A∩(c,∞) leaves the symbol undefined there for exactly that reason.

Facts & Assumptions

Given: An order-convex I⊆R, a nondecreasing f:I→R, and c∈I.

[A2]

I is order-convex: x,y∈I and x≤z≤y imply z∈I (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L1]

Every nonempty subset of R that is bounded above has a least upper bound, and every nonempty subset bounded below has a greatest lower bound (Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set, Greatest lower bound (infimum), Every nonempty set bounded below has an infimum).

[L2]

For S nonempty and bounded above with upper bound u: u=sup⁡S if and only if for every real ε>0 there is s∈S with u−ε<s (Epsilon characterisation of the supremum). Dually, for S nonempty and bounded below with lower bound ℓ: ℓ=inf⁡S if and only if for every real ε>0 there is s∈S with s<ℓ+ε (Epsilon characterisation of the infimum).

[L3]

lim⁡x→c−f(x)=L means: c is a limit point of I−, and for every real ε>0 there is a real δ>0 with ∣f(x)−L∣<ε for every x∈I with c−δ<x<c; dually on the right (The left and right limits of f at c, as limits of the restrictions of f to A∩(−∞,c) and A∩(c,∞), The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]

x is a limit point of a set S when every punctured neighbourhood of x meets S (Limit point, isolated point, adherent point, derived set, and dense subset of R, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R); a one-sided limit, being the limit of a restriction, is unique when it exists (At a limit point of the domain a function has at most one limit).

Proof

technique · direct
1.1

Suppose I−≠∅ and fix a∈I with a<c; then [a,c]⊆I, since any z with a≤z≤c lies in I.

A2
1.2

Claim 2 is the same argument on the other side, and is written out here rather than deduced. Suppose I+≠∅ and fix b∈I with c<b; then [c,b]⊆I, and for real δ>0 the point min⁡{b,c+δ/2} lies in I+ within δ of c, so c is a limit point of I+.

A2L4
2.1

Every real δ>0 gives a point of I− within δ of c and different from c: put z:=max⁡{a,c−δ/2}, so that a≤z<c and c−z≤δ/2<δ, and z∈I by step 1.1. Hence c is a limit point of I− and the symbol on the left of claim 1 is well posed.

step 1.1L4
2.2

The set S−:={ f(x):x∈I, x<c } is nonempty, since f(a)∈S−, and f(c) is an upper bound of it, since x<c gives f(x)≤f(c). So L:=sup⁡S− exists and L≤f(c), the latter because f(c) is an upper bound and L is the least one.

step 1.1A1L1
2.3

The set S+:={ f(x):x∈I, x>c } is nonempty and bounded below by f(c), so M:=inf⁡S+ exists and M≥f(c).

step 1.2A1L1
3.1

Let ε>0 be real. By the epsilon characterisation of the supremum there is x0∈I with x0<c and L−ε<f(x0).

step 2.2L2
3.2

Given real ε>0, the epsilon characterisation of the infimum gives x1∈I with x1>c and f(x1)<M+ε; put δ:=x1−c>0. For x∈I with c<x<c+δ we have c<x<x1, so M≤f(x)≤f(x1)<M+ε and hence ∣f(x)−M∣<ε.

step 2.3A1L2
4.1

Put δ:=c−x0>0 and let x∈I satisfy c−δ<x<c. Then x0<x<c, so f(x0)≤f(x) by monotonicity and f(x)≤L because f(x)∈S− and L is an upper bound of S−; hence L−ε<f(x0)≤f(x)≤L and therefore ∣f(x)−L∣<ε.

step 2.2step 3.1A1
4.2

Claim 2 is proved: lim⁡x→c+f(x)=M=inf⁡S+≥f(c).

step 1.2step 2.3step 3.2L3L4
5.1

Claim 1 is proved: ε>0 was arbitrary in step 3.1, so lim⁡x→c−f(x)=L=sup⁡S−≤f(c), and this value is the only one the symbol can denote.

step 2.1step 2.2step 4.1L3L4
6.1

Claim 3 follows by combining the two inequalities of claims 1 and 2, both of which are then available.

step 5.1step 4.2∎

Remarks

Depends on

Used by

Dependency tree · two levels

33 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