Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)
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.

Algebra of limits: sums, scalar multiples, products and quotients

Statement

Let (xk) and (yk) be sequences of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences) converging to x and y respectively (Limits and Cauchy sequences of reals), and let c∈R. Then

xk+yk→x+y,c xk→c x,xk−yk→x−y,xkyk→xy,

and if in addition y≠0 and yk≠0 for every k∈N, then

1yk→1yandxkyk→xy.

The quotient case rests on an eventual lower bound for ∣yk∣, proved below rather than assumed: ∣yk∣>∣y∣/2 for all sufficiently large k.

Facts & Assumptions

Given: Sequences (xk), (yk) of reals with (xk) converging to x and (yk) converging to y, and a real c (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals). For the last two claims we assume in addition y≠0 and yk≠0 for every k.

[L1]

Convergence, quantified over rational ε>0 (Limits and Cauchy sequences of reals).

[L2]

Absolute value and the triangle inequality: ∣uv∣=∣u∣ ∣v∣, ∣u∣≥0, ∣u∣=0 if and only if u=0, ∣−u∣=∣u∣, and ∣a+b∣≤∣a∣+∣b∣ (Basic properties of the absolute value, The triangle inequality).

[L3]

Real versus rational ε: for every real η>0 there is a rational ε with 0<ε<η, by density (The rationals embed densely in the reals) or by the Archimedean property (Every complete ordered field is Archimedean) applied to 1/η (Inverses of positives are positive, and reciprocation reverses order); consequently the convergence test of Limits and Cauchy sequences of reals may equivalently be run with real ε>0 (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L4]

Convergent sequences are bounded (Every convergent sequence is bounded), and a constant sequence (c) is bounded by ∣c∣ (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L5]

A null sequence times a bounded sequence is null (A null sequence times a bounded sequence is null).

[L6]

Reverse triangle inequality: ∣∣u∣−∣v∣∣≤∣u−v∣, hence ∣u∣≥∣v∣−∣v−u∣ (The reverse triangle inequality).

[L7]

Inverses and order: a>0 implies a−1>0; 0<a<b implies 0<b−1<a−1; (u−1)−1=u for u≠0 (Inverses of positives are positive, and reciprocation reverses order, Field).

[L8]

Order arithmetic in R: adding a constant and adding inequalities preserve the order, multiplying a strict inequality by a positive factor preserves it, and ≤ and < compose transitively; trichotomy holds, and since u≥0 means u>0 or u=0, an element with u≥0 and u≠0 satisfies u>0 (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Complete ordered field (least-upper-bound property), Ordered field). Moreover 2=1+1>0 and 2 is invertible: 0<1 in any ordered field (The multiplicative identity is positive) and the positives are closed under addition, so 2>0 and in particular 2≠0 (Ordered field), whence 2−1 exists (Field).

[L9]

Rational arithmetic: ε/2 is a rational >0 whenever ε is, and ε/2+ε/2=ε (The rationals form a totally ordered field); the order on N is total, so finitely many thresholds admit a common index (≤ is a linear order on N).

Proof

technique · direct
1.1

Reduction to null sequences: for any sequence (zk) of reals and any real z, the statements "(zk) converges to z" and "(zk−z) converges to 0" are literally the same condition, because ∣(zk−z)−0∣=∣zk−z∣ for every k.

L1L2
1.2

Sum rule, in general form. Let (uk)→u and (vk)→v be any convergent sequences of reals and let ε>0 be rational; take K1 with ∣uk−u∣<ε/2 for k≥K1 and K2 with ∣vk−v∣<ε/2 for k≥K2, and let K be an index at least as large as both. For k≥K, ∣(uk+vk)−(u+v)∣=∣(uk−u)+(vk−v)∣≤∣uk−u∣+∣vk−v∣<ε/2+ε/2=ε; hence uk+vk→u+v, and in particular xk+yk→x+y.

L1L2L8L9algebra
1.3

Boundedness: every convergent sequence of reals is bounded, and every constant sequence (d) is bounded by ∣d∣.

L4
1.4

Quotient preparation. Assume y≠0 and yk≠0 for every k. Then ∣y∣>0 by [L2], so ∣y∣/2>0; running the convergence test of (yk) with the real number ∣y∣/2 as tolerance, which [L3] licenses, produces K0∈N with ∣yk−y∣<∣y∣/2 for all k≥K0.

L1L2L3L7L8choose
2.1

