-
Theorem · supporting
✓Formalized
Formalized: Mathlib states a more general result (proved).
For two functions f and g, under most circumstances the limit of their quotient can be evaluated as the quotient of the limits: limx → c f(x)/g(x) = limx → c f(x)/limx → c g(x).
Show in article · Read it in context on Wikipedia ↗
Filter.Tendsto.div more general
theorem Filter.Tendsto.div {α : Type*} {G₀ : Type*} [GroupWithZero G₀] [TopologicalSpace G₀] [ContinuousInv₀ G₀] [ContinuousMul G₀] {f g : α → G₀} {l : Filter α} {a b : G₀} : Filter.Tendsto f l (𝓝 a) → Filter.Tendsto g l (𝓝 b) → b ≠ 0 → Filter.Tendsto (f / g) l (𝓝 (a / b))
Mathlib.Topology.Algebra.GroupWithZero · lines 189–191
Why more general: Mathlib states the law for an arbitrary filter and any topological group with zero, and it spells out as a hypothesis the non-vanishing of the denominator's limit that the passage leaves as a proviso.
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
883d0ec60da3 · pair key b9557eeb5d23.
Sign in to tag this passage
-
Theorem · Subject of the article
◔Partial
Partial: Mathlib states a special case (proved).
L'Hôpital's rule states that in such cases, under the assumption that there exists an open interval containing c in which g′ never equals zero except possibly at c, limx → c f(x)g(x) = limx → c f′(x)g′(x), whenever the right-hand-side limit exists.
Show in article · Read it in context on Wikipedia ↗
deriv.lhopital_zero_nhdsNE special case
theorem deriv.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 421–427
Why a special case: The passage allows either indeterminate form and either a finite or an infinite point; this declaration covers the vanishing case at a real point, requiring differentiability and the non-vanishing of the derivative of g only near that point.
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
96e519a127ec · pair key 42807a64ede7.
HasDerivAt.lhopital_zero_nhdsNE special case
theorem HasDerivAt.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f f' g g' : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, HasDerivAt f (f' x) x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, HasDerivAt g (g' x) x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, g' x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ f' x / g' x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 287–294
Why a special case: A variant of the same vanishing case in which the derivatives are supplied by differentiability hypotheses rather than by the derivative operator.
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
867e99838e01 · pair key 6f03ba65229d.
Sign in to tag this passage
-
Notation · supporting
✓Formalized
Formalized: Mathlib states a more general result (a definition).
Here, f′ and g′ are the derivatives of f and g .
Show in article · Read it in context on Wikipedia ↗
deriv more general
def deriv {𝕜 : Type u} [NontriviallyNormedField 𝕜] {F : Type v} [AddCommGroup F] [_root_.Module 𝕜 F] [TopologicalSpace F] : (𝕜 → F) → 𝕜 → F
Mathlib.Analysis.Calculus.Deriv.Basic · lines 154–155
Why more general: Mathlib defines the derivative for maps out of any nontrivially normed field into a topological module over it, and assigns the value zero at points where the function has no derivative.
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
88b499dd1d3a · pair key 36029aa4308e.
Sign in to tag this passage
-
Notation · supporting · General form
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
The general form of l'Hôpital's rule covers many cases. Let c and L be extended real numbers: real numbers, as well as positive and negative infinity.
Show in article · Read it in context on Wikipedia ↗
EReal close match
def EReal : Type
Mathlib.Data.EReal.Basic · lines 35–39
Why close, not exact: Mathlib builds this type by adjoining a least and a greatest element to the reals, and those two adjoined elements serve as the two infinities the passage names.
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
414767c67d0c · pair key 8e37d5f21b7d.
Sign in to tag this passage
-
Notation · supporting · General form
◔Partial
Partial: Mathlib states a special case (a definition).
Let I be an open interval containing c (for a two-sided limit) or an open interval with endpoint c (for a one-sided limit, or a limit at infinity if c is infinite).
Show in article · Read it in context on Wikipedia ↗
Set.Ioo special case
def Set.Ioo {α : Type*} [Preorder α] : α → α → Set α
Mathlib.Order.Interval.Set.Defs · line 52
Why a special case: Mathlib's open interval is defined in any preorder and always has two named endpoints, so it realises the passage's interval in the bounded cases but not the unbounded one the passage allows when its point is infinite.
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
a4346bfdf069 · pair key 551ebf858ab6.
Set.Ioi special case
def Set.Ioi {α : Type*} [Preorder α] : α → Set α
Mathlib.Order.Interval.Set.Defs · line 37
Why a special case: It is the open interval unbounded above, the shape the passage's interval takes when its point is infinite, with the mirror image given by the corresponding ray below a point.
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
8080a6b863b8 · pair key f16065ee766c.
Sign in to tag this passage
-
Definition · supporting · General form
◔Partial
Partial: Mathlib states part of this (a Prop-valued definition: it states the claim without proving it).
Assumption 1: On I ∖ {c}, the real-valued functions f and g are differentiable with g′(x) ≠ 0.
Show in article · Read it in context on Wikipedia ↗
DifferentiableOn states part
def DifferentiableOn (𝕜 : Type*) [NontriviallyNormedField 𝕜] {E : Type*} [AddCommGroup E] [_root_.Module 𝕜 E] [TopologicalSpace E] {F : Type*} [AddCommGroup F] [_root_.Module 𝕜 F] [TopologicalSpace F] : (E → F) → Set E → Prop
Mathlib.Analysis.Calculus.FDeriv.Defs · lines 165–166
Why only part: It carries the differentiability requirement of the assumption; the further demand that the derivative of g not vanish on that set is a separate condition this notion does not express.
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
db1a7baba0a0 · pair key f0f774f01fd1.
Related, but states something else
deriv related
def deriv {𝕜 : Type u} [NontriviallyNormedField 𝕜] {F : Type v} [AddCommGroup F] [_root_.Module 𝕜 F] [TopologicalSpace F] : (𝕜 → F) → 𝕜 → F
Mathlib.Analysis.Calculus.Deriv.Basic · lines 154–155
How it differs: The assumption's second half speaks of the derivative of g, which this operator names, but the operator asserts nothing about its vanishing.
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. - 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
462ebe1c55be · pair key 50a0eafa5a2c.
Sign in to tag this passage
-
Theorem · main statement · General form
◔Partial
Partial: Mathlib states part of this (proved).
If either a)limx → c f(x) = limx → c g(x) = 0 or b)limx → c |f(x)| = limx → c |g(x)| = ∞, then limx → c f(x)g(x) = limx → c f′(x)g′(x) = L.
Show in article · Read it in context on Wikipedia ↗
deriv.lhopital_zero_nhdsNE states part
theorem deriv.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 421–427
Why only part: The conjunct lets the point be any extended real, while this declaration treats a real point approached from both sides, so it covers that case of the conjunct.
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
c452e027e553 · pair key 8f2f05cc841e.
deriv.lhopital_zero_atTop states part
theorem deriv.lhopital_zero_atTop {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in Filter.atTop, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in Filter.atTop, deriv g x ≠ 0) → Filter.Tendsto f Filter.atTop (𝓝 0) → Filter.Tendsto g Filter.atTop (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) Filter.atTop l → Filter.Tendsto (fun x ↦ f x / g x) Filter.atTop l
Mathlib.Analysis.Calculus.LHopital · lines 439–450
Why only part: It is the conjunct for the one infinite point, with the hypotheses required eventually rather than on a whole interval.
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
0cf5bf2de74e · pair key 8ce60108006e.
deriv.lhopital_zero_atBot states part
theorem deriv.lhopital_zero_atBot {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in Filter.atBot, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in Filter.atBot, deriv g x ≠ 0) → Filter.Tendsto f Filter.atBot (𝓝 0) → Filter.Tendsto g Filter.atBot (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) Filter.atBot l → Filter.Tendsto (fun x ↦ f x / g x) Filter.atBot l
Mathlib.Analysis.Calculus.LHopital · lines 453–463
Why only part: The mirror image of the case at positive infinity, again with the hypotheses required only eventually.
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
b13f26ea9dad · pair key 8035617155bf.
Related, but states something else
MetaMathlibExt.stolz_cesaro related
theorem MetaMathlibExt.stolz_cesaro {a b : ℕ → ℝ} {L : ℝ} : StrictMono b → Filter.Tendsto b Filter.atTop Filter.atTop → Filter.Tendsto (fun n ↦ (a (n + 1) - a n) / (b (n + 1) - b n)) Filter.atTop (𝓝 L) → Filter.Tendsto (fun n ↦ a n / b n) Filter.atTop (𝓝 L)
MathlibExt.Analysis.Series.StolzCesaro · line 26
How it differs: The discrete counterpart for real sequences whose denominator increases without bound: it replaces derivatives by differences of consecutive terms, a setting that neither contains nor is contained in the passage's functions on an interval, so it states neither case.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 4 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
ce1b37c7fd13 · pair key 4feadffab1dc.
Sign in to tag this passage
-
Theorem · supporting · General form
◔Partial
Partial: Mathlib states a special case (proved).
Although we have written x → c throughout, the limits may also be one-sided limits ( x → c+ or x → c−), when c is a finite endpoint of I.
Show in article · Read it in context on Wikipedia ↗
deriv.lhopital_zero_right_on_Ioo special case
theorem deriv.lhopital_zero_right_on_Ioo {a b : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : a < b → DifferentiableOn ℝ f (Set.Ioo a b) → (∀ x ∈ Set.Ioo a b, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[>] a) (𝓝 0) → Filter.Tendsto g (𝓝[>] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[>] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[>] a) l
Mathlib.Analysis.Calculus.LHopital · lines 184–194
Why a special case: This is the one-sided reading the passage allows, at a finite endpoint of the interval, restricted to the vanishing case and with the hypotheses imposed on the whole open interval.
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
8ca640ed0f2c · pair key 74069f0fdd74.
deriv.lhopital_zero_left_on_Ioo special case
theorem deriv.lhopital_zero_left_on_Ioo {a b : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : a < b → DifferentiableOn ℝ f (Set.Ioo a b) → (∀ x ∈ Set.Ioo a b, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[<] b) (𝓝 0) → Filter.Tendsto g (𝓝[<] b) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[<] b) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[<] b) l
Mathlib.Analysis.Calculus.LHopital · lines 207–217
Why a special case: The mirror image of the right-hand version, covering the other one-sided reading at a finite endpoint of the interval, in the vanishing case only.
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. - 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
3e533f0a3d8e · pair key 411863344815.
deriv.lhopital_zero_nhdsGT special case
theorem deriv.lhopital_zero_nhdsGT {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[>] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[>] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[>] a) (𝓝 0) → Filter.Tendsto g (𝓝[>] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[>] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[>] a) l
Mathlib.Analysis.Calculus.LHopital · lines 402–408
Why a special case: Same one-sided reading, with differentiability and non-vanishing of the derivative of g asked for only eventually on the right of the point.
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. - 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
2dc20b353c68 · pair key d75f374efae5.
deriv.lhopital_zero_nhdsLT special case
theorem deriv.lhopital_zero_nhdsLT {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[<] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[<] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[<] a) (𝓝 0) → Filter.Tendsto g (𝓝[<] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[<] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[<] a) l
Mathlib.Analysis.Calculus.LHopital · lines 411–417
Why a special case: The left-hand counterpart, again with the hypotheses asked for only eventually on that side of the point.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 4 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
105465c11752 · pair key 1d5cdbf26ac4.
Sign in to tag this passage
-
Theorem · supporting · General form
✕Not formalized
In the second case b), the hypothesis that f diverges to infinity is not necessary; in fact, it is sufficient that limx → c |g(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 85c97026f47e). - 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).
Sign in to tag this passage
-
Definition · supporting · Necessity of conditions: Counterexamples
✕Not formalized
All four conditions for l'Hôpital's rule are necessary:
Indeterminacy of form: limx → c f(x) = limx → c g(x) = 0 or ±∞;
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 5eff6f8667e3). - 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).
Sign in to tag this passage
-
Definition · supporting · Necessity of conditions: Counterexamples
✓Formalized
Formalized: Mathlib states a more general result (a Prop-valued definition: it states the claim without proving it).
Indeterminacy of form: limx → c f(x) = limx → c g(x) = 0 or ±∞;
Differentiability of functions: f and g are differentiable on an open interval I except possibly at the limit point c in I;
Show in article · Read it in context on Wikipedia ↗
DifferentiableOn more general
def DifferentiableOn (𝕜 : Type*) [NontriviallyNormedField 𝕜] {E : Type*} [AddCommGroup E] [_root_.Module 𝕜 E] [TopologicalSpace E] {F : Type*} [AddCommGroup F] [_root_.Module 𝕜 F] [TopologicalSpace F] : (E → F) → Set E → Prop
Mathlib.Analysis.Calculus.FDeriv.Defs · lines 165–166
Why more general: Mathlib's predicate is written for an arbitrary nontrivially normed field and arbitrary topological modules over it, and the passage's real functions on a punctured interval are one reading of 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, 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
71a020295635 · pair key 71648c83d2ea.
Sign in to tag this passage
-
Definition · supporting · Necessity of conditions: Counterexamples
✕Not formalized
Differentiability of functions: f and g are differentiable on an open interval I except possibly at the limit point c in I;
Non-zero derivative of denominator: g′(x) ≠ 0 for all x in I with x ≠ c;
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 08aa78681c17). - 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).
Sign in to tag this passage
-
Definition · supporting · Necessity of conditions: Counterexamples
✕Not formalized
Non-zero derivative of denominator: g′(x) ≠ 0 for all x in I with x ≠ c;
Existence of limit of the quotient of the derivatives: limx → c f′(x)g′(x) exists.
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 c32f0e721707). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples
✕Not formalized
Where one of the above conditions is not satisfied, l'Hôpital's rule is not valid in general, and its conclusion may be false in certain cases.
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 270bc59ba136). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 1. Form is not indeterminate
✕Not formalized
The first condition is not satisfied for this counterexample because limx → 1 f(x) = limx → 1(x + 1) = (1) + 1 = 2 ≠ 0 and limx → 1 g(x) = limx → 1(2x + 1) = 2(1) + 1 = 3 ≠ 0.
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 cec9badf8fff). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 1. Form is not indeterminate
✓Formalized
Formalized: Mathlib states a more general result (proved).
The first condition is not satisfied for this counterexample because limx → 1 f(x) = limx → 1(x + 1) = (1) + 1 = 2 ≠ 0 and limx → 1 g(x) = limx → 1(2x + 1) = 2(1) + 1 = 3 ≠ 0.
Show in article · Read it in context on Wikipedia ↗
Polynomial.continuousAt more general
theorem Polynomial.continuousAt {R : Type*} [Semiring R] [TopologicalSpace R] [IsTopologicalSemiring R] (p : R[X]) {a : R} : ContinuousAt (fun x ↦ Polynomial.eval x p) a
Mathlib.Topology.Algebra.Polynomial · lines 58–59
Why more general: The declaration is stated for an arbitrary polynomial over a topological semiring at an arbitrary argument, and it gives the limit along the whole neighbourhood of one, from which the passage's limit as x approaches one follows by restricting the filter; writing the passage's two affine functions as evaluations of X plus one and twice X plus one is an encoding.
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
a63dcb47a6de · pair key 29d0314bdb8f.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 1. Form is not indeterminate
✕Not formalized
This means that the form is not indeterminate.
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 4f2cb68b5347). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 1. Form is not indeterminate
◔Partial
Partial: Mathlib states part of this (proved).
The second and third conditions are satisfied by f(x) and g(x).
Show in article · Read it in context on Wikipedia ↗
Polynomial.differentiable states part
theorem Polynomial.differentiable {𝕜 : Type u} [NontriviallyNormedField 𝕜] (p : 𝕜[X]) : Differentiable 𝕜 fun x ↦ Polynomial.eval x p
Mathlib.Analysis.Calculus.Deriv.Polynomial · line 96
Why only part: Stated for every polynomial over a nontrivially normed field, so it covers the two real polynomials of the counterexample; writing x + 1 and 2x + 1 as evaluations of X + 1 and 2X + 1 is only the polynomial encoding of 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, 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
8c8c77972504 · pair key 2ffd90a32cfe.
Related, but states something else
Polynomial.deriv related
theorem Polynomial.deriv {𝕜 : Type u} [NontriviallyNormedField 𝕜] {x : 𝕜} (p : 𝕜[X]) : deriv (fun x ↦ Polynomial.eval x p) x = Polynomial.eval x (Polynomial.derivative p)
Mathlib.Analysis.Calculus.Deriv.Polynomial · lines 108–109
How it differs: It gives the derivative of a polynomial evaluation as the evaluation of the derivative polynomial; getting the denominator's derivative to be the nonzero constant 2 needs the separate derivative rules for sums and scalar multiples.
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
f989b0be6890 · pair key e57c97cbec29.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 1. Form is not indeterminate
✕Not formalized
The fourth condition is also satisfied with limx → 1 f′(x)g′(x) = limx → 1 (x + 1)′(2x + 1)′ = limx → 1 12 = 12.
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 b898c1b628b5). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 1. Form is not indeterminate
✕Not formalized
But the conclusion fails, since
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 80f9694660a4). - 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).
Related, but states something else
deriv.lhopital_zero_nhds related
theorem deriv.lhopital_zero_nhds {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝 a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝 a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝 a) (𝓝 0) → Filter.Tendsto g (𝓝 a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝 a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 430–436
How it differs: It concludes the rule when both functions tend to zero, which is precisely the hypothesis this pair violates, so it neither asserts nor denies the failure the passage reports.
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
1dd58ffa74fb · pair key d4b68bc2ce96.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 1. Form is not indeterminate
✕Not formalized
But the conclusion fails, since
limx → 1 f(x)g(x) = limx → 1 x + 12x + 1 = limx → 1(x + 1)limx → 1(2x + 1) = 23 ≠ 12.
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 1b6d81d3ece4). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 2. Differentiability of functions
✕Not formalized
For example, let f(x) = {sin x,x ≠ 01,x = 0, g(x) = x, and c = 0. In this case, f(x) is not differentiable at c.
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 3 candidates examined (receipt 85fd3dbe2c33). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 2. Differentiability of functions
✕Not formalized
However, since f(x) is differentiable everywhere except c, then limx → c f′(x) still exists.
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 cd014aeba6a7). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 2. Differentiability of functions
✕Not formalized
Thus, since limx → c f(x)g(x) = 00 and limx → c f′(x)g′(x) exists, l'Hôpital's rule still holds.
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 3 candidates examined (receipt fcf7153afa3d). - 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).
Related, but states something else
deriv.lhopital_zero_nhdsNE related
theorem deriv.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 421–427
How it differs: It is the form of the rule that asks for differentiability only on a punctured neighbourhood, so it fits this example, but applying it here still needs the differentiability of sine away from the origin and the value of the identity's derivative, each a separate lemma.
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
e82b7f90e309 · pair key 8fa688ef27cb.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 3. Derivative of denominator is zero
✕Not formalized
Let f(x) = x + sin xcos x and g(x) = f(x)esin x. Then there is no limit for f(x)/g(x) as x → ∞. However,
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 19e7bfe0cfe6). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 3. Derivative of denominator is zero
✕Not formalized
Let f(x) = x + sin xcos x and g(x) = f(x)esin x. Then there is no limit for f(x)/g(x) as x → ∞. However, f′(x)g′(x)= 2cos2 x(2cos2 x)esin x + (x + sin xcos x)esin xcos x= 2cos x2cos x + x + sin xcos xe−sin x, which tends to 0 as x → ∞, while the original expression before cancellation of cos x is undefined at infinitely many points.
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 519d5a9871ab). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
✕Not formalized
The requirement that the limit limx → c f′(x)g′(x) exists is essential; if it does not exist, the original limit limx → c f(x)g(x) may nevertheless exist.
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 bc00f3fabc8e). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
deriv.lhopital_zero_nhdsNE related
theorem deriv.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 421–427
How it differs: The library states the rule with this very assumption in force.
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
019288e3d0b5 · pair key 5c4f9d6389cf.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
✕Not formalized
The requirement that the limit limx → c f′(x)g′(x) exists is essential; if it does not exist, the original limit limx → c f(x)g(x) may nevertheless exist.
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 0259c403b1e5). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
deriv.lhopital_zero_atTop related
theorem deriv.lhopital_zero_atTop {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in Filter.atTop, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in Filter.atTop, deriv g x ≠ 0) → Filter.Tendsto f Filter.atTop (𝓝 0) → Filter.Tendsto g Filter.atTop (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) Filter.atTop l → Filter.Tendsto (fun x ↦ f x / g x) Filter.atTop l
Mathlib.Analysis.Calculus.LHopital · lines 439–450
How it differs: The library never treats the case of a diverging derivative quotient.
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
02786ac7a5de · pair key 552f7733f930.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
✕Not formalized
For example, if f(x) = x + sin(x), g(x) = x and c = ∞, then f′(x)g′(x) = 1 + cos(x)1, which does not approach a limit since cosine oscillates infinitely between 1 and −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 0 candidates examined (receipt c86107f2a8ed). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
◔Partial
Partial: Mathlib states part of this (proved).
which does not approach a limit since cosine oscillates infinitely between 1 and −1.
Show in article · Read it in context on Wikipedia ↗
Real.range_cos states part
theorem Real.range_cos : Set.range Real.cos = Set.Icc (-1) 1
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 636–637
Why only part: The declaration pins the band of values but says nothing about recurrence.
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
4e5443b6e41f · pair key de5d652c0b91.
Real.cos_periodic states part
theorem Real.cos_periodic : Function.Periodic Real.cos (2 * π)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Basic · lines 312–313
Why only part: Periodicity gives the endless repetition but not the values reached.
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
c13763f64f43 · pair key a9f65e6d0de1.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
✕Not formalized
But the ratio of the original functions does approach a limit, since the amplitude of the oscillations of f becomes small relative to g: limx → ∞ f(x)g(x) = limx → ∞(x + sin(x)x) = limx → ∞(1 + sin(x)x) = 1 + 0 = 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 83de70efa70d). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
✕Not formalized
In a case such as this, all that can be concluded is that liminfx → c f′(x)g′(x) ≤ liminfx → c f(x)g(x) ≤ limsupx → c f(x)g(x) ≤ limsupx → c f′(x)g′(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 2ca4ae154246). - 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).
Related, but states something else
Filter.liminf_le_limsup related
theorem Filter.liminf_le_limsup {α : Type*} {β : Type*} [ConditionallyCompleteLattice α] {f : Filter β} [f.NeBot] {u : β → α} : autoParam (Filter.IsBoundedUnder (fun x1 x2 ↦ x1 ≤ x2) f u) Filter.liminf_le_limsup._auto_1 → autoParam (Filter.IsBoundedUnder (fun x1 x2 ↦ x1 ≥ x2) f u) Filter.liminf_le_limsup._auto_3 → Filter.liminf u f ≤ Filter.limsup u f
Mathlib.Order.LiminfLimsup · lines 154–158
How it differs: It holds of any bounded function and mentions no derivative at all.
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
5d666f60442e · pair key 1523099aad23.
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
✕Not formalized
…liminfx → c f′(x)g′(x) ≤ liminfx → c f(x)g(x) ≤ limsupx → c f(x)g(x) ≤ limsupx → c f′(x)g′(x),
so that if the limit of fg exists, then it must lie between the inferior and superior limits of f′g′.
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 411da0ecddb8). - 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).
Sign in to tag this passage
-
Example · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
✕Not formalized
In the example, 1 does indeed lie between 0 and 2.)
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 cf5cd17b5f71). - 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).
Sign in to tag this passage
-
Theorem · supporting · Necessity of conditions: Counterexamples › 4. Limit of derivatives does not exist
◔Partial
Partial: Mathlib states a special case (proved).
Note also that by the contrapositive form of the Rule, if limx → c f(x)g(x) does not exist, then limx → c f′(x)g′(x) also does not exist.
Show in article · Read it in context on Wikipedia ↗
deriv.lhopital_zero_nhdsNE special case
theorem deriv.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 421–427
Why a special case: Mathlib carries only the hypothesis that both functions vanish in the limit, so this covers the zero-over-zero half of the rule's hypotheses at a finite point.
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
a5cb804e9348 · pair key f46805a4a449.
HasDerivAt.lhopital_zero_nhdsNE special case
theorem HasDerivAt.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f f' g g' : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, HasDerivAt f (f' x) x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, HasDerivAt g (g' x) x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, g' x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ f' x / g' x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 287–294
Why a special case: Same restriction to the vanishing case as the deriv form, with derivatives supplied rather than computed.
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
7e198eecebd8 · pair key 4c5a0fe91e35.
deriv.lhopital_zero_atTop special case
theorem deriv.lhopital_zero_atTop {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in Filter.atTop, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in Filter.atTop, deriv g x ≠ 0) → Filter.Tendsto f Filter.atTop (𝓝 0) → Filter.Tendsto g Filter.atTop (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) Filter.atTop l → Filter.Tendsto (fun x ↦ f x / g x) Filter.atTop l
Mathlib.Analysis.Calculus.LHopital · lines 439–450
Why a special case: Covers the infinite limit point that the article also allows, again only under the vanishing hypothesis.
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, 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
6c0f8a55d6da · pair key ac4bc273e741.
Sign in to tag this passage
-
Example · supporting · Examples
✕Not formalized
Example application of l'Hôpital's rule to f(x) = sin x and g(x) = −0.5x: the function h(x) = f(x)/g(x) is undefined at x = 0, but can be completed to a continuous function on all of ℝ by defining h(0) = f′(0)/g′(0) = −2 (colors marked in legend).
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 f6d7091c998d). - 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).
Related, but states something else
Real.tendsto_sin_div_nhdsNE_zero related
theorem Real.tendsto_sin_div_nhdsNE_zero : Filter.Tendsto (fun x ↦ Real.sin x / x) (𝓝[≠] 0) (𝓝 1)
Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv · lines 412–414
How it differs: Rescaling the denominator and building the extension over the whole line both need further lemmas, so this stays short of the passage.
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
56ae4937ac7e · pair key 5fb76a79d50b.
Sign in to tag this passage
-
Theorem · supporting · Examples
✕Not formalized
Here is a basic example involving the exponential function, which involves the indeterminate form 00 at x = 0: limx → 0 ex − 1x2 + x = H limx → 0 ddx(ex − 1)ddx(x2 + x) = limx → 0 ex2x + 1 = 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 a1215725cc35). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
TauCeti.tendsto_exp_mul_sub_one_div related
theorem TauCeti.tendsto_exp_mul_sub_one_div (a : ℝ) : Filter.Tendsto (fun t ↦ (Real.exp (a * t) - 1) / t) (𝓝[>] 0) (𝓝 a)
TauCeti.Analysis.Calculus.ExponentialSlope · lines 28–34
How it differs: It is one-sided and its denominator is the bare argument, so it is a neighbouring fact rather than the limit computed here.
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
83245ab. - Location key
a8c2d7d78ba1 · pair key 33d9bdb3e0cf.
Sign in to tag this passage
-
Theorem · supporting · Examples
✕Not formalized
In this case, the limit may be evaluated by applying the rule three times: limx → 0 2sin(x) − sin(2x)x − sin(x)= H limx → 0 2cos(x) − 2cos(2x)1 − cos(x)= H limx → 0 −2sin(x) + 4sin(2x)sin(x)= H limx → 0 −2cos(x) + 8cos(2x)cos(x) = −2 + 81 = 6.
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 ce6acab290b1). - 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).
Sign in to tag this passage
-
Theorem · supporting · Examples
◔Partial
Partial: Mathlib states a special case (proved).
Here is an example involving ∞∞: limx → ∞ xn ⋅ e−x = limx → ∞ xnex = H limx → ∞ nxn − 1ex = n ⋅ limx → ∞ xn − 1ex. Repeatedly apply l'Hôpital's rule until the exponent is zero (if n is an integer) or negative (if n is fractional) to conclude that the limit is zero.
Show in article · Read it in context on Wikipedia ↗
Real.tendsto_pow_mul_exp_neg_atTop_nhds_zero special case
theorem Real.tendsto_pow_mul_exp_neg_atTop_nhds_zero (n : ℕ) : Filter.Tendsto (fun x ↦ x ^ n * Real.exp (-x)) Filter.atTop (𝓝 0)
Mathlib.Analysis.SpecialFunctions.Exp · lines 269–272
Why a special case: Mathlib restricts the exponent to a whole number and gives the limit's value directly, which settles both ends of the displayed chain at once.
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
34b7c312ccd7 · pair key d1b2f2247bed.
Sign in to tag this passage
-
Theorem · supporting · Examples
✓Formalized
Formalized: Mathlib states a more general result (proved).
…limx → ∞ xn ⋅ e−x = limx → ∞ xnex = H limx → ∞ nxn − 1ex = n ⋅ limx → ∞ xn − 1ex. Repeatedly apply l'Hôpital's rule until the exponent is zero (if n is an integer) or negative (if n is fractional) to conclude that the limit is zero.
Show in article · Read it in context on Wikipedia ↗
tendsto_rpow_mul_exp_neg_mul_atTop_nhds_zero more general
theorem tendsto_rpow_mul_exp_neg_mul_atTop_nhds_zero (s b : ℝ) : 0 < b → Filter.Tendsto (fun x ↦ x ^ s * Real.exp (-b * x)) Filter.atTop (𝓝 0)
Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics · lines 140–143
Why more general: The exponent here ranges over every real number, which covers both the whole-number and the fractional exponents the passage allows.
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
2ee718838c18 · pair key 9323e7ca5cbc.
Real.tendsto_pow_mul_exp_neg_atTop_nhds_zero special case
theorem Real.tendsto_pow_mul_exp_neg_atTop_nhds_zero (n : ℕ) : Filter.Tendsto (fun x ↦ x ^ n * Real.exp (-x)) Filter.atTop (𝓝 0)
Mathlib.Analysis.SpecialFunctions.Exp · lines 269–272
Why a special case: Its exponent binder is ℕ, so it reaches the non-negative whole-number exponents of the passage and not the fractional ones.
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. - 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
03a0ca394a31 · pair key ce775ebfaf95.
Sign in to tag this passage
-
Theorem · supporting · Examples
✓Formalized
Formalized: Mathlib states a more general result (proved).
Here is an example involving the indeterminate form 0 ⋅ ∞ (see below), which is rewritten as the form ∞∞: limx → 0+ xln x = limx → 0+ ln x1x = H limx → 0+ 1x−1x2 = limx → 0+ − x = 0.
Show in article · Read it in context on Wikipedia ↗
tendsto_log_mul_rpow_nhdsGT_zero more general
theorem tendsto_log_mul_rpow_nhdsGT_zero {r : ℝ} : 0 < r → Filter.Tendsto (fun x ↦ Real.log x * x ^ r) (𝓝[>] 0) (𝓝 0)
Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics · lines 398–401
Why more general: Mathlib writes the logarithm first and the power second, and allows every positive exponent, of which the passage uses a single 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: 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
a81769a9c66c · pair key f010532ec397.
Sign in to tag this passage
-
Theorem · supporting · Examples
✕Not formalized
Let P be the principal (loan amount), r the interest rate per period and n the number of periods. When r is zero, the repayment amount per period is Pn (since only principal is being repaid); this is consistent with the formula for non-zero interest rates: limr → 0 Pr(1 + r)n(1 + r)n − 1 = H Plimr → 0 (1 + r)n + rn(1 + r)n − 1n(1 + r)n − 1 = Pn.…
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 84ec58dea4b5). - 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).
Sign in to tag this passage
-
Theorem · supporting · Examples
✕Not formalized
When r is zero, the repayment amount per period is Pn (since only principal is being repaid); this is consistent with the formula for non-zero interest rates: limr → 0 Pr(1 + r)n(1 + r)n − 1 = H Plimr → 0 (1 + r)n + rn(1 + r)n − 1n(1 + r)n − 1 = Pn.
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 1 candidates examined (receipt 5b65e44b6096). - 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).
Sign in to tag this passage
-
Theorem · main statement · Examples
✕Not formalized
If f is twice-differentiable in a neighborhood of x and its second derivative is continuous on this neighborhood, then limh → 0 f(x + h) + f(x − h) − 2f(x)h2= limh → 0 f′(x + h) − f′(x − h)2h= limh → 0 f′′(x + h) + f′′(x − h)2= f′′(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 4 queries and 3 candidates examined (receipt 5c2bdede11c6). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Examples
✕Not formalized
Sometimes l'Hôpital's rule is invoked in a tricky way: suppose f(x) + f′(x) converges as x → ∞ and that ex ⋅ f(x) converges to positive or negative infinity. Then: limx → ∞ f(x) = limx → ∞ ex ⋅ f(x)ex = H limx → ∞ ex(f(x) + f′(x))ex = limx → ∞(f(x) + f′(x)), and so, limx → ∞ f(x) exists and limx → ∞ f′(x) = 0. (This result remains true without the added hypothesis that ex ⋅ f(x) converges to positive or negative infinity, but the justification is then incomplete.)
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 5 queries and 3 candidates examined (receipt f611fe9f120b). - 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).
Sign in to tag this passage
-
Theorem · supporting · Examples
✕Not formalized
…limx → ∞ f(x) = limx → ∞ ex ⋅ f(x)ex = H limx → ∞ ex(f(x) + f′(x))ex = limx → ∞(f(x) + f′(x)), and so, limx → ∞ f(x) exists and limx → ∞ f′(x) = 0. (This result remains true without the added hypothesis that ex ⋅ f(x) converges to positive or negative infinity, but the justification is then incomplete.)
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 a1a456e196f6). - 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).
Sign in to tag this passage
-
Theorem · supporting · Complications
✕Not formalized
…limx → ∞ ex + e−xex − e−x = H limx → ∞ ex − e−xex + e−x = H limx → ∞ ex + e−xex − e−x = H ⋯. This situation can be dealt with by substituting y = ex and noting that y goes to infinity as x goes to infinity; with this substitution, this problem can be solved with a single application of the rule: limx → ∞ ex + e−xex − e−x = limy → ∞ y + y−1y − y−1 = H limy → ∞ 1 − y−21 + y−2 = 11 = 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 5 queries and 2 candidates examined (receipt a47a0f1f83c2). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Complications
✕Not formalized
Alternatively, the numerator and denominator can both be multiplied by ex, at which point L'Hôpital's rule can immediately be applied successfully limx → ∞ ex + e−xex − e−x = limx → ∞ e2x + 1e2x − 1 = H limx → ∞ 2e2x2e2x = 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 5 queries and 2 candidates examined (receipt d04606e472e7). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Complications
✕Not formalized
This situation too can be dealt with by a transformation of variables, in this case y = √x: limx → ∞ x12 + x−12x12 − x−12 = limy → ∞ y + y−1y − y−1 = H limy → ∞ 1 − y−21 + y−2 = 11 = 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 2 candidates examined (receipt 579acf2d79d6). - 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).
Sign in to tag this passage
-
Theorem · supporting · Complications
✕Not formalized
Again, an alternative approach is to multiply numerator and denominator by x1/2 before applying L'Hôpital's rule: limx → ∞ x12 + x−12x12 − x−12 = limx → ∞ x + 1x − 1 = H limx → ∞ 11 = 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 2 candidates examined (receipt 754e101657ce). - 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).
Sign in to tag this passage
-
Theorem · supporting · Complications
✓Formalized
Formalized: Mathlib states a more general result (proved).
For example, consider the proof of the derivative formula for powers of x: limh → 0 (x + h)n − xnh = nxn − 1.
Show in article · Read it in context on Wikipedia ↗
hasDerivAt_pow more general
theorem hasDerivAt_pow {𝕜 : Type*} [NontriviallyNormedField 𝕜] (n : ℕ) (x : 𝕜) : HasDerivAt (fun x ↦ x ^ n) (↑n * x ^ (n - 1)) x
Mathlib.Analysis.Calculus.Deriv.Pow · lines 137–139
Why more general: Mathlib records the derivative as HasDerivAt, whose content is the same difference quotient tending to the value (hasDerivAt_iff_tendsto_slope); the declaration is stated over any nontrivially normed field, and the reals are one instance of 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
8ba828dd1a98 · pair key a2883a035150.
hasStrictDerivAt_pow more general
theorem hasStrictDerivAt_pow {𝕜 : Type*} [NontriviallyNormedField 𝕜] (n : ℕ) (x : 𝕜) : HasStrictDerivAt (fun x ↦ x ^ n) (↑n * x ^ (n - 1)) x
Mathlib.Analysis.Calculus.Deriv.Pow · lines 129–131
Why more general: This is the two-variable form of the quotient, from which the passage's one-variable limit follows by weakening; the value it names is the same n·x^(n−1).
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
3ed974e491c2 · pair key fba4eb68942e.
Real.hasDerivAt_rpow_const special case
theorem Real.hasDerivAt_rpow_const {x p : ℝ} : x ≠ 0 ∨ 1 ≤ p → HasDerivAt (fun x ↦ x ^ p) (p * x ^ (p - 1)) x
Mathlib.Analysis.SpecialFunctions.Pow.Deriv · lines 452–460
Why a special case: Mathlib states this one for the reals with a real exponent, under the side condition that the base is nonzero or the exponent is at least one, so it reaches the passage's equation at the bases that condition admits.
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, 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
be2db8ca9a8b · pair key 8e955940f175.
Sign in to tag this passage
-
Theorem · supporting · Other indeterminate forms
✕Not formalized
For example, to evaluate a limit involving ∞ − ∞, convert the difference of two functions to a quotient: limx → 1(xx − 1 − 1ln x)= limx → 1 x ⋅ ln x − x + 1(x − 1) ⋅ ln x= H limx → 1 ln xx − 1x + ln x= limx → 1 x ⋅ ln xx − 1 + x ⋅ ln x= H limx → 1 1 + ln x1 + 1 + ln x = 1 + 01 + 1 + 0.
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 5 queries and 2 candidates examined (receipt 4baa7cde699c). - 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).
Sign in to tag this passage
-
Theorem · supporting · Other indeterminate forms
✕Not formalized
Here is an example involving the indeterminate form 00: limx → 0+ xx = limx → 0+ eln(xx) = limx → 0+ ex ⋅ ln x = limx → 0+ exp(x ⋅ ln x) = exp(limx → 0+ x ⋅ ln 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 4 queries and 3 candidates examined (receipt a4367b4fa8b3). - 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).
Sign in to tag this passage
-
Theorem · supporting · Other indeterminate forms
✓Formalized
Formalized: Mathlib states this exactly (proved).
It is valid to move the limit inside the exponential function because this function is continuous.
Show in article · Read it in context on Wikipedia ↗
Real.continuous_exp exact match
theorem Real.continuous_exp : Continuous Real.exp
Mathlib.Analysis.SpecialFunctions.Exp · lines 153–154
Note: Mathlib's exponential and the article's agree on the whole real line, and both assert continuity everywhere on 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
543a3081165d · pair key 1cee76740f63.
Sign in to tag this passage
-
Theorem · supporting · Other indeterminate forms
✓Formalized
Formalized: Mathlib states a more general result (proved).
The limit limx → 0+ x ⋅ ln x is of the indeterminate form 0 · ∞ dealt with in an example above: L'Hôpital may be used to determine that limx → 0+ x ⋅ ln x = 0.
Show in article · Read it in context on Wikipedia ↗
tendsto_log_mul_rpow_nhdsGT_zero more general
theorem tendsto_log_mul_rpow_nhdsGT_zero {r : ℝ} : 0 < r → Filter.Tendsto (fun x ↦ Real.log x * x ^ r) (𝓝[>] 0) (𝓝 0)
Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics · lines 398–401
Why more general: Mathlib writes the second factor as a real power of the variable and puts the logarithm first; at exponent one this is the article's variable times its logarithm, with the same one-sided 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 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
8499a0714a63 · pair key ba94709f84f2.
Real.continuous_mul_log more general
theorem Real.continuous_mul_log : Continuous fun x ↦ x * Real.log x
Mathlib.Analysis.SpecialFunctions.Log.NegMulLog · lines 45–59
Why more general: Mathlib proves the map taking a real number to itself times its logarithm is continuous on the whole line, and the article's limit at zero from the right is that map's value at 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 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
3d9b3aa6d3d5 · pair key 59143a435941.
Sign in to tag this passage
-
Theorem · supporting · Other indeterminate forms
✕Not formalized
Thus limx → 0+ xx = exp(0) = e0 = 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 82d793f790f4). - 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).
Sign in to tag this passage
-
Theorem · supporting · Geometric interpretation: parametric curve and velocity vector
✕Not formalized
Consider the parametric curve in the xy-plane with coordinates given by the continuous functions g(t) and f(t), the locus of points (g(t), f(t)), and suppose f(c) = g(c) = 0. The slope of the tangent to the curve at (g(c), f(c)) = (0, 0) is the limit of the ratio f(t)g(t) as t → c.
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 3 candidates examined (receipt 06b9b3d9f102). - 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).
Sign in to tag this passage
-
Theorem · supporting · Geometric interpretation: parametric curve and velocity vector
✕Not formalized
The tangent to the curve at the point (g(t), f(t)) is the velocity vector (g′(t), f′(t)) with slope f′(t)g′(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 3 queries and 3 candidates examined (receipt d80554a91716). - 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).
Sign in to tag this passage
-
Theorem · main statement · Geometric interpretation: parametric curve and velocity vector
◔Partial
Partial: Mathlib states a special case (proved).
L'Hôpital's rule then states that the slope of the curve at the origin ( t = c) is the limit of the tangent slope at points approaching the origin, provided that this is defined.
Show in article · Read it in context on Wikipedia ↗
deriv.lhopital_zero_nhdsNE special case
theorem deriv.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 421–427
Why a special case: The declaration adds the requirement that the derivative of the first coordinate not vanish near the parameter value, a restriction the article elsewhere shows cannot be dropped, so it covers those of the article's curves that meet 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, 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
510eba1d8ec1 · pair key c6c4926e3ec8.
HasDerivAt.lhopital_zero_nhdsNE special case
theorem HasDerivAt.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f f' g g' : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, HasDerivAt f (f' x) x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, HasDerivAt g (g' x) x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, g' x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ f' x / g' x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 287–294
Why a special case: This phrasing names the derivative functions explicitly, matching the article's notation for the velocity coordinates, and likewise restricts to curves whose denominator derivative is nonzero near the parameter 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 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
e3848557d173 · pair key 42d98cba11f7.
Sign in to tag this passage
-
Theorem · main statement · Proof of L'Hôpital's rule › Special case
✓Formalized
Formalized: Mathlib states a more general result (proved).
Suppose that f and g are continuously differentiable at a real number c, that f(c) = g(c) = 0, and that g′(c) ≠ 0. Then limx → c f(x)g(x) = limx → c f(x) − 0g(x) − 0 = limx → c f(x) − f(c)g(x) − g(c)=limx → c (f(x) − f(c)x − c)(g(x) − g(c)x − c) = limx → c(f(x) − f(c)x − c)limx → c(g(x) − g(c)x − c) = f′(c)g′(c) = limx → c f′(x)g′(x).
Show in article · Read it in context on Wikipedia ↗
deriv.lhopital_zero_nhdsNE more general
theorem deriv.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 421–427
Why more general: Mathlib requires differentiability on a punctured neighbourhood with the denominator derivative nonzero there, all of which the passage's hypotheses at the point already deliver.
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
6cc377271af3 · pair key 7862c2f24788.
HasDerivAt.lhopital_zero_nhdsNE more general
theorem HasDerivAt.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f f' g g' : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, HasDerivAt f (f' x) x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, HasDerivAt g (g' x) x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, g' x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ f' x / g' x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 287–294
Why more general: This phrasing takes the derivative functions as explicit data, matching how the article writes the derivatives, and asks only for conditions on a punctured neighbourhood of the point.
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
485b0ddc0f59 · pair key 9764672f54d8.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
Let f and g be functions satisfying the assumptions in § General form. Let I be the open interval in the hypothesis with endpoint c. Considering that g′(x) ≠ 0 on this interval and g is continuous, I can be chosen smaller so that g is nonzero on I.
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 1a0c234fce05). - 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).
Related, but states something else
ContinuousAt.ne_iff_eventually_ne related
theorem ContinuousAt.ne_iff_eventually_ne {X : Type*} {Y : Type*} [TopologicalSpace X] [TopologicalSpace Y] [T2Space Y] {x : X} {f g : X → Y} : ContinuousAt f x → ContinuousAt g x → (f x ≠ g x ↔ ∀ᶠ (x : X) in 𝓝 x, f x ≠ g x)
Mathlib.Topology.Separation.Hausdorff · lines 646–662
How it differs: The usual tool for keeping a continuous function away from zero near a point, but it starts from a nonzero value at that point.
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
0c0c61856dd7 · pair key ff8d69649590.
Sign in to tag this passage
-
Definition · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
For each x in the interval, define m(x) = inf f′(t)g′(t) and M(x) = sup f′(t)g′(t) as t ranges over all values between x and c. (The symbols inf and sup denote the infimum and supremum.)
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 fbfdfc606e10). - 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).
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✓Formalized
Formalized: Mathlib states a more general result (proved).
From the differentiability of f and g on I, Cauchy's mean value theorem ensures that for any two distinct points x and y in I there exists a ξ between x and y such that f(x) − f(y)g(x) − g(y) = f′(ξ)g′(ξ).
Show in article · Read it in context on Wikipedia ↗
exists_ratio_deriv_eq_ratio_slope more general
theorem exists_ratio_deriv_eq_ratio_slope (f : ℝ → ℝ) {a b : ℝ} : a < b → ContinuousOn f (Set.Icc a b) → DifferentiableOn ℝ f (Set.Ioo a b) → ∀ (g : ℝ → ℝ), ContinuousOn g (Set.Icc a b) → DifferentiableOn ℝ g (Set.Ioo a b) → ∃ c ∈ Set.Ioo a b, (g b - g a) * deriv f c = (f b - f a) * deriv g c
Mathlib.Analysis.Calculus.Deriv.MeanValue · lines 134–139
Why more general: Mathlib multiplies the identity out, writing the product of one difference with the other derivative on each side, where the article divides; on the article's objects both denominators are nonzero and the two forms 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, 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
74a595400da3 · pair key 997acc6d6cb7.
exists_ratio_hasDerivAt_eq_ratio_slope more general
theorem exists_ratio_hasDerivAt_eq_ratio_slope (f f' : ℝ → ℝ) {a b : ℝ} : a < b → ContinuousOn f (Set.Icc a b) → (∀ x ∈ Set.Ioo a b, HasDerivAt f (f' x) x) → ∀ (g g' : ℝ → ℝ), ContinuousOn g (Set.Icc a b) → (∀ x ∈ Set.Ioo a b, HasDerivAt g (g' x) x) → ∃ c ∈ Set.Ioo a b, (g b - g a) * f' c = (f b - f a) * g' c
Mathlib.Analysis.Calculus.Deriv.MeanValue · lines 85–95
Why more general: The same theorem carrying the derivatives as given functions, and writing the identity as a pair of products instead of a quotient; on the article's objects the denominators are nonzero and the two readings 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 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, 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
dde5d15c905c · pair key 738bff7dea84.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
Consequently, m(x) ≤ f(x) − f(y)g(x) − g(y) ≤ M(x) for all choices of distinct x and y in the interval.
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 48dfafd10798). - 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).
Related, but states something else
exists_ratio_deriv_eq_ratio_slope related
theorem exists_ratio_deriv_eq_ratio_slope (f : ℝ → ℝ) {a b : ℝ} : a < b → ContinuousOn f (Set.Icc a b) → DifferentiableOn ℝ f (Set.Ioo a b) → ∀ (g : ℝ → ℝ), ContinuousOn g (Set.Icc a b) → DifferentiableOn ℝ g (Set.Ioo a b) → ∃ c ∈ Set.Ioo a b, (g b - g a) * deriv f c = (f b - f a) * deriv g c
Mathlib.Analysis.Calculus.Deriv.MeanValue · lines 134–139
How it differs: The theorem the article invokes just before this inequality, which supplies the interior point but not the comparison with the two bounding 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
614a020a3189 · pair key e659bf62067e.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
◔Partial
Partial: Mathlib states a special case (proved).
The value g(x) − g(y) is always nonzero for distinct x and y in the interval, for if it was not, the mean value theorem would imply the existence of a p between x and y such that g′(p) = 0.
Show in article · Read it in context on Wikipedia ↗
strictMonoOn_of_deriv_pos special case
theorem strictMonoOn_of_deriv_pos {D : Set ℝ} : Convex ℝ D → ∀ {f : ℝ → ℝ}, ContinuousOn f D → (∀ x ∈ interior D, 0 < deriv f x) → StrictMonoOn f D
Mathlib.Analysis.Calculus.Deriv.MeanValue · lines 377–383
Why a special case: Lean states it on any convex subset of the line and concludes strict monotonicity, from which distinct points give distinct values.
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
154150fad5a0 · pair key 7b4fc6ebb39c.
strictAntiOn_of_deriv_neg special case
theorem strictAntiOn_of_deriv_neg {D : Set ℝ} : Convex ℝ D → ∀ {f : ℝ → ℝ}, ContinuousOn f D → (∀ x ∈ interior D, deriv f x < 0) → StrictAntiOn f D
Mathlib.Analysis.Calculus.Deriv.MeanValue · lines 445–451
Why a special case: This is the mirror statement, concluding strict antitonicity on a convex subset of the line when the derivative keeps the opposite sign.
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
765c05c80e85 · pair key 026af6e2bca6.
Related, but states something else
exists_deriv_eq_zero related
theorem exists_deriv_eq_zero {f : ℝ → ℝ} {a b : ℝ} : a < b → ContinuousOn f (Set.Icc a b) → f a = f b → ∃ c ∈ Set.Ioo a b, deriv f c = 0
Mathlib.Analysis.Calculus.LocalExtr.Rolle · lines 61–64
How it differs: The article names the mean value theorem here; this is the form that returns the interior zero of the derivative from two equal values, which is the step it uses.
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, 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
e0d5c943bad5 · pair key 5c41b6d59fe6.
exists_hasDerivAt_eq_zero related
theorem exists_hasDerivAt_eq_zero {f f' : ℝ → ℝ} {a b : ℝ} : a < b → ContinuousOn f (Set.Icc a b) → f a = f b → (∀ x ∈ Set.Ioo a b, HasDerivAt f (f' x) x) → ∃ c ∈ Set.Ioo a b, f' c = 0
Mathlib.Analysis.Calculus.LocalExtr.Rolle · lines 54–57
How it differs: The same theorem with the derivative passed in as a function rather than written with the derivative operator.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 4 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
085ba3ec2466 · pair key f2fd07745f6f.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
The definition of m(x) and M(x) will result in an extended real number, and so it is possible for them to take on the values ±∞.
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 112f302265da). - 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).
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
The definition of m(x) and M(x) will result in an extended real number, and so it is possible for them to take on the values ±∞
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 5b6f53fbbaee). - 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).
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
For any x in the interval I, and point y between x and c, m(x) ≤ f(x) − f(y)g(x) − g(y) = f(x)g(x) − f(y)g(x)1 − g(y)g(x) ≤ M(x) and therefore as y approaches c, f(y)g(x) and g(y)g(x) become zero, and so
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 0d486aef26db). - 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).
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✓Formalized
Formalized: Mathlib states a more general result (proved).
and therefore as y approaches c, f(y)g(x) and g(y)g(x) become zero, and so
Show in article · Read it in context on Wikipedia ↗
Filter.Tendsto.div_const more general
theorem Filter.Tendsto.div_const {α : Type*} {G₀ : Type*} [DivInvMonoid G₀] [TopologicalSpace G₀] [SeparatelyContinuousMul G₀] {f : α → G₀} {l : Filter α} {x : G₀} : Filter.Tendsto f l (𝓝 x) → ∀ (y : G₀), Filter.Tendsto (fun a ↦ f a / y) l (𝓝 (x / y))
Mathlib.Topology.Algebra.GroupWithZero · lines 53–55
Why more general: Mathlib states it for any divisor in a topological division monoid, so the fixed real g(x) and the real-valued f and g of the article are one instance of it, and no nonvanishing assumption on the divisor is needed.
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
5ea453d991a8 · pair key 8e2eb3068314.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
and therefore as y approaches c, f(y)g(x) and g(y)g(x) become zero, and so
m(x) ≤ f(x)g(x) ≤ M(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 1d2929bf2c80). - 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).
Sign in to tag this passage
-
Definition · supporting · Proof of L'Hôpital's rule › General proof
✓Formalized
Formalized: Mathlib states a more general result (a definition).
For every x in the interval I, define Sx = {y ∣ y is between x and c}.
Show in article · Read it in context on Wikipedia ↗
Set.uIoo more general
def Set.uIoo {α : Type*} [LinearOrder α] : α → α → Set α
Mathlib.Order.Interval.Set.UnorderedInterval · line 323
Why more general: Mathlib builds it in any linear order as the open interval from the meet to the join of the endpoints, so which of x and c is the smaller does not matter, and an infinite endpoint is read in the extended 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 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
b36e8fa131a0 · pair key 135e00b7f9f2.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
For every point y between x and c, m(x) ≤ f(y) − f(x)g(y) − g(x) = f(y)g(y) − f(x)g(y)1 − g(x)g(y) ≤ M(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 10ec947e43d4). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
exists_ratio_hasDerivAt_eq_ratio_slope related
theorem exists_ratio_hasDerivAt_eq_ratio_slope (f f' : ℝ → ℝ) {a b : ℝ} : a < b → ContinuousOn f (Set.Icc a b) → (∀ x ∈ Set.Ioo a b, HasDerivAt f (f' x) x) → ∀ (g g' : ℝ → ℝ), ContinuousOn g (Set.Icc a b) → (∀ x ∈ Set.Ioo a b, HasDerivAt g (g' x) x) → ∃ c ∈ Set.Ioo a b, (g b - g a) * f' c = (f b - f a) * g' c
Mathlib.Analysis.Calculus.Deriv.MeanValue · lines 85–95
How it differs: This is the Cauchy mean value theorem the article invokes before this step; it produces one intermediate point whose derivative ratio matches the increment ratio, and the bracketing by the infimum and the supremum needs the definitions of m and M on top of 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. - 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
750a2e1876c9 · pair key 9ce8d6b69168.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
◔Partial
Partial: Mathlib states a special case (proved).
As y approaches c, both f(x)g(y) and g(x)g(y) become zero, and therefore
Show in article · Read it in context on Wikipedia ↗
Filter.Tendsto.const_div_atTop special case
theorem Filter.Tendsto.const_div_atTop {𝕜 : Type*} {α : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [TopologicalSpace 𝕜] [OrderTopology 𝕜] {l : Filter α} {g : α → 𝕜} : Filter.Tendsto g l Filter.atTop → ∀ (r : 𝕜), Filter.Tendsto (fun n ↦ r / g n) l (𝓝 0)
Mathlib.Topology.Algebra.Order.Field · lines 223–225
Why a special case: Mathlib assumes that g itself runs to plus infinity, whereas the article assumes only that its absolute value does, so this is the article's case in which g keeps a positive sign near c.
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
e6cd7204a2b0 · pair key 470361eea180.
Related, but states something else
Filter.tendsto_inv₀_cobounded related
theorem Filter.tendsto_inv₀_cobounded {α : Type*} [NormedDivisionRing α] : Filter.Tendsto Inv.inv (Bornology.cobounded α) (𝓝 0)
Mathlib.Analysis.Normed.Field.Lemmas · lines 91–92
How it differs: It states that inverting along the cobounded filter tends to zero; reaching the passage's quotients still needs multiplication by the fixed constants and the rewriting of division as multiplication by an inverse.
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
4f6b63fba273 · pair key 3ed9a31f18ae.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
◔Partial
Partial: Mathlib states part of this (proved).
As y approaches c, both f(x)g(y) and g(x)g(y) become zero, and therefore
m(x) ≤ liminfy ∈ Sx f(y)g(y) ≤ limsupy ∈ Sx f(y)g(y) ≤ M(x).
Show in article · Read it in context on Wikipedia ↗
Filter.liminf_le_limsup states part
theorem Filter.liminf_le_limsup {α : Type*} {β : Type*} [ConditionallyCompleteLattice α] {f : Filter β} [f.NeBot] {u : β → α} : autoParam (Filter.IsBoundedUnder (fun x1 x2 ↦ x1 ≤ x2) f u) Filter.liminf_le_limsup._auto_1 → autoParam (Filter.IsBoundedUnder (fun x1 x2 ↦ x1 ≥ x2) f u) Filter.liminf_le_limsup._auto_3 → Filter.liminf u f ≤ Filter.limsup u f
Mathlib.Order.LiminfLimsup · lines 154–158
Why only part: It carries nothing about the outer bounds m(x) and M(x) of the chain, which no declaration of the universe states.
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
726e72c0edbc · pair key 0c7c5f616607.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
It is also the case that limx → c m(x) = limx → c M(x) = limx → c f′(x)g′(x) = L.
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 cce1a60a3664). - 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).
Related, but states something else
Filter.Tendsto.liminf_eq related
theorem Filter.Tendsto.liminf_eq {α : Type*} {β : Type*} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] {f : Filter β} {u : β → α} {a : α} [f.NeBot] : Filter.Tendsto u f (𝓝 a) → Filter.liminf u f = a
Mathlib.Topology.Order.LiminfLimsup · lines 195–197
How it differs: It turns the assumed limit of the derivative ratio into a lower limit; the article's claim is about the two functions m and M built as an infimum and a supremum over the points between x and c, which it never mentions.
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
550186325058 · pair key 2577010d5c18.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
and
limx → c(liminfy ∈ Sx f(y)g(y)) = liminfx → c f(x)g(x) and limx → c(limsupy ∈ Sx f(y)g(y)) = limsupx → c f(x)g(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 528cabb97e38). - 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).
Related, but states something else
Filter.liminf_eq_iSup_iInf related
theorem Filter.liminf_eq_iSup_iInf {α : Type*} {β : Type*} [CompleteLattice α] {f : Filter β} {u : β → α} : Filter.liminf u f = ⨆ s ∈ f, ⨅ a ∈ s, u a
Mathlib.Order.LiminfLimsup · line 302
How it differs: It writes a lower limit as the supremum over the filter's sets of the infima on those sets; the article instead takes the limit, as x runs to c, of the lower limits over the sets S_x, which is a different assertion.
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
2963c3479d9b · pair key 4087d5e3da99.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
limx → c(liminfy ∈ Sx f(y)g(y)) = liminfx → c f(x)g(x) and limx → c(limsupy ∈ Sx f(y)g(y)) = limsupx → c f(x)g(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 4 queries and 3 candidates examined (receipt 4df03b32c046). - 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).
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
◔Partial
Partial: Mathlib states a special case (proved).
In case 1, the squeeze theorem establishes that limx → c f(x)g(x) exists and is equal to L.
Show in article · Read it in context on Wikipedia ↗
deriv.lhopital_zero_nhdsGT special case
theorem deriv.lhopital_zero_nhdsGT {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[>] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[>] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[>] a) (𝓝 0) → Filter.Tendsto g (𝓝[>] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[>] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[>] a) l
Mathlib.Analysis.Calculus.LHopital · lines 402–408
Why a special case: The passage lets the point c be finite or infinite and the limit one- or two-sided; this declaration fixes a finite point approached from the right.
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
0409e96e42ff · pair key 63a907d312fc.
deriv.lhopital_zero_nhdsLT special case
theorem deriv.lhopital_zero_nhdsLT {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[<] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[<] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[<] a) (𝓝 0) → Filter.Tendsto g (𝓝[<] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[<] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[<] a) l
Mathlib.Analysis.Calculus.LHopital · lines 411–417
Why a special case: Same restriction as the previous card, with the point approached from the left instead.
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. - 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
8a8ad6c7ce12 · pair key 8e143d8d1300.
deriv.lhopital_zero_atTop special case
theorem deriv.lhopital_zero_atTop {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in Filter.atTop, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in Filter.atTop, deriv g x ≠ 0) → Filter.Tendsto f Filter.atTop (𝓝 0) → Filter.Tendsto g Filter.atTop (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) Filter.atTop l → Filter.Tendsto (fun x ↦ f x / g x) Filter.atTop l
Mathlib.Analysis.Calculus.LHopital · lines 439–450
Why a special case: This is the article's case in which the point of approach is positive infinity.
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. - 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
5ee5ddcb1549 · pair key 3e0b4eb205a0.
deriv.lhopital_zero_atBot special case
theorem deriv.lhopital_zero_atBot {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in Filter.atBot, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in Filter.atBot, deriv g x ≠ 0) → Filter.Tendsto f Filter.atBot (𝓝 0) → Filter.Tendsto g Filter.atBot (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) Filter.atBot l → Filter.Tendsto (fun x ↦ f x / g x) Filter.atBot l
Mathlib.Analysis.Calculus.LHopital · lines 453–463
Why a special case: This is the article's case in which the point of approach is negative infinity.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 4 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
18437fd25fc1 · pair key f0c063e78aeb.
deriv.lhopital_zero_nhdsNE special case
theorem deriv.lhopital_zero_nhdsNE {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝[≠] a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝[≠] a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝[≠] a) (𝓝 0) → Filter.Tendsto g (𝓝[≠] a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝[≠] a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 421–427
Why a special case: The article also allows an infinite point of approach, which this two-sided version does not reach.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 5 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
13ff1965a203 · pair key f9db156a9a1c.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
In the case 2, and the squeeze theorem again asserts that liminfx → c f(x)g(x) = limsupx → c f(x)g(x) = L , and so the limit limx → c f(x)g(x) exists and is equal to L.
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 26606ecbda49). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
In the case 2, and the squeeze theorem again asserts that liminfx → c f(x)g(x) = limsupx → c f(x)g(x) = L, and so the limit limx → c f(x)g(x) exists and is equal to L.
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 061e809e26c7). - 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).
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
✕Not formalized
This means that if |g(x)| diverges to infinity as x approaches c and both f and g satisfy the hypotheses of L'Hôpital's rule, then no additional assumption is needed about the limit of f(x): It could even be the case that the limit of f(x) does not exist.
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 076082ff7e90). - 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).
Sign in to tag this passage
-
Theorem · supporting · Proof of L'Hôpital's rule › General proof
◔Partial
Partial: Mathlib states a special case (proved).
In the case when |g(x)| diverges to infinity as x approaches c and f(x) converges to a finite limit at c, then L'Hôpital's rule would be applicable, but not absolutely necessary, since basic limit calculus will show that the limit of f(x)g(x) as x approaches c must be zero.
Show in article · Read it in context on Wikipedia ↗
tendsto_bdd_div_atTop_nhds_zero special case
theorem tendsto_bdd_div_atTop_nhds_zero {𝕜 : Type*} {α : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [TopologicalSpace 𝕜] [OrderTopology 𝕜] {l : Filter α} {f g : α → 𝕜} {b B : 𝕜} : (∀ᶠ (x : α) in l, b ≤ f x) → (∀ᶠ (x : α) in l, f x ≤ B) → Filter.Tendsto g l Filter.atTop → Filter.Tendsto (fun x ↦ f x / g x) l (𝓝 0)
Mathlib.Topology.Algebra.Order.Field · lines 265–269
Why a special case: It assumes the denominator itself grows to positive infinity, one of the situations allowed by the passage's condition on the modulus of g, and it asks only that the numerator be bounded above and below near c, which a convergent f is.
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
f0b69ac4f70d · pair key 232b1bb02c9c.
Sign in to tag this passage
-
Theorem · main statement · Corollary
◔Partial
Partial: Mathlib states a special case (proved).
A simple but very useful consequence of L'Hopital's rule is that the derivative of a function cannot have a removable discontinuity.
Show in article · Read it in context on Wikipedia ↗
hasDerivWithinAt_Ici_of_tendsto_deriv special case
theorem hasDerivWithinAt_Ici_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {s : Set ℝ} {e : E} {a : ℝ} {f : ℝ → E} : DifferentiableOn ℝ f s → ContinuousWithinAt f s a → s ∈ 𝓝[>] a → Filter.Tendsto (fun x ↦ deriv f x) (𝓝[>] a) (𝓝 e) → HasDerivWithinAt f e (Set.Ici a) a
Mathlib.Analysis.Calculus.FDeriv.Extend · lines 107–137
Why a special case: It is read on one side of the point only, so the two-sided conclusion of the passage needs the companion left-hand version as well.
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
1e05b3d9ec62 · pair key e9042dc07e50.
hasDerivWithinAt_Iic_of_tendsto_deriv special case
theorem hasDerivWithinAt_Iic_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {s : Set ℝ} {e : E} {a : ℝ} {f : ℝ → E} : DifferentiableOn ℝ f s → ContinuousWithinAt f s a → s ∈ 𝓝[<] a → Filter.Tendsto (fun x ↦ deriv f x) (𝓝[<] a) (𝓝 e) → HasDerivWithinAt f e (Set.Iic a) a
Mathlib.Analysis.Calculus.FDeriv.Extend · lines 141–172
Why a special case: The mirror image of the previous card, covering the approach from below only.
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
37345f483d67 · pair key 0e11174b92f4.
TauCeti.hasDerivWithinAt_Ioi_of_tendsto_deriv special case
theorem TauCeti.hasDerivWithinAt_Ioi_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {γ : ℝ → E} {t₀ : ℝ} {L : E} : ContinuousAt γ t₀ → (∀ᶠ (t : ℝ) in 𝓝[>] t₀, DifferentiableAt ℝ γ t) → Filter.Tendsto (deriv γ) (𝓝[>] t₀) (𝓝 L) → HasDerivWithinAt γ L (Set.Ioi t₀) t₀
TauCeti.Analysis.Calculus.OneSidedDerivLimit · lines 44–52
Why a special case: Its continuity hypothesis is stated at the point itself, as the passage does, but its conclusion is again only on one side.
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, 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
24a49d1cbf45 · pair key 7356c49f1e37.
TauCeti.hasDerivWithinAt_Iio_of_tendsto_deriv special case
theorem TauCeti.hasDerivWithinAt_Iio_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {γ : ℝ → E} {t₀ : ℝ} {L : E} : ContinuousAt γ t₀ → (∀ᶠ (t : ℝ) in 𝓝[<] t₀, DifferentiableAt ℝ γ t) → Filter.Tendsto (deriv γ) (𝓝[<] t₀) (𝓝 L) → HasDerivWithinAt γ L (Set.Iio t₀) t₀
TauCeti.Analysis.Calculus.OneSidedDerivLimit · lines 56–64
Why a special case: The left-sided companion of the previous card, with continuity assumed at the point itself.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 4 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
948235e2377f · pair key eacba6605a53.
Sign in to tag this passage
-
Theorem · main statement · Corollary
◔Partial
Partial: TauCeti states part of this (proved).
That is, suppose that f is continuous at a, and that f′(x) exists for all x in some open interval containing a, except perhaps for x = a. Suppose, moreover, that limx → a f′(x) exists. Then f′(a) also exists and f′(a) = limx → a f′(x). In particular, f′ is also continuous at a.
Show in article · Read it in context on Wikipedia ↗
TauCeti.hasDerivWithinAt_Ioi_of_tendsto_deriv states part
theorem TauCeti.hasDerivWithinAt_Ioi_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {γ : ℝ → E} {t₀ : ℝ} {L : E} : ContinuousAt γ t₀ → (∀ᶠ (t : ℝ) in 𝓝[>] t₀, DifferentiableAt ℝ γ t) → Filter.Tendsto (deriv γ) (𝓝[>] t₀) (𝓝 L) → HasDerivWithinAt γ L (Set.Ioi t₀) t₀
TauCeti.Analysis.Calculus.OneSidedDerivLimit · lines 44–52
Why only part: Its conclusion is the derivative within the open right half-line, so it reaches the point a from above alone.
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
83245ab. - Location key
9b73c93ab12e · pair key ffb04beb5acb.
TauCeti.hasDerivWithinAt_Iio_of_tendsto_deriv states part
theorem TauCeti.hasDerivWithinAt_Iio_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {γ : ℝ → E} {t₀ : ℝ} {L : E} : ContinuousAt γ t₀ → (∀ᶠ (t : ℝ) in 𝓝[<] t₀, DifferentiableAt ℝ γ t) → Filter.Tendsto (deriv γ) (𝓝[<] t₀) (𝓝 L) → HasDerivWithinAt γ L (Set.Iio t₀) t₀
TauCeti.Analysis.Calculus.OneSidedDerivLimit · lines 56–64
Why only part: Its conclusion is the derivative within the open left half-line, so it reaches the point a from below alone.
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
83245ab. - Location key
a79d4e87abaf · pair key 300ca55a12a7.
hasDerivWithinAt_Ici_of_tendsto_deriv states part
theorem hasDerivWithinAt_Ici_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {s : Set ℝ} {e : E} {a : ℝ} {f : ℝ → E} : DifferentiableOn ℝ f s → ContinuousWithinAt f s a → s ∈ 𝓝[>] a → Filter.Tendsto (fun x ↦ deriv f x) (𝓝[>] a) (𝓝 e) → HasDerivWithinAt f e (Set.Ici a) a
Mathlib.Analysis.Calculus.FDeriv.Extend · lines 107–137
Why only part: It is phrased with an auxiliary set s that must be a neighbourhood of a from the right, and it reaches a from above.
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, 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
aafd4267d432 · pair key 9026fea1574a.
hasDerivWithinAt_Iic_of_tendsto_deriv states part
theorem hasDerivWithinAt_Iic_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {s : Set ℝ} {e : E} {a : ℝ} {f : ℝ → E} : DifferentiableOn ℝ f s → ContinuousWithinAt f s a → s ∈ 𝓝[<] a → Filter.Tendsto (fun x ↦ deriv f x) (𝓝[<] a) (𝓝 e) → HasDerivWithinAt f e (Set.Iic a) a
Mathlib.Analysis.Calculus.FDeriv.Extend · lines 141–172
Why only part: It is phrased with an auxiliary set s that must be a neighbourhood of a from the left, and it reaches a from below.
Details
- Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run
loc-tierA-b1b by jack: candidate 4 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
76f0d398d9b4 · pair key 42c5e2487115.
Sign in to tag this passage
-
Theorem · supporting · Corollary
✕Not formalized
With community edits: Not formalized. As published it is Partial.
Then f′(a) also exists and f′(a) = limx → a f′(x). In particular, f′ is also continuous at a.
Show in article · Read it in context on Wikipedia ↗
Related, but states something else
ContDiffOn.continuousOn_deriv_of_isOpen related
theorem ContDiffOn.continuousOn_deriv_of_isOpen {𝕜 : Type*} {F : Type*} [NontriviallyNormedField 𝕜] [NormedAddCommGroup F] [NormedSpace 𝕜 F] {n : WithTop ℕ∞} {f : 𝕜 → F} {s : Set 𝕜} : ContDiffOn 𝕜 n f s → IsOpen s → 1 ≤ n → ContinuousOn (deriv f) s
Mathlib.Analysis.Calculus.ContDiff.Deriv · lines 77–80
Community Agent The pipeline said special case; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: The corollary gets continuity of f' at a from three things: f is continuous at a, f is differentiable near a (except perhaps at a), and f' has a limit at a. This declaration instead assumes f is continuously differentiable on an open set, which already includes continuity of the derivative. It only turns that into a statement about deriv, so it does not formalize the corollary.
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
8147ea555f1b · pair key 64f977a03726.
ContDiff.continuous_deriv_one related
theorem ContDiff.continuous_deriv_one {𝕜 : Type*} {F : Type*} [NontriviallyNormedField 𝕜] [NormedAddCommGroup F] [NormedSpace 𝕜 F] {f : 𝕜 → F} : ContDiff 𝕜 1 f → Continuous (deriv f)
Mathlib.Analysis.Calculus.ContDiff.Deriv · lines 113–114
Community Agent The pipeline said special case; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
How it differs: The corollary gets continuity of f' at a from three things: f is continuous at a, f is differentiable near a (except perhaps at a), and f' has a limit at a. This declaration assumes f is C^1 everywhere, which already means the derivative is continuous. It only turns that into continuity of deriv, so it does not formalize the corollary.
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
20a91e4a5cfc · pair key c91db5675150.
Sign in to tag this passage
-
Theorem · supporting · Corollary
✕Not formalized
Thus, if a function is not continuously differentiable near a point, the derivative must have an essential discontinuity at that point.
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 8f8ba20ad092). - 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).
Sign in to tag this passage
-
Definition · supporting · Corollary › Proof
✕Not formalized
Consider the functions h(x) = f(x) − f(a) and g(x) = x − a.
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 f1fc53e37a42). - Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run
chal-tierA-b1 by jack: upheld.
Related, but states something else
Homeomorph.subRight related
def Homeomorph.subRight {G : Type*} [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] : G → G ≃ₜ G
Mathlib.Topology.Algebra.Group.ContinuousDiv · line 88
How it differs: It is the translation x ↦ x − a packaged as a self-homeomorphism of the group; the passage introduces two proof abbreviations at once, and the function built from f is nowhere in the index.
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
6f98d7061e02 · pair key 4dca721c404e.
Sign in to tag this passage
-
Theorem · supporting · Corollary › Proof
✓Formalized
Formalized: Mathlib states a more general result (proved).
The continuity of f at a tells us that limx → a h(x) = 0.
Show in article · Read it in context on Wikipedia ↗
tendsto_sub_nhds_zero_iff more general
theorem tendsto_sub_nhds_zero_iff {G : Type*} [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] {α : Type*} {l : Filter α} {x : G} {u : α → G} : Filter.Tendsto (fun x_1 ↦ u x_1 - x) l (𝓝 0) ↔ Filter.Tendsto u l (𝓝 x)
Mathlib.Topology.Algebra.Group.ContinuousDiv · line 103
Why more general: Mathlib states it as an equivalence along an arbitrary filter in any topological additive group, and the passage reads one direction of it on the 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
387051fd3579 · pair key 29c4a43a91b1.
Filter.Tendsto.sub_const more general
theorem Filter.Tendsto.sub_const {G : Type*} {α : Type*} [TopologicalSpace G] [Sub G] [ContinuousSub G] {c : G} {f : α → G} {l : Filter α} : Filter.Tendsto f l (𝓝 c) → ∀ (b : G), Filter.Tendsto (fun x ↦ f x - b) l (𝓝 (c - b))
Mathlib.Topology.Algebra.Group.ContinuousDiv · line 26
Why more general: It is stated for any filter and any space with continuous subtraction, and it leaves the limit written as f(a) − f(a).
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
30091193526d · pair key 984aeb140a13.
Sign in to tag this passage
-
Theorem · supporting · Corollary › Proof
✓Formalized
Formalized: Mathlib states a more general result (proved).
Moreover, limx → a g(x) = 0 since a polynomial function is always continuous everywhere.
Show in article · Read it in context on Wikipedia ↗
tendsto_sub_nhds_zero_iff more general
theorem tendsto_sub_nhds_zero_iff {G : Type*} [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] {α : Type*} {l : Filter α} {x : G} {u : α → G} : Filter.Tendsto (fun x_1 ↦ u x_1 - x) l (𝓝 0) ↔ Filter.Tendsto u l (𝓝 x)
Mathlib.Topology.Algebra.Group.ContinuousDiv · line 103
Why more general: Mathlib states it as an equivalence along an arbitrary filter in any topological additive group, and the passage's g is the instance where the function is the identity.
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
48d4ff66671d · pair key 29e36146a85c.
Filter.Tendsto.sub_const more general
theorem Filter.Tendsto.sub_const {G : Type*} {α : Type*} [TopologicalSpace G] [Sub G] [ContinuousSub G] {c : G} {f : α → G} {l : Filter α} : Filter.Tendsto f l (𝓝 c) → ∀ (b : G), Filter.Tendsto (fun x ↦ f x - b) l (𝓝 (c - b))
Mathlib.Topology.Algebra.Group.ContinuousDiv · line 26
Why more general: It is stated for any filter and any space with continuous subtraction, and it leaves the limit written as a − a.
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
881219a33516 · pair key ac915f5f00bb.
Sign in to tag this passage
-
Theorem · supporting · Corollary › Proof
✓Formalized
Formalized: Mathlib states a more general result (proved).
Moreover, limx → a g(x) = 0 since a polynomial function is always continuous everywhere.
Show in article · Read it in context on Wikipedia ↗
Polynomial.continuous more general
theorem Polynomial.continuous {R : Type*} [Semiring R] [TopologicalSpace R] [IsTopologicalSemiring R] (p : R[X]) : Continuous fun x ↦ Polynomial.eval x p
Mathlib.Topology.Algebra.Polynomial · lines 54–55
Why more general: Mathlib proves it for polynomial evaluation over any topological semiring, and the passage reads it on 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 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
7de30085871d · pair key 48ceec2f71c3.
Polynomial.continuousAt more general
theorem Polynomial.continuousAt {R : Type*} [Semiring R] [TopologicalSpace R] [IsTopologicalSemiring R] (p : R[X]) {a : R} : ContinuousAt (fun x ↦ Polynomial.eval x p) a
Mathlib.Topology.Algebra.Polynomial · lines 58–59
Why more general: It is the pointwise form of the same fact over any topological semiring.
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
3d61bd341659 · pair key e1a74284f310.
Sign in to tag this passage
-
Theorem · supporting · Corollary › Proof
◔Partial
Partial: TauCeti states part of this (proved).
Applying L'Hopital's rule shows that f′(a) := limx → a f(x) − f(a)x − a = limx → a h′(x)g′(x) = limx → a f′(x).
Show in article · Read it in context on Wikipedia ↗
TauCeti.hasDerivWithinAt_Ioi_of_tendsto_deriv states part
theorem TauCeti.hasDerivWithinAt_Ioi_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {γ : ℝ → E} {t₀ : ℝ} {L : E} : ContinuousAt γ t₀ → (∀ᶠ (t : ℝ) in 𝓝[>] t₀, DifferentiableAt ℝ γ t) → Filter.Tendsto (deriv γ) (𝓝[>] t₀) (𝓝 L) → HasDerivWithinAt γ L (Set.Ioi t₀) t₀
TauCeti.Analysis.Calculus.OneSidedDerivLimit · lines 44–52
Why only part: Its conclusion is the derivative within the open right half-line, so the equation is obtained from above alone.
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
83245ab. - Location key
8a73e0dc6d09 · pair key ce57980869f2.
TauCeti.hasDerivWithinAt_Iio_of_tendsto_deriv states part
theorem TauCeti.hasDerivWithinAt_Iio_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {γ : ℝ → E} {t₀ : ℝ} {L : E} : ContinuousAt γ t₀ → (∀ᶠ (t : ℝ) in 𝓝[<] t₀, DifferentiableAt ℝ γ t) → Filter.Tendsto (deriv γ) (𝓝[<] t₀) (𝓝 L) → HasDerivWithinAt γ L (Set.Iio t₀) t₀
TauCeti.Analysis.Calculus.OneSidedDerivLimit · lines 56–64
Why only part: Its conclusion is the derivative within the open left half-line, so the equation is obtained from below alone.
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. - 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
83245ab. - Location key
29e996c3106e · pair key e7c5143018c0.
Related, but states something else
hasDerivWithinAt_Ici_of_tendsto_deriv related
theorem hasDerivWithinAt_Ici_of_tendsto_deriv {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] {s : Set ℝ} {e : E} {a : ℝ} {f : ℝ → E} : DifferentiableOn ℝ f s → ContinuousWithinAt f s a → s ∈ 𝓝[>] a → Filter.Tendsto (fun x ↦ deriv f x) (𝓝[>] a) (𝓝 e) → HasDerivWithinAt f e (Set.Ici a) a
Mathlib.Analysis.Calculus.FDeriv.Extend · lines 107–137
How it differs: It is phrased with an auxiliary set that must be a neighbourhood of a from the right.
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, 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
2321fef706a1 · pair key 8fc9df409d0e.
deriv.lhopital_zero_nhds related
theorem deriv.lhopital_zero_nhds {a : ℝ} {l : Filter ℝ} {f g : ℝ → ℝ} : (∀ᶠ (x : ℝ) in 𝓝 a, DifferentiableAt ℝ f x) → (∀ᶠ (x : ℝ) in 𝓝 a, deriv g x ≠ 0) → Filter.Tendsto f (𝓝 a) (𝓝 0) → Filter.Tendsto g (𝓝 a) (𝓝 0) → Filter.Tendsto (fun x ↦ deriv f x / deriv g x) (𝓝 a) l → Filter.Tendsto (fun x ↦ f x / g x) (𝓝[≠] a) l
Mathlib.Analysis.Calculus.LHopital · lines 430–436
How it differs: It is the rule invoked in this step: it transfers the limit of the quotient of the derivatives to the limit of the quotient, which is the intermediate equality rather than the equation 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 4 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
349c72cf7ed6 · pair key a241e8eb16b4.
Sign in to tag this passage