op819_sqrt_mul_div_sqrt_add_one_tendsto
The sequence sqrt(R) * (sqrt(R) + 1)⁻¹ converges to 1 as R tends to infinity.
Statement
theorem op819_sqrt_mul_div_sqrt_add_one_tendsto : Filter.Tendsto (fun R : ℕ => Real.sqrt (R : ℝ) * (Real.sqrt (R : ℝ) + 1)⁻¹) Filter.atTop (nhds 1)
- Source
- step towards op819_online_single_high_efx_sharp_sqrt_law
- Verified
- 03 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext
The proof, explained
The proof rewrites $\sqrt{R} \cdot (\sqrt{R} + 1)^{-1}$ algebraically as $1 - (\sqrt{R} + 1)^{-1}$. Since $R \to \infty$, the square root $\sqrt{R}$ tends to $\infty$, so the denominator $\sqrt{R} + 1$ also tends to $\infty$, which implies that its reciprocal $(\sqrt{R} + 1)^{-1}$ converges to 0. Consequently, $1 - (\sqrt{R} + 1)^{-1}$ converges to $1 - 0 = 1$.
The reciprocal sequence $(\sqrt{R} + 1)^{-1}$ converges to 0 as $R \to \infty$.
The cast from $\mathbb{N}$ to $\mathbb{R}$ diverges to infinity by `tendsto_natCast_atTop_atTop`, and the real square root tends to infinity at infinity by `Real.tendsto_sqrt_atTop`, so their composition $\sqrt{R}$ tends to infinity. Adding the constant 1 preserves divergence to infinity (`tendsto_const_nhds`), showing that $\sqrt{R} + 1 \to \infty$. Finally, the reciprocal of a sequence diverging to $+\infty$ converges to 0.
uses
Real.tendsto_sqrt_atTop,tendsto_natCast_atTop_atTop,tendsto_const_nhdshave hsqrt : Filter.Tendsto (fun R : ℕ => Real.sqrt (R : ℝ)) Filter.atTop Filter.atTop := Real.tendsto_sqrt_atTop.comp tendsto_natCast_atTop_atTop have hden : Filter.Tendsto (fun R : ℕ => Real.sqrt (R : ℝ) + 1) Filter.atTop Filter.atTop := hsqrt.atTop_add tendsto_const_nhds have hinv : Filter.Tendsto (fun R : ℕ => (Real.sqrt (R : ℝ) + 1)⁻¹) Filter.atTop (nhds 0) := hden.inv_tendsto_atTop
The sequence $1 - (\sqrt{R} + 1)^{-1}$ converges to $1 - 0$ as $R \to \infty$.
Subtracting the sequence $(\sqrt{R} + 1)^{-1}$, which tends to 0, from the constant sequence 1, which tends to 1 by `tendsto_const_nhds`, converges to $1 - 0$ by the difference rule for limits.
uses
tendsto_const_nhdshave hsub : Filter.Tendsto (fun R : ℕ => (1 : ℝ) - (Real.sqrt (R : ℝ) + 1)⁻¹) Filter.atTop (nhds (1 - 0)) := tendsto_const_nhds.sub hinv
For all $R \in \mathbb{N}$, $\sqrt{R} \cdot (\sqrt{R} + 1)^{-1} = 1 - (\sqrt{R} + 1)^{-1}$.
By function extensionality, it suffices to prove this equality pointwise for any $R$. Rewriting $a = 1 - c$ as $a + c = 1$ via `eq_sub_iff_add_eq` transforms the identity into $\sqrt{R} \cdot (\sqrt{R} + 1)^{-1} + (\sqrt{R} + 1)^{-1} = 1$. Clearing denominators using `field_simp` reduces this to $(\sqrt{R} + 1) / (\sqrt{R} + 1) = 1$, which holds because $\sqrt{R} + 1 \neq 0$.
uses
eq_sub_iff_add_eqhave hEq : (fun R : ℕ => Real.sqrt (R : ℝ) * (Real.sqrt (R : ℝ) + 1)⁻¹) = (fun R : ℕ => (1 : ℝ) - (Real.sqrt (R : ℝ) + 1)⁻¹) := by funext R rw [eq_sub_iff_add_eq] field_simp
The sequence $\sqrt{R} \cdot (\sqrt{R} + 1)^{-1}$ converges to 1 as $R \to \infty$.
Rewriting the sequence using the algebraic identity established in the previous step transforms it into $1 - (\sqrt{R} + 1)^{-1}$. Applying the limit established for this expression and simplifying $1 - 0 = 1$ completes the proof.
rw [hEq] simpa using hsub
Real.tendsto_sqrt_atTop- The square root function $\sqrt{x}$ tends to infinity as $x$ tends to infinity along the real numbers.
tendsto_natCast_atTop_atTop- The natural number cast $n \mapsto n$ into an Archimedean ordered semiring tends to infinity as $n \to \infty$.
tendsto_const_nhds- A constant function $x \mapsto c$ tends to $c$ along any filter.
eq_sub_iff_add_eq- In an additive group, $a = b - c$ if and only if $a + c = b$.
- The algebraic simplification in line 17 relies on `field_simp`, which automatically clears denominators and verifies that the denominator $\sqrt{R} + 1$ is nonzero since $\sqrt{R} \ge 0$.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The sequence sqrt(R) * (sqrt(R) + 1)⁻¹ converges to 1 as R tends to infinity. -/theorem op819_sqrt_mul_div_sqrt_add_one_tendsto : Filter.Tendsto (fun R : ℕ => Real.sqrt (R : ℝ) * (Real.sqrt (R : ℝ) + 1)⁻¹) Filter.atTop (nhds 1) := by have hsqrt : Filter.Tendsto (fun R : ℕ => Real.sqrt (R : ℝ)) Filter.atTop Filter.atTop := Real.tendsto_sqrt_atTop.comp tendsto_natCast_atTop_atTop have hden : Filter.Tendsto (fun R : ℕ => Real.sqrt (R : ℝ) + 1) Filter.atTop Filter.atTop := hsqrt.atTop_add tendsto_const_nhds have hinv : Filter.Tendsto (fun R : ℕ => (Real.sqrt (R : ℝ) + 1)⁻¹) Filter.atTop (nhds 0) := hden.inv_tendsto_atTop have hsub : Filter.Tendsto (fun R : ℕ => (1 : ℝ) - (Real.sqrt (R : ℝ) + 1)⁻¹) Filter.atTop (nhds (1 - 0)) := tendsto_const_nhds.sub hinv have hEq : (fun R : ℕ => Real.sqrt (R : ℝ) * (Real.sqrt (R : ℝ) + 1)⁻¹) = (fun R : ℕ => (1 : ℝ) - (Real.sqrt (R : ℝ) + 1)⁻¹) := by funext R rw [eq_sub_iff_add_eq] field_simp rw [hEq] simpa using hsub