Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-01
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.

L'Hôpital's rule for the ∞/∞ form at finite or infinite, one-sided endpoints

Statement

Let f,g be differentiable on a one-sided neighbourhood of c, or on a tail at +∞ or −∞, with g′≠0. Suppose ∣f(x)∣→∞ and ∣g(x)∣→∞ in the selected mode, with each numerator and denominator eventually of fixed sign. If f′(x)/g′(x)→L∈R‾, then f(x)/g(x)→L.

Facts & Assumptions

Proof

technique · direct
1.1

Fix a base point a inside the domain. For variable x farther toward the limiting end, [L1] gives f(x)−f(a)g(x)−g(a)=f′(ξx)g′(ξx), where ξx lies between a and x.

givenL1
2.1

First choose a sufficiently far toward the end that the derivative quotient is as close to L as required throughout the remaining tail. Then the quotient of increments has the same bound for every later x.

step 1.1L2choose
3.1

Since ∣g(x)∣→∞, g(a)/g(x)→0; since the increment quotient is bounded in the finite-L case, the identity f(x)g(x)=f(x)−f(a)g(x)−g(a)(1−g(a)g(x))+f(a)g(x) gives the finite conclusion. For L=±∞, choose the derivative-quotient lower or upper bound first and then make the two fixed-base terms negligible, obtaining the defining arbitrary bound.

step 2.1L2algebra
4.1

Thus the quotient has limit L in every stated mode.

step 3.1∎

Depends on

Used by

Dependency tree · two levels

35 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