WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Asymptotic analysis

54 passages16 formalized10 partial28 not formalized

Statement only

More ways to filter
Library
About this page

This page

  • Wikipedia revision 1379563048, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, High importance
  • Annotated article on WikiLean.
  • 54 passages checked, 41 Lean locations (and 20 related declarations).

Central statements: 23 of the 54 passages state the article's subject or a named result or definition; the other 31 are supporting (examples, setup). Of these 23: 7 formalized, 7 partial, 9 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (22 locations and 9 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 9 of 19 locations and 3 of 18 absences. In all, 31 of 41 Lean locations (76%) and 12 of 27 absences (44%) were re-checked.
  • Passage text: 54 of 54 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1379563048 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Passages

What “exact match”, “more general” and the other labels mean
  1. Example · supporting

    Not formalized
    For example, the function ỹ(x) = x accurately approximates the function y(x) = x + e−x for large positive x values (Figure 1).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 97427d957334).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  2. Theorem · supporting

    Not formalized
    For any desired accuracy, there is a corresponding range of x values where this accuracy occurs.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt ef3139f118e7).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  3. Example · supporting

    Not formalized
    In this case, a chosen accuracy with a relative error of less than 1% occurs when the x values are greater than 3.4.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 55dcf3f600a8).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  4. Definition · main statement

    Partial

    Partial: Mathlib states a special case (a definition).

    For any real number x, the prime counting function, denoted as pi(x), is the number of prime numbers less than or equal to x.

    Show in article · Read it in context on Wikipedia

    Nat.primeCounting special case

    def Nat.primeCounting : ℕ → ℕ

    Mathlib.NumberTheory.PrimeCounting · lines 57–58

    Why a special case: The library function is defined on natural arguments where the article admits any real x, and on the naturals the two agree.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6b8f8776e9dc · pair key 0d75bd99bab1.
  5. Theorem · main statement

    Partial

    Partial: ATLAS (atlas-lean) states a special case (proved).

    The function, x/ln(x), approximates the prime counting function for large numbers x.

    Show in article · Read it in context on Wikipedia

    MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem special case

    theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n

    MathlibExt.NumberTheory.PrimeNumberTheorem · line 183

    Why a special case: The declaration is stated with a natural argument, while the article's counting function accepts any real x, so it is that approximation along the naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 81701b43dc88 · pair key a3b5348d54ae.
  6. Theorem · supporting

    Partial

    Partial: ATLAS (atlas-lean) states a special case (proved).

    As in the preceding example, as the number x becomes increasingly larger, the approximating function becomes increasingly more accurate, leading to an increasingly smaller relative error.

    Show in article · Read it in context on Wikipedia

    MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem special case

    theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n

    MathlibExt.NumberTheory.PrimeNumberTheorem · line 183

    Why a special case: Stated at natural arguments while the article speaks of a real x growing without bound; vanishing relative discrepancy is precisely this equivalence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key a48d9eb46a66 · pair key a337f7c49cb6.
  7. Theorem · main statement

    Partial

    Partial: ATLAS (atlas-lean) states a special case (proved).

    This asymptotic relationship is expressed using this notation: π(x) ∼ xln(x) (x → ∞)

    Show in article · Read it in context on Wikipedia

    MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem special case

    theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n

    MathlibExt.NumberTheory.PrimeNumberTheorem · line 183

    Why a special case: The declaration fixes a natural argument where the article's displayed relation runs over real x, so it is that relation along the naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 434967f00048 · pair key 4ac748b070fb.
  8. Definition · main statement · Definition

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    Formally, given functions f (x) and g(x), we define a binary relation f(x) ∼ g(x) (as x → ∞) if and only if (de Bruijn 1981, §1.4) limx → ∞ f(x)g(x) = 1.

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent more general

    def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 77–78

    Why more general: Mathlib introduces the relation for an arbitrary filter and an arbitrary normed additive group, through the little-o form of the condition, which the article itself records as the other way of writing it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5a3dcdbc77d0 · pair key 9661bfefa5c4.

    Asymptotics.isEquivalent_iff_tendsto_one special case

    theorem Asymptotics.isEquivalent_iff_tendsto_one {α : Type*} {β : Type*} [NormedField β] {u v : α → β} {l : Filter α} : (∀ᶠ (x : α) in l, v x ≠ 0) → (Asymptotics.IsEquivalent l u v ↔ Filter.Tendsto (u / v) l (𝓝 1))

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 214–225

    Why a special case: It carries the extra assumption that the second function avoids zero near the limit, which is just the setting where the article's quotient definition behaves.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0416b8d635a2 · pair key 2c24e5bf8ed0.
  9. Theorem · main statement · Definition

    Partial

    Partial: Mathlib states part of this (proved).

    The relation is an equivalence relation on the set of functions of x; the functions f and g are said to be asymptotically equivalent.

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent.refl states part

    theorem Asymptotics.IsEquivalent.refl {α : Type*} {β : Type*} [NormedAddCommGroup β] {u : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u u

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 98–100

    Why only part: The library proves reflexivity of its asymptotic equivalence relation on its own, with no hypothesis on the function.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9e3a3882dddd · pair key a2a279934c8c.

    Asymptotics.IsEquivalent.symm states part

    theorem Asymptotics.IsEquivalent.symm {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l v u

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 103–104

    Why only part: The library proves symmetry of the relation for any two functions along the same limit.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 24bc34c6998e · pair key 24eb4c80ccd1.

    Asymptotics.IsEquivalent.trans states part

    theorem Asymptotics.IsEquivalent.trans {α : Type*} {β : Type*} [NormedAddCommGroup β] {l : Filter α} {u v w : α → β} : Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l v w → Asymptotics.IsEquivalent l u w

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 107–109

    Why only part: The library proves transitivity of the relation along one fixed limit.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key dbba48992208 · pair key 7ae6a906eeb0.
  10. Definition · supporting · Definition

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    The relation is an equivalence relation on the set of functions of x; the functions f and g are said to be asymptotically equivalent.

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent more general

    def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 77–78

    Why more general: Mathlib defines this relation along an arbitrary filter and for values in any normed additive group, writing the condition as the difference being little-o of the second function, which is the article's own second form of the relation; its docstring calls such functions asymptotically equivalent.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key aeaa894cfd58 · pair key d7bf4b2b4daf.
  11. Definition · supporting · Definition

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    The domain of f and g can be any set for which the limit is defined: e.g. real numbers, complex numbers, positive integers.

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent more general

    def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 77–78

    Why more general: The library leaves the domain a type variable and records the limiting process as a filter on it, so the relation is available over the reals, the complexes and the positive integers alike.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 52c29c0c0046 · pair key 8851cf575347.
  12. Notation · supporting · Definition

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    The same notation is also used for other ways of passing to a limit: e.g. x → 0, x ↓ 0, |x| → 0.

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent more general

    def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 77–78

    Why more general: The library's notation for the relation carries the limiting process as a filter subscript, so one relation serves approach to infinity, approach to zero and one-sided approach to zero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 81ae0ccda29e · pair key 4c489055eedc.
  13. Definition · main statement · Definition

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    The alternative definition, in little-o notation, is that f ~ g if and only if f(x) = g(x)(1 + o(1)).

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent more general

    def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 77–78

    Why more general: Mathlib takes this little-o condition as its definition of asymptotic equivalence, stated along any filter and for values in any normed additive group.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 320ffaa821e5 · pair key 5bb3655fe8a1.

    Asymptotics.isEquivalent_iff_exists_eq_mul more general

    theorem Asymptotics.isEquivalent_iff_exists_eq_mul {α : Type*} {β : Type*} [NormedField β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v ↔ ∃ φ, ∃ (_ : Filter.Tendsto φ l (𝓝 1)), u =ᶠ[l] φ * v

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 190–199

    Why more general: The theorem puts the library relation in the product form the passage uses, with a factor tending to one, and it holds along any filter.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b0cad5bf4c44 · pair key 2ae30ca9324f.
  14. Theorem · supporting · Definition

    Formalized

    Formalized: Mathlib states a more general result (proved).

    This definition is equivalent to the prior definition if g(x) is not zero in some neighbourhood of the limiting value.

    Show in article · Read it in context on Wikipedia

    Asymptotics.isEquivalent_iff_tendsto_one more general

    theorem Asymptotics.isEquivalent_iff_tendsto_one {α : Type*} {β : Type*} [NormedField β] {u v : α → β} {l : Filter α} : (∀ᶠ (x : α) in l, v x ≠ 0) → (Asymptotics.IsEquivalent l u v ↔ Filter.Tendsto (u / v) l (𝓝 1))

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 214–225

    Why more general: Mathlib writes 'nonzero on a neighbourhood of the limiting value' as non-vanishing eventually along the filter, and states the equivalence for values in any normed field.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a4c4d6d0d9e5 · pair key e3df45c487d8.
  15. Theorem · main statement · Properties

    Formalized

    Formalized, by a community edit: Mathlib states this up to a convention difference (proved).

    The zero function, f(z) = 0, can never be equivalent to any other function.

    Show in article · Read it in context on Wikipedia

    Asymptotics.isEquivalent_zero_iff_eventually_zero close match

    theorem Asymptotics.isEquivalent_zero_iff_eventually_zero {α : Type*} {β : Type*} [NormedAddCommGroup β] {u : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u 0 ↔ u =ᶠ[l] 0

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 119–121

    Community Agent The pipeline said more general; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why close, not exact: Mathlib proves that a function is asymptotically equivalent to zero along a filter exactly when it is eventually zero along that filter. This is the passage's claim once functions that agree near the limit count as the same function. The difference: a function that is nonzero somewhere but zero from some point on is a different function to the passage, yet Mathlib counts it as equivalent to zero.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 30ec79e39b46 · pair key eae9a62ba312.
  16. Theorem · main statement · Properties

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The little-o relation has the partial ordering property defined as if f(x) = o(g(x)) and g(x) = o(h(x)) then f(x) = o(h(x)).

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsLittleO.trans more general

    theorem Asymptotics.IsLittleO.trans {α : Type*} {E : Type*} {F : Type*} {G : Type*} [Norm E] [Norm F] [Norm G] {l : Filter α} {f : α → E} {g : α → F} {k : α → G} : f =o[l] g → g =o[l] k → f =o[l] k

    Mathlib.Analysis.Asymptotics.Basic · lines 351–353

    Why more general: The library states transitivity of the little-o relation along an arbitrary filter, allowing the three functions distinct normed value types.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c927207a935f · pair key 5df507ba9359.

    Asymptotics.transIsLittleOIsLittleO more general

    instance Asymptotics.transIsLittleOIsLittleO {α : Type*} {E : Type*} {F : Type*} {G : Type*} [Norm E] [Norm F] [Norm G] {l : Filter α} : Trans (fun x1 x2 ↦ x1 =o[l] x2) (fun x1 x2 ↦ x1 =o[l] x2) fun x1 x2 ↦ x1 =o[l] x2

    Mathlib.Analysis.Asymptotics.Basic · lines 355–357

    Why more general: This is the same implication packaged as a transitivity instance so that little-o steps compose in calculations.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 69c5931b96a7 · pair key 93db61417c9c.
  17. Theorem · main statement · Properties

    Formalized

    Formalized by 3 parts together (more general):

    1. Asymptotics.IsEquivalent.refl Mathlib (proved)
      • asymptotic equivalence is reflexive
    2. Asymptotics.IsEquivalent.symm Mathlib (proved)
      • asymptotic equivalence is symmetric
    3. Asymptotics.IsEquivalent.trans Mathlib (proved)
      • asymptotic equivalence is transitive
    Asymptotic equivalence has reflexive, symmetric and transitive properties.

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent.refl states part

    theorem Asymptotics.IsEquivalent.refl {α : Type*} {β : Type*} [NormedAddCommGroup β] {u : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u u

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 98–100

    Why only part: Mathlib phrases the relation through its IsEquivalent predicate on a filter, the same relation the passage calls asymptotic equivalence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key db87f0880d76 · pair key 3ad51451ad27.

    Asymptotics.IsEquivalent.symm states part

    theorem Asymptotics.IsEquivalent.symm {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l v u

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 103–104

    Why only part: The declaration works for an arbitrary filter, so it covers the article's several ways of passing to a limit.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7c55fa398c77 · pair key ca28ad149a25.

    Asymptotics.IsEquivalent.trans states part

    theorem Asymptotics.IsEquivalent.trans {α : Type*} {β : Type*} [NormedAddCommGroup β] {l : Filter α} {u v w : α → β} : Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l v w → Asymptotics.IsEquivalent l u w

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 107–109

    Why only part: The chaining is stated for one fixed filter, matching the article's single limit process.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d25f60610423 · pair key 375c30434b5d.
  18. Theorem · main statement · Properties

    Partial

    Partial: Mathlib states a special case (proved).

    If these functions are equivalent, f(x) ∼ g(x) (x → L), then the exponentiated functions to the real power r are also equivalent:[7] (f(x))r ∼ (g(x))r (x → L)

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent.rpow special case

    theorem Asymptotics.IsEquivalent.rpow {α : Type*} {u v : α → ℝ} {l : Filter α} : 0 ≤ v → Asymptotics.IsEquivalent l u v → ∀ {r : ℝ}, Asymptotics.IsEquivalent l (u ^ r) (v ^ r)

    Mathlib.Analysis.Asymptotics.SpecificAsymptotics · lines 110–121

    Why a special case: The declaration asks that the second function be nonnegative, a sign condition the passage's sentence does not state.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f760b6743036 · pair key c22c18bb9687.

    Asymptotics.IsEquivalent.pow special case

    theorem Asymptotics.IsEquivalent.pow {α : Type*} {β : Type*} [NormedField β] {t u : α → β} {l : Filter α} : Asymptotics.IsEquivalent l t u → ∀ (n : ℕ), Asymptotics.IsEquivalent l (t ^ n) (u ^ n)

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 303–306

    Why a special case: The exponent here ranges over the naturals only, where the passage allows any real exponent.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 6ac60343b14c · pair key ed7f5e33e609.
  19. Theorem · main statement · Properties

    Formalized

    Formalized: Mathlib states a more general result (proved).

    If these functions are equivalent f(x) ∼ g(x) (x → L), and these functions are equivalent h(x) ∼ k(x) (x → L), then the quotients are equivalent:[7] f(x)h(x) ∼ g(x)k(x) (x → L) These properties allow asymptotically equivalent functions to be freely exchanged in many algebraic expressions.

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent.div more general

    theorem Asymptotics.IsEquivalent.div {α : Type*} {β : Type*} [NormedField β] {t u v w : α → β} {l : Filter α} : Asymptotics.IsEquivalent l t u → Asymptotics.IsEquivalent l v w → Asymptotics.IsEquivalent l (t / v) (u / w)

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · lines 299–301

    Why more general: Lean's division is total and returns zero when the denominator is zero, which is where the passage's quotient would have no value.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 20b95e43ca98 · pair key 6ca5a57aeb06.
  20. Theorem · supporting · Properties

    Not formalized
    Asymptotically equivalent functions remain asymptotically equivalent under integration if requirements related to convergence are met.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt d294aba6134d).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  21. Theorem · main statement · Examples of asymptotic formulas

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Factorial n! ∼ √2πn(ne)n —this is Stirling's approximation

    Show in article · Read it in context on Wikipedia

    Stirling.factorial_isEquivalent_stirling exact match

    theorem Stirling.factorial_isEquivalent_stirling : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.factorial) fun n ↦ √(2 * ↑n * π) * (↑n / Real.exp 1) ^ n

    Mathlib.Analysis.SpecialFunctions.Stirling · lines 218–225

    Note: Lean writes the radicand with the factors in another order, which is the same real number the passage writes.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0fd7305dcdb9 · pair key 14af9669094a.
  22. Definition · supporting · Examples of asymptotic formulas

    Formalized

    Formalized: ATLAS (atlas-lean) states this exactly (a definition).

    Partition function For a positive integer n, the partition function, p(n), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered.

    Show in article · Read it in context on Wikipedia

    MetaMathlibExt.partitionFunction exact match

    def MetaMathlibExt.partitionFunction : ℕ → ℕ

    MathlibExt.Combinatorics.Enumerative.PentagonalNumber · line 31

    Note: It is built from the Mathlib type of partitions of n, multisets of positive parts summing to n, so the arrangement of the summands plays no role.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 64c2773.
    • Location key 28ef1559bedd · pair key 50e2de44c33c.

    Erdos1106.p exact match

    def Erdos1106.p : ℕ → ℕ

    FormalConjectures.ErdosProblems.«1106» · line 37

    Note: Its own documentation records the same counting description, with the arrangement of the summands disregarded.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit e754a78.
    • Location key c3082f9935ea · pair key 82b58196f7b0.
  23. Theorem · main statement · Examples of asymptotic formulas

    Not formalized
    p(n) ∼ 14n√3eπ√2n3

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 2b54e963863f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  24. Theorem · supporting · Examples of asymptotic formulas

    Not formalized
    Airy function The Airy function, Ai(x), is a solution of the differential equation y″ − xy = 0; it has many applications in physics.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt ab9ed1a4e311).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  25. Theorem · main statement · Examples of asymptotic formulas

    Not formalized
    Ai(x) ∼ e−23x322√πx1/4

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 94e76088cf40).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  26. Theorem · main statement · Examples of asymptotic formulas

    Not formalized
    Hankel functions H(1)α(z)∼ √2πzei(z − 2πα − π4)H(2)α(z)∼ √2πze−i(z − 2πα − π4)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt a7c7d1b0d3a6).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  27. Definition · main statement · Asymptotic expansion

    Partial

    Partial: Mathlib states a special case (proved).

    An asymptotic expansion of a function f(x) is in practice an expression of that function in terms of a series, the partial sums of which do not necessarily converge, but such that taking any initial partial sum provides an asymptotic formula for f.

    Show in article · Read it in context on Wikipedia

    Real.exp_sub_sum_range_succ_isLittleO_pow special case

    theorem Real.exp_sub_sum_range_succ_isLittleO_pow (n : ℕ) : (fun x ↦ Real.exp x - ∑ i ∈ Finset.range (n + 1), x ^ i / ↑i.factorial) =o[𝓝 0] fun x ↦ x ^ n

    Mathlib.Analysis.SpecialFunctions.Exp · lines 165–167

    Why a special case: The passage permits a divergent series but does not demand one, so the convergent exponential series at zero falls under the notion it describes.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, low confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b0429b1ad081 · pair key 702edd810faa.
  28. Definition · supporting · Asymptotic expansion

    Not formalized

    With community edits: Not formalized. As published it is Partial.

    In symbols, it means we have f ∼ g1, but also f − g1 ∼ g2 and f − g1 − ⋯ − gk − 1 ∼ gk for each fixed k.

    Show in article · Read it in context on Wikipedia

  29. Theorem · supporting · Asymptotic expansion

    Partial

    Partial: Mathlib states part of this (proved).

    In view of the definition of the ∼ symbol, the last equation means f − (g1 + ⋯ + gk) = o(gk) in the little o notation, i.e., f − (g1 + ⋯ + gk) is much smaller than gk.

    Show in article · Read it in context on Wikipedia

    Asymptotics.IsEquivalent.isLittleO states part

    theorem Asymptotics.IsEquivalent.isLittleO {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v → (u - v) =o[l] v

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · line 82

    Why only part: It carries only one direction of the equivalence the passage asserts, so it does not give the converse reading.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 37998054135d · pair key 66c050983a46.

    Asymptotics.IsLittleO.isEquivalent states part

    theorem Asymptotics.IsLittleO.isEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : (u - v) =o[l] v → Asymptotics.IsEquivalent l u v

    Mathlib.Analysis.Asymptotics.AsymptoticEquivalent · line 175

    Why only part: It carries only the other direction of the equivalence the passage asserts.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e7414ede6f44 · pair key 61c390451fd3.
  30. Definition · main statement · Asymptotic expansion

    Partial

    Partial: Mathlib states a special case (proved).

    The relation f − g1 − ⋯ − gk − 1 ∼ gk takes its full meaning if gk + 1 = o(gk) for all k, which means the gk form an asymptotic scale.

    Show in article · Read it in context on Wikipedia

    Asymptotics.isLittleO_pow_pow special case

    theorem Asymptotics.isLittleO_pow_pow {𝕜 : Type*} [NormedDivisionRing 𝕜] {m n : ℕ} : m < n → (fun x ↦ x ^ n) =o[𝓝 0] fun x ↦ x ^ m

    Mathlib.Analysis.Asymptotics.Lemmas · lines 583–588

    Why a special case: The library states the condition for every pair of exponents, which contains the consecutive pairs the passage asks about.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 630cb44550a5 · pair key 1972b9b7542d.
  31. Notation · supporting · Asymptotic expansion

    Not formalized
    In that case, some authors may abusively write f ∼ g1 + ⋯ + gk to denote the statement f − (g1 + ⋯ + gk) = o(gk). One should however be careful that this is not a standard use of the ∼ symbol, and that it does not correspond to the definition given in § Definition.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt bfeef67fac38).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  32. Theorem · supporting · Asymptotic expansion

    Not formalized
    In the present situation, this relation gk = o(gk − 1) actually follows from combining steps k and k−1; by subtracting f − g1 − ⋯ − gk − 2 = gk − 1 + o(gk − 1) from f − g1 − ⋯ − gk − 2 − gk − 1 = gk + o(gk), one gets gk + o(gk) = o(gk − 1),…

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt a53c94db4614).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  33. Theorem · supporting · Asymptotic expansion

    Not formalized
    In case the asymptotic expansion does not converge, for any particular value of the argument there will be a particular partial sum which provides the best approximation and adding additional terms will decrease the accuracy.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 74bd39838de3).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  34. Theorem · main statement · Asymptotic expansion › Examples of asymptotic expansions

    Not formalized
    Gamma function exxx√2πxΓ(x + 1) ∼ 1 + 112x + 1288x2 − 13951840x3 − ⋯ (x → ∞)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt e746fd27f33e).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  35. Theorem · main statement · Asymptotic expansion › Examples of asymptotic expansions

    Not formalized
    Exponential integral xexE1(x) ∼ ∑∞n = 0 (−1)nn!xn (x → ∞)

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 9afefefe2239).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  36. Theorem · main statement · Asymptotic expansion › Examples of asymptotic expansions

    Not formalized
    Error function √πxex2erfc(x) ∼ 1 + ∑∞n = 1(−1)n(2n − 1)!!n!(2x2)n (x → ∞) where m!! is the double factorial.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 6fcbeb048378).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  37. Theorem · supporting · Asymptotic expansion › Worked example

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For example, we might start with the formal power series 11 − w = ∑∞n = 0 wn

    Show in article · Read it in context on Wikipedia

    PowerSeries.mk_one_mul_one_sub_eq_one more general

    theorem PowerSeries.mk_one_mul_one_sub_eq_one (S : Type*) [CommRing S] : PowerSeries.mk 1 * (1 - PowerSeries.X) = 1

    Mathlib.RingTheory.PowerSeries.WellKnown · lines 78–83

    Why more general: Mathlib writes the series whose coefficients are all one as mk 1 and states the identity as a product with 1 minus X over an arbitrary commutative coefficient ring.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5dcf904eb41e · pair key 252065da31d2.

    TauCeti.powerSeries_mk_pow_mul_one_sub_C_mul_X_eq_one more general

    theorem TauCeti.powerSeries_mk_pow_mul_one_sub_C_mul_X_eq_one {R : Type*} [Ring R] (a : R) : (PowerSeries.mk fun n ↦ a ^ n) * (1 - PowerSeries.C a * PowerSeries.X) = 1

    TauCeti.RingTheory.PowerSeries.Geometric · lines 31–38

    Why more general: The declaration carries a scalar parameter and states the identity for the series in that scalar times the indeterminate, over an arbitrary ring of coefficients.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
    • Location key 3d315cccdfcd · pair key 68c2b576c72c.
  38. Theorem · supporting · Asymptotic expansion › Worked example

    Partial

    Partial: Mathlib states part of this (proved).

    The expression on the left is valid on the entire complex plane w ≠ 1, while the right hand side converges only for |w| < 1.

    Show in article · Read it in context on Wikipedia

    summable_geometric_iff_norm_lt_one states part

    theorem summable_geometric_iff_norm_lt_one {K : Type*} [NormedDivisionRing K] {ξ : K} : (Summable fun n ↦ ξ ^ n) ↔ ‖ξ‖ < 1

    Mathlib.Analysis.SpecificLimits.Normed · lines 502–508

    Why only part: Mathlib ties summability of the powers of a scalar to the bound on its modulus as an equivalence, over any normed division ring; its Summable is unconditional summability over the naturals, which for powers of a complex number agrees with convergence of the geometric series.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ed362df0378b · pair key 6b72bcac5f42.
  39. Theorem · supporting · Asymptotic expansion › Worked example

    Not formalized
    Multiplying by e−w/t and integrating both sides yields ∫∞0 e−wt1 − w dw = ∑∞n = 0 tn + 1∫∞0 e−uun du

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 0b2cc44a4b1f).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  40. Theorem · supporting · Asymptotic expansion › Worked example

    Not formalized
    The integral on the left hand side can be expressed in terms of the exponential integral.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt a73269ad6d06).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  41. Theorem · supporting · Asymptotic expansion › Worked example

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The integral on the right hand side, after the substitution u = w/t, may be recognized as the gamma function.

    Show in article · Read it in context on Wikipedia

    Real.Gamma_eq_integral more general

    theorem Real.Gamma_eq_integral {s : ℝ} : 0 < s → Real.Gamma s = ∫ (x : ℝ) in Set.Ioi 0, Real.exp (-x) * x ^ (s - 1)

    Mathlib.Analysis.SpecialFunctions.Gamma.Basic · lines 405–408

    Why more general: Lean writes the exponent as a real power of the variable; at parameter n+1 that is the passage's whole-number power of the integration variable, the same operation in two encodings.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 472c8900e45d · pair key c787583e00e6.
  42. Theorem · main statement · Asymptotic expansion › Worked example

    Not formalized
    Evaluating both, one obtains the asymptotic expansion e−1tEi(1t) = ∑∞n = 0 n! tn + 1

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 3 candidates examined (receipt 92dae5eef032).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  43. Theorem · supporting · Asymptotic expansion › Worked example

    Not formalized
    Here, the right hand side is clearly not convergent for any non-zero value of t.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 4a6cde3e1316).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  44. Definition · main statement · Asymptotic distribution

    Not formalized
    In mathematical statistics, an asymptotic distribution is a hypothetical distribution that is in a sense the "limiting" distribution of a sequence of distributions.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 2 candidates examined (receipt 96cb598a65f9).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  45. Definition · supporting · Asymptotic distribution

    Not formalized
    A distribution is an ordered set of random variables Zi for i = 1, …, n, for some positive integer n.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt c29de208584e).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  46. Definition · supporting · Asymptotic distribution

    Not formalized
    An asymptotic distribution allows i to range without bound, that is, n is infinite.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt d862e975fca6).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  47. Definition · supporting · Asymptotic distribution

    Not formalized
    A special case of an asymptotic distribution is when the late entries go to zero—that is, the Zi go to 0 as i goes to infinity.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 52c2e32b2970).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  48. Definition · supporting · Asymptotic distribution

    Formalized

    Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).

    This is based on the notion of an asymptotic function which cleanly approaches a constant value (the asymptote) as the independent variable goes to infinity; "clean" in this sense meaning that for any desired closeness epsilon there is some value of the independent variable after which the function never differs from the constant by more than epsilon.

    Show in article · Read it in context on Wikipedia

    Metric.tendsto_atTop close match

    theorem Metric.tendsto_atTop {α : Type u} {β : Type v} [PseudoMetricSpace α] [Nonempty β] [SemilatticeSup β] {u : β → α} {a : α} : Filter.Tendsto u Filter.atTop (𝓝 a) ↔ ∀ ε > 0, ∃ N, ∀ n ≥ N, Dist.dist (u n) a < ε

    Mathlib.Topology.MetricSpace.Pseudo.Defs · lines 910–913

    Why close, not exact: Lean writes the condition with a distance that drops below epsilon past some index, where the passage lets the difference reach epsilon; both phrasings cut out the same functions.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8c3c464b6cdf · pair key 329780abf8d1.

    Filter.Tendsto more general

    def Filter.Tendsto {α : Type*} {β : Type*} : (α → β) → Filter α → Filter β → Prop

    Mathlib.Order.Filter.Defs · lines 421–422

    Why more general: This is the library's limit predicate for arbitrary filters; the passage's notion is the instance taken along large arguments towards a constant.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7ca4b98b969d · pair key 795b453696bc.
  49. Definition · main statement · Asymptotic distribution

    Not formalized
    An asymptote is a straight line that a curve approaches but never meets or crosses.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt d21b001ce79a).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  50. Example · supporting · Asymptotic distribution

    Formalized

    Formalized: Mathlib states a more general result (proved).

    In the equation y = 1x, y becomes arbitrarily small in magnitude as x increases.

    Show in article · Read it in context on Wikipedia

    tendsto_inv_atTop_zero more general

    theorem tendsto_inv_atTop_zero {𝕜 : Type*} [Semifield 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [TopologicalSpace 𝕜] [OrderTopology 𝕜] : Filter.Tendsto (fun r ↦ r⁻¹) Filter.atTop (𝓝 0)

    Mathlib.Topology.Algebra.Order.Field · lines 75–76

    Why more general: Lean states it for any linearly ordered semifield with the order topology; the passage reads it on the real line.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d37b1d9c46b4 · pair key 65abd82adf3d.

    tendsto_inv_atTop_nhds_zero_nat special case

    theorem tendsto_inv_atTop_nhds_zero_nat {𝕜 : Type*} [DivisionSemiring 𝕜] [CharZero 𝕜] [TopologicalSpace 𝕜] [ContinuousSMul ℚ≥0 𝕜] : Filter.Tendsto (fun n ↦ (↑n)⁻¹) Filter.atTop (𝓝 0)

    Mathlib.Analysis.SpecificLimits.Basic · lines 45–49

    Why a special case: The variable here ranges over the whole numbers only, where the passage lets x run over the reals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3d5c7702a851 · pair key 87c837119d73.
  51. Theorem · supporting · Applications › Asymptotic versus Numerical Analysis

    Not formalized
    A.A.: f(x) = x−1 + O(x−2)  (x → ∞).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 1d783c6aac19).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  52. Theorem · supporting · Applications › Asymptotic versus Numerical Analysis

    Not formalized
    A.A.: |f(x) − x−1| < 8x−2  (x > 104). N.A.: But my value of x is only 100.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 7f9cc4d9bbbc).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  53. Theorem · supporting · Applications › Asymptotic versus Numerical Analysis

    Not formalized
    My evaluations give |f(x) − x−1| < 57000x−2  (x > 100). N.A.: This is no news to me.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt a39d9d43e125).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  54. Theorem · supporting · Applications › Asymptotic versus Numerical Analysis

    Not formalized
    I know already that 0 < f(100) < 1.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 93a1541654b9).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).

Data: view model (JSON) · Literature Links records (JSONL)