Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

(3x2−1)/(x2+x)→3 as x→+∞

Example

Let A:=(0,∞) (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and let

f:A→R,f(x):=3x2−1x2+x

(Integer powers am). Then A is not bounded above (Lower bound, bounded below, bounded set), so the limit at +∞ is well posed (Limits at +∞ and −∞, and infinite limits at a point); it exists, and

lim⁡x→+∞f(x)  =  3.

This is proved by a direct estimate, not by an algebra of limits. Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero is stated at a finite limit point of the domain, and this library proves no algebra of limits at ±∞; the familiar manipulation "divide numerator and denominator by x2 and take limits termwise" is therefore not available here. Instead the whole computation is packed into one inequality, valid for x≥1:

∣f(x)−3∣  =  1+3xx2+x  ≤  4x,

after which the Archimedean property finishes the argument.

Facts & Assumptions

Given: The set A=(0,∞) and the function f(x)=(3x2−1)/(x2+x) on A.

[L1]

Limits at +∞: for A not bounded above, lim⁡x→+∞f(x)=L means that for every real ε>0 there is a real M with ∣f(x)−L∣<ε for every x∈A with x>M (Limits at +∞ and −∞, and infinite limits at a point).

[L2]

Archimedean property: for every real t there is a natural n≥1 with t<n⋅1R; and for every real ε>0 there is a natural n≥1 with 1/n<ε (Every complete ordered field is Archimedean, For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Complete ordered field (least-upper-bound property)). The canonical naturals satisfy n⋅1R>0 and 1≤n⋅1R for n≥1, and are increasing in n (Canonical naturals are positive and strictly increasing).

[L3]

Bounded set: S is bounded above when some real is an upper bound of it (Lower bound, bounded below, bounded set); and (0,∞)={ x:x>0 } (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L4]

Order and field arithmetic: products of positives are positive and for t>0, u<v is equivalent to ut<vt (Sign rules for products and monotonicity of multiplication); a>0 gives a−1>0 and 0<a<b gives 0<1/b<1/a, with the non-strict forms following by adjoining equality (Inverses of positives are positive, and reciprocation reverses order); adding inequalities and translation invariance (Order is preserved by adding a constant and by adding inequalities); 0<1 (The multiplicative identity is positive); the field identities (Field); transitivity and totality (Ordered field).

[L5]

Absolute value: ∣u∣≥0, ∣u∣=u for u≥0, and ∣−u∣=∣u∣ (Basic properties of the absolute value).

[L6]

Powers: x2=x⋅x (Integer powers am).

Verification

technique · direct
1.1

f is defined on all of A: every x∈A has x>0, hence x2=x⋅x>0 and x2+x>0, so x2+x≠0 and the quotient exists.

L3L4L6
1.2

A is not bounded above: given a real M, [L2] supplies a natural n≥1 with M<n⋅1R, and n⋅1R>0 puts it in A; so no real is an upper bound of A, and the limit at +∞ is well posed.

L2L3
2.1

For every x∈A, f(x)−3=(3x2−1)−3(x2+x)x2+x=−1−3xx2+x, hence, both 1+3x and x2+x being positive, ∣f(x)−3∣=1+3xx2+x.

step 1.1L4L5L6
3.1

For every x∈A with x≥1: from 1≤x we get 1+3x≤x+3x=4x, and from x>0 we get x2+x>x2>0; therefore 1+3xx2+x≤4xx2+x≤4xx2=4x, so ∣f(x)−3∣≤4/x.

step 2.1L4L6
4.1

Let ε>0 be an arbitrary real. By [L2] fix a natural n≥1 with 1/n<ε, and put M:=4n, where n denotes the canonical natural n⋅1R. Since n≥1 we have M=4n≥4>1. For every x∈A with x>M: first x>1, so step 3.1 applies and ∣f(x)−3∣≤4/x; and 0<M<x gives 0<1/x<1/M by [L4], whence 4/x<4/M=4/(4n)=1/n<ε. So ∣f(x)−3∣<ε for every x∈A with x>M.

step 3.1L2L4L5
5.1

Since A is not bounded above and for every real ε>0 such an M has been produced, the limit of f at +∞ exists and equals 3.

step 1.2step 4.1L1∎

Remarks

  • Where the estimate comes from. The exact identity of step 2.1 replaces the informal "the leading terms dominate": it makes ∣f(x)−3∣ a quotient of two explicit positive quantities, and step 3.1 then bounds numerator above and denominator below by the crudest possible expressions, 4x and x2. The constant 4 is not optimal and does not need to be: the Archimedean property absorbs any constant.

  • Why the domain is (0,∞) and not R. The denominator x2+x vanishes at 0 and at −1, so f is not defined there; restricting to (0,∞) both makes f a function and makes the denominator positive, which is what lets the absolute values be dropped in step 2.1. Any domain unbounded above and avoiding the two zeros would give the same limit by the same estimate.

  • The corresponding statement at −∞ would be the limit 3 on a domain unbounded below and avoiding the two zeros of the denominator, proved from the same identity of step 2.1 with the inequalities on x reversed. It is not asserted here and is not proved here, because nothing on these pages uses it.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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