Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero

Statement

Let A⊆R, let c be a limit point of A (Limit point, isolated point, adherent point, derived set, and dense subset of R), let f,g:A→R and let α∈R. Suppose the limits of f and of g at c exist, and write L:=lim⁡x→cf(x) and M:=lim⁡x→cg(x) (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A). Then:

  1. the limit of f+g at c exists, and lim⁡x→c(f+g)(x)  =  lim⁡x→cf(x)+lim⁡x→cg(x)  =  L+M;
  2. the limit of αf at c exists, and lim⁡x→c(αf)(x)  =  αlim⁡x→cf(x)  =  αL;
  3. the limit of fg at c exists, and lim⁡x→c(fg)(x)  =  (lim⁡x→cf(x))(lim⁡x→cg(x))  =  LM;
  4. if M≠0, then, writing A0:={ x∈A:g(x)≠0 }, the point c is a limit point of A0, the quotient f/g is defined on A0 by (f/g)(x)=f(x)/g(x), the limit of (f/g)∣A0 at c exists, and lim⁡x→c(f/g)∣A0(x)  =  lim⁡x→cf(x)lim⁡x→cg(x)  =  LM.

Each equation asserts two things at once: that the limit on the left exists, and that it has the stated value. Both are proved. The symbols denote by At a limit point of the domain a function has at most one limit.

Everything below is proved directly from ε and δ. No sequence is constructed and no choice principle is used, so all four claims are theorems of ZF. Passing through Heine criterion: lim⁡x→cf(x)=L iff f(xk)→L for every sequence in A∖{c} converging to c instead would import the countable choice spent in that theorem's converse direction, for no gain; see The sequence-to-ε direction of the Heine criterion uses countable choice for R, and where this library records that cost.

Why the quotient is stated on A0. The function f/g is simply not defined where g vanishes, and g may well vanish at points of A arbitrarily far from c; restricting to A0 is therefore forced. That this restriction still has c as a limit point, so that the limit there means anything at all, is the last claim of If lim⁡x→cf(x)=L≠0 then ∣f∣>∣L∣/2 on a punctured neighbourhood of c; in particular if L>0 then f>L/2>0 there. The sequential analogue Algebra of limits: sums, scalar multiples, products and quotients needs the corresponding hypothesis in the form "the denominator sequence is nonzero at every index".

Facts & Assumptions

Given: A set A⊆R, a limit point c of A, functions f,g:A→R, a real α, and reals L,M with lim⁡x→cf(x)=L and lim⁡x→cg(x)=M; for claim 4 also M≠0 and A0:={ x∈A:g(x)≠0 } (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A, Limit point, isolated point, adherent point, derived set, and dense subset of R).

[L1]

The limit condition: lim⁡x→ch(x)=P means that for every real ε>0 there is a real δ>0 such that every x in the domain of h with 0<∣x−c∣<δ satisfies ∣h(x)−P∣<ε (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A).

[L2]

Absolute value: ∣u∣≥0; ∣u∣=0 if and only if u=0; ∣uv∣=∣u∣ ∣v∣; and ∣−u∣=∣u∣ (Basic properties of the absolute value).

[L3]

Triangle inequality: ∣u+v∣≤∣u∣+∣v∣ (The triangle inequality).

[L4]

Order and field arithmetic in R: adding two strict inequalities (Order is preserved by adding a constant and by adding inequalities); for t>0, u<v is equivalent to ut<vt, and 0≤u≤v with 0≤s≤t gives us≤vt (Sign rules for products and monotonicity of multiplication); positive elements have positive inverses and 0<a<b gives 0<1/b<1/a (Inverses of positives are positive, and reciprocation reverses order); 0<1 (The multiplicative identity is positive), so 2>0 and t/2>0 for t>0; inverses and the field identities (Field); trichotomy and totality, so of finitely many positive reals the smallest is positive (Ordered field).

[L5]

Local boundedness: there are a real δ0>0 and a real K≥0 with ∣f(x)∣≤K for every x∈A satisfying 0<∣x−c∣<δ0 (If f has a finite limit at c then f is bounded on some punctured neighbourhood of c).

[L6]

Sign preservation: if M≠0 there is a real δs>0 with ∣g(x)∣>∣M∣/2>0 for every x∈A satisfying 0<∣x−c∣<δs, and c is a limit point of A0 (If lim⁡x→cf(x)=L≠0 then ∣f∣>∣L∣/2 on a punctured neighbourhood of c; in particular if L>0 then f>L/2>0 there).

[L7]