Scalar rule, in general form. Let (uk)→u and let d∈R. By step 1.1 the sequence (uk−u) is null and by step 1.3 the constant sequence (d) is bounded, so (d(uk−u))=(duk−du) is null by [L5]; by step 1.1 again, duk→du, and in particular cxk→cx.

step 1.1step 1.3L5algebra
2.2

Product rule, in general form. Let (uk)→u and (vk)→v, and write ukvk−uv=uk(vk−v)+v(uk−u). By step 1.1 both (vk−v) and (uk−u) are null; by step 1.3 both (uk) and the constant sequence (v) are bounded; so both (uk(vk−v)) and (v(uk−u)) are null by [L5], and their sum is null by step 1.2 applied with both limits equal to 0. By step 1.1, ukvk→uv, and in particular xkyk→xy.

step 1.1step 1.2step 1.3L5algebra
2.3

Eventual lower bound. For every k≥K0, the reverse triangle inequality gives ∣yk∣≥∣y∣−∣y−yk∣=∣y∣−∣yk−y∣>∣y∣−∣y∣/2=∣y∣/2>0; so ∣yk∣>∣y∣/2 for all k≥K0, and in particular ∣yk∣≠0 there.

step 1.4L2L6L8
3.1

Difference rule. Applying step 2.1 to the sequence (yk) with d=−1 gives −yk→−y; the sum rule of step 1.2 applied to (xk) and (−yk) then gives xk−yk=xk+(−yk)→x+(−y)=x−y.

step 1.2step 2.1L8algebra
3.2

Reciprocal estimate. For k≥K0 we have yk≠0 and ∣yk∣>∣y∣/2>0, so [L7] applied to 0<∣y∣/2<∣yk∣ gives 0<∣yk∣−1<2/∣y∣, and therefore ∣1yk−1y∣=∣y−yk∣∣yk∣ ∣y∣≤2∣y∣2 ∣yk−y∣.

step 2.3L2L7L8algebra
4.1

Reciprocal rule. Let ε>0 be an arbitrary real and put η:=ε∣y∣2/2, a real >0; by [L3] there is K1 with ∣yk−y∣<η for all k≥K1. For every k at least as large as both K0 and K1, step 3.2 gives ∣1yk−1y∣≤2∣y∣2∣yk−y∣<2∣y∣2 η=ε; hence 1/yk→1/y.

step 3.2L1L3L7L8L9algebra
5.1

Quotient rule. By step 4.1 the sequence (1/yk) converges to 1/y, so the product rule of step 2.2 applied to (xk) and (1/yk) gives xk/yk=xk⋅(1/yk)→x⋅(1/y)=x/y.

step 2.2step 4.1algebra
6.1

All the claims are established: the sum rule in step 1.2, the scalar rule in step 2.1, the difference rule in step 3.1, the product rule in step 2.2, and the reciprocal and quotient rules in steps 4.1 and 5.1.

step 1.2step 2.1step 2.2step 3.1step 4.1step 5.1∎

Remarks

  • The quotient case is where proofs usually cheat. The estimate ∣1/yk−1/y∣=∣y−yk∣/(∣yk∣∣y∣) is worthless until ∣yk∣ is known to stay away from 0: without a lower bound the denominator can be arbitrarily small and the fraction arbitrarily large, even while ∣y−yk∣ shrinks. Step 2.3 supplies that bound, ∣yk∣>∣y∣/2 for k≥K0, and it is proved from the reverse triangle inequality, not assumed.

  • The hypothesis yk≠0 for every k is only there so that 1/yk is defined for every index. It is not needed for the limit: step 2.3 shows ∣yk∣>∣y∣/2>0 from K0 on, so a sequence with y≠0 has at most finitely many zero terms, and by Convergence depends only on the tail one may pass to the K0-th tail and read the conclusion there.

  • The hypothesis y≠0 cannot be dropped. With xk=1 and yk=1/(k+1), both sequences converge: the first is constant (Sequences of reals: bounded, eventually, frequently, tails, subsequences) and the second is null (FALSE: limits preserve strict inequalities), so y=0. Yet xk/yk=k+1, and no real M bounds every k+1, by the Archimedean property (Every complete ordered field is Archimedean); so the quotient sequence is unbounded, hence not convergent by Every convergent sequence is bounded.

  • Nothing in the proof uses completeness of R beyond the Archimedean property invoked in [L3], so the same rules hold verbatim for sequences of rationals.

Depends on

Used by

…and 23 more results.

Dependency tree · two levels

45 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