Restriction: if B⊆A has c as a limit point and lim⁡x→cf(x)=L, then lim⁡x→cf∣B(x)=L (claim 2 of The limit at c depends only on the restriction of f to a punctured neighbourhood of c, and passes to any subset of the domain having c as a limit point).

Proof

technique · direct
1.1

Sum. Let ε>0 be an arbitrary real. By [L1] fix reals δ1,δ2>0 with ∣f(x)−L∣<ε/2 for every x∈A satisfying 0<∣x−c∣<δ1 and ∣g(x)−M∣<ε/2 for every x∈A satisfying 0<∣x−c∣<δ2, and let δ be the smaller of the two, so δ>0. For x∈A with 0<∣x−c∣<δ we get ∣(f+g)(x)−(L+M)∣=∣(f(x)−L)+(g(x)−M)∣≤∣f(x)−L∣+∣g(x)−M∣<ε. As ε was arbitrary, the limit of f+g at c exists and equals L+M: claim 1.

L1L2L3L4choose
1.2

Scalar multiple. If α=0 then αf is the constant function 0 and αL=0, so ∣(αf)(x)−αL∣=0<ε for every x and every ε>0, any δ serving. If α≠0 then ∣α∣>0; given a real ε>0, [L1] supplies δ>0 with ∣f(x)−L∣<ε/∣α∣ on A∩Nδ∗(c), and there ∣(αf)(x)−αL∣=∣α∣ ∣f(x)−L∣<ε. So the limit of αf at c exists and equals αL: claim 2.

L1L2L4L8choose
1.3

A working bound for f near c. By [L5] fix a real δ0>0 and a real K≥0 with ∣f(x)∣≤K for every x∈A satisfying 0<∣x−c∣<δ0, and put K′:=K+1, so K′>0 and ∣f(x)∣≤K′ for all those x.

L4L5choose
1.4

The denominator near c. Assume M≠0. By [L6] fix a real δs>0 with ∣g(x)∣>∣M∣/2>0 for every x∈A satisfying 0<∣x−c∣<δs; every such x has g(x)≠0, hence lies in A0, and c is a limit point of A0.

L2L4L6
2.1

Product. Let ε>0 be an arbitrary real. By [L1] fix reals δ1,δ2>0 with ∣g(x)−M∣<ε/(2K′) on A∩Nδ1∗(c) and ∣f(x)−L∣<ε/(2(∣M∣+1)) on A∩Nδ2∗(c), and let δ be the smallest of δ0,δ1,δ2, which is positive. For x∈A with 0<∣x−c∣<δ, ∣f(x)g(x)−LM∣=∣f(x)(g(x)−M)+M(f(x)−L)∣≤∣f(x)∣ ∣g(x)−M∣+∣M∣ ∣f(x)−L∣≤K′ ∣g(x)−M∣+(∣M∣+1) ∣f(x)−L∣<ε/2+ε/2=ε. As ε was arbitrary, the limit of fg at c exists and equals LM: claim 3.

step 1.3L1L2L3L4L8choose
2.2

Reciprocal. Assume M≠0 and let ε>0 be an arbitrary real. By [L1] fix a real δ3>0 with ∣g(x)−M∣<ε∣M∣2/2 on A∩Nδ3∗(c), and let δ be the smaller of δs and δ3. For x∈A0 with 0<∣x−c∣<δ we have ∣g(x)∣>∣M∣/2>0, hence ∣g(x)∣ ∣M∣>∣M∣2/2>0 and so 1/(∣g(x)∣ ∣M∣)<2/∣M∣2; therefore ∣1/g(x)−1/M∣=∣M−g(x)∣/(∣g(x)∣ ∣M∣)<(ε∣M∣2/2)⋅(2/∣M∣2)=ε. As ε was arbitrary, the limit of (1/g)∣A0 at c exists and equals 1/M.

step 1.4L1L2L4L8choose
2.3

The numerator on the smaller domain. Assume M≠0. Since A0⊆A and c is a limit point of A0 by step 1.4, [L7] gives that the limit of f∣A0 at c exists and equals L.

step 1.4L7
3.1

Quotient. Assume M≠0. On the domain A0, which has c as a limit point, the two functions f∣A0 and (1/g)∣A0 have limits L and 1/M at c by steps 2.3 and 2.2, and their product is (f/g)∣A0 by the field identities; so claim 3, applied on the domain A0, gives that the limit of (f/g)∣A0 at c exists and equals L⋅(1/M)=L/M.

step 2.1step 2.2step 2.3L2L4
4.1

Claims 1 to 4 are proved, each directly from the ε-δ definition and none of them through a sequence.

step 1.1step 1.2step 2.1step 3.1∎

Remarks

Depends on

Used by

Dependency tree · two levels

27 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