<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Real Analysis on Teddy Rook Book</title><link>https://teddyrookbook.com/math/real-analysis/</link><description>Recent content in Real Analysis on Teddy Rook Book</description><image><title>Teddy Rook Book</title><url>https://teddyrookbook.com/img/share.jpg</url><link>https://teddyrookbook.com/img/share.jpg</link></image><generator>Hugo</generator><language>en</language><atom:link href="https://teddyrookbook.com/math/real-analysis/index.xml" rel="self" type="application/rss+xml"/><item><title>Absolute Value and the Triangle Inequality</title><link>https://teddyrookbook.com/math/real-analysis/absolute-value/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/absolute-value/</guid><description>|x − a| &amp;lt; ε means x is within ε of a; |a + b| ≤ |a| + |b| and |a| − |b| ≤ |a − b| turn distances into bounds. Real Analysis · Math Ladder</description></item><item><title>Supremum and Infimum</title><link>https://teddyrookbook.com/math/real-analysis/sup-inf/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/sup-inf/</guid><description>The supremum of a set is its least upper bound and the infimum its greatest lower bound; neither has to belong to the set. Real Analysis · Math Ladder</description></item><item><title>The ε-Test for a Supremum</title><link>https://teddyrookbook.com/math/real-analysis/approximation-property/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/approximation-property/</guid><description>An upper bound s is the supremum exactly when, for every ε &amp;gt; 0, some element of the set is bigger than s − ε. Real Analysis · Math Ladder</description></item><item><title>Completeness and the Archimedean Property</title><link>https://teddyrookbook.com/math/real-analysis/completeness/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/completeness/</guid><description>Every nonempty set of reals that is bounded above has a supremum; from it, for every ε &amp;gt; 0 some whole number n has 1/n &amp;lt; ε. Real Analysis · Math Ladder</description></item><item><title>Density of the Rationals</title><link>https://teddyrookbook.com/math/real-analysis/density/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/density/</guid><description>Between any two real numbers a &amp;lt; b lies a rational: pick n with 1/n &amp;lt; b − a, and some multiple m/n lands strictly between them. Real Analysis · Math Ladder</description></item><item><title>Countable and Uncountable Sets</title><link>https://teddyrookbook.com/math/real-analysis/countable-sets/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/countable-sets/</guid><description>A set is countable when its elements can be listed a₁, a₂, a₃, …; the rationals are countable, but Cantor&amp;#39;s diagonal argument shows the reals are not. Real Analysis · Math Ladder</description></item><item><title>The Definition of a Limit (ε–N)</title><link>https://teddyrookbook.com/math/real-analysis/sequence-limit/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/sequence-limit/</guid><description>aₙ → L when for every ε &amp;gt; 0 there is an N with |aₙ − L| &amp;lt; ε for all n ≥ N; for a given ε you can find such an N and check it. Real Analysis · Math Ladder</description></item><item><title>Writing ε–N Proofs</title><link>https://teddyrookbook.com/math/real-analysis/epsilon-n-proofs/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/epsilon-n-proofs/</guid><description>Work backward on scratch paper to find N in terms of ε; then write the proof forward: let ε &amp;gt; 0, choose N, take n ≥ N and show |aₙ − L| &amp;lt; ε. Real Analysis · Math Ladder</description></item><item><title>Bounded Sequences and Divergence</title><link>https://teddyrookbook.com/math/real-analysis/divergence/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/divergence/</guid><description>Every convergent sequence is bounded; to show aₙ does not converge to L, find one ε &amp;gt; 0 for which no N works. Real Analysis · Math Ladder</description></item><item><title>Proving the Limit Laws</title><link>https://teddyrookbook.com/math/real-analysis/limit-laws/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/limit-laws/</guid><description>If aₙ → a and bₙ → b, then aₙ + bₙ → a + b and aₙbₙ → ab; the proofs split ε between the two pieces and use that convergent sequences are bounded. Real Analysis · Math Ladder</description></item><item><title>Order Limits and the Squeeze Theorem</title><link>https://teddyrookbook.com/math/real-analysis/squeeze-order/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/squeeze-order/</guid><description>Limits keep ≤: if aₙ ≤ bₙ then lim aₙ ≤ lim bₙ; and a sequence trapped between two sequences with the same limit has that limit too. Real Analysis · Math Ladder</description></item><item><title>The Monotone Convergence Theorem</title><link>https://teddyrookbook.com/math/real-analysis/monotone-convergence/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/monotone-convergence/</guid><description>A bounded monotone sequence converges, to the supremum of its terms if it increases; for aₙ₊₁ = g(aₙ), show monotone and bounded, then solve L = g(L). Real Analysis · Math Ladder</description></item><item><title>Subsequences and Subsequential Limits</title><link>https://teddyrookbook.com/math/real-analysis/subsequences/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/subsequences/</guid><description>Every subsequence of a convergent sequence has the same limit, so two subsequences with different limits prove that a sequence diverges. Real Analysis · Math Ladder</description></item><item><title>The Bolzano–Weierstrass Theorem</title><link>https://teddyrookbook.com/math/real-analysis/bolzano-weierstrass/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/bolzano-weierstrass/</guid><description>Every bounded sequence has a convergent subsequence: halve the interval again and again, each time keeping a half that holds infinitely many terms. Real Analysis · Math Ladder</description></item><item><title>Limit Superior and Limit Inferior</title><link>https://teddyrookbook.com/math/real-analysis/limsup-liminf/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/limsup-liminf/</guid><description>lim sup aₙ is the limit of the tail suprema sup{aₖ : k ≥ n}; it is the largest subsequential limit, and aₙ converges exactly when lim sup aₙ = lim inf aₙ. Real Analysis · Math Ladder</description></item><item><title>Cauchy Sequences</title><link>https://teddyrookbook.com/math/real-analysis/cauchy-sequences/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/cauchy-sequences/</guid><description>aₙ is Cauchy when for every ε &amp;gt; 0 some N makes |aₘ − aₙ| &amp;lt; ε for all m, n ≥ N; in ℝ a sequence is Cauchy exactly when it converges. Real Analysis · Math Ladder</description></item><item><title>Series and the Cauchy Criterion</title><link>https://teddyrookbook.com/math/real-analysis/series-cauchy/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/series-cauchy/</guid><description>∑aₖ converges when its partial sums do; by the Cauchy criterion, blocks aₘ₊₁ + ⋯ + aₙ far out must be small, and in particular aₖ → 0. Real Analysis · Math Ladder</description></item><item><title>Comparison and Absolute Convergence</title><link>https://teddyrookbook.com/math/real-analysis/absolute-convergence/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/absolute-convergence/</guid><description>If |aₖ| ≤ bₖ and ∑bₖ converges, the Cauchy criterion makes ∑aₖ converge; in particular, absolute convergence implies convergence. Real Analysis · Math Ladder</description></item><item><title>The Cauchy Condensation Test</title><link>https://teddyrookbook.com/math/real-analysis/condensation/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/condensation/</guid><description>For a decreasing sequence of positive terms, ∑aₙ and ∑2ᵏa₂ₖ converge or diverge together; it settles the p-series and ∑1/(n(ln n)ᵖ). Real Analysis · Math Ladder</description></item><item><title>Root and Ratio Tests with lim sup</title><link>https://teddyrookbook.com/math/real-analysis/root-ratio-limsup/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/root-ratio-limsup/</guid><description>If lim sup |aₖ|^(1/k) &amp;lt; 1 the series converges absolutely, and if it is &amp;gt; 1 the series diverges; the root test works even when the ratios jump around. Real Analysis · Math Ladder</description></item><item><title>Alternating Series and Error Bounds</title><link>https://teddyrookbook.com/math/real-analysis/alternating-series/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/alternating-series/</guid><description>If bₖ decreases to 0, ∑(−1)ᵏ⁺¹bₖ converges, and the error after n terms is less than bₙ₊₁: the partial sums zigzag and trap the sum. Real Analysis · Math Ladder</description></item><item><title>Rearranging Series</title><link>https://teddyrookbook.com/math/real-analysis/rearrangements/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/rearrangements/</guid><description>Rearranging an absolutely convergent series keeps its sum; a conditionally convergent series can be rearranged to add up to any number you like (Riemann). Real Analysis · Math Ladder</description></item><item><title>Limits of Functions (ε–δ)</title><link>https://teddyrookbook.com/math/real-analysis/function-limits/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/function-limits/</guid><description>lim f(x) = L as x → a when for every ε &amp;gt; 0 some δ &amp;gt; 0 gives |f(x) − L| &amp;lt; ε whenever 0 &amp;lt; |x − a| &amp;lt; δ; any smaller positive δ works too. Real Analysis · Math Ladder</description></item><item><title>Continuity with ε and δ</title><link>https://teddyrookbook.com/math/real-analysis/continuity/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/continuity/</guid><description>f is continuous at a when for every ε &amp;gt; 0 some δ &amp;gt; 0 gives |f(x) − f(a)| &amp;lt; ε whenever |x − a| &amp;lt; δ; for x² the classic choice is δ = min(1, ε/(2|a| + 1)). Real Analysis · Math Ladder</description></item><item><title>The Sequential Criterion and Discontinuity</title><link>https://teddyrookbook.com/math/real-analysis/sequential-criterion/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/sequential-criterion/</guid><description>f is continuous at a exactly when f(xₙ) → f(a) for every sequence xₙ → a; two sequences giving different limits prove a discontinuity. Real Analysis · Math Ladder</description></item><item><title>The Intermediate Value Theorem</title><link>https://teddyrookbook.com/math/real-analysis/ivt/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/ivt/</guid><description>A continuous function on [a, b] takes every value between f(a) and f(b); the proof uses c = sup{x : f(x) &amp;lt; 0}, and bisection traps c to any accuracy. Real Analysis · Math Ladder</description></item><item><title>The Extreme Value Theorem</title><link>https://teddyrookbook.com/math/real-analysis/evt/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/evt/</guid><description>A continuous function on a closed, bounded interval attains a maximum and a minimum; drop any hypothesis and the supremum may not be attained. Real Analysis · Math Ladder</description></item><item><title>Uniform Continuity</title><link>https://teddyrookbook.com/math/real-analysis/uniform-continuity/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/uniform-continuity/</guid><description>f is uniformly continuous on S when one δ works for every point of S at once; continuous functions on [a, b] are, but 1/x on (0, 1) is not. Real Analysis · Math Ladder</description></item><item><title>Derivatives from the Definition</title><link>https://teddyrookbook.com/math/real-analysis/derivative-definition/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/derivative-definition/</guid><description>f′(a) = lim (f(a + h) − f(a))/h as h → 0; the definition handles what the rules can&amp;#39;t, like x² sin(1/x) at 0. Real Analysis · Math Ladder</description></item><item><title>Differentiability and Continuity</title><link>https://teddyrookbook.com/math/real-analysis/differentiability/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/differentiability/</guid><description>Differentiable at a implies continuous at a, but not conversely; at a break point the one-sided derivatives must exist and agree. Real Analysis · Math Ladder</description></item><item><title>Rolle's Theorem and the Mean Value Theorem</title><link>https://teddyrookbook.com/math/real-analysis/mean-value-theorem/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/mean-value-theorem/</guid><description>If f is continuous on [a, b] and differentiable on (a, b), some c in (a, b) has f′(c) = (f(b) − f(a))/(b − a); Rolle&amp;#39;s theorem is the case f(a) = f(b). Real Analysis · Math Ladder</description></item><item><title>Inequalities from the Mean Value Theorem</title><link>https://teddyrookbook.com/math/real-analysis/mvt-inequalities/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/mvt-inequalities/</guid><description>If |f′| ≤ K on an interval, then |f(x) − f(y)| ≤ K|x − y| there; this proves bounds like |sin x − sin y| ≤ |x − y| and gives δ = ε/K. Real Analysis · Math Ladder</description></item><item><title>Taylor's Theorem with Remainder</title><link>https://teddyrookbook.com/math/real-analysis/taylor-remainder/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/taylor-remainder/</guid><description>f(x) = Pₙ(x) + f⁽ⁿ⁺¹⁾(c)(x − a)ⁿ⁺¹/(n + 1)! for some c between a and x; a bound on f⁽ⁿ⁺¹⁾ bounds the error. Real Analysis · Math Ladder</description></item><item><title>Upper and Lower Sums</title><link>https://teddyrookbook.com/math/real-analysis/upper-lower-sums/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/upper-lower-sums/</guid><description>For a partition P, U(f, P) uses the supremum of f on each piece and L(f, P) the infimum; every lower sum is at most every upper sum, and refining P brings them together. Real Analysis · Math Ladder</description></item><item><title>The Integrability Criterion</title><link>https://teddyrookbook.com/math/real-analysis/integrability-criterion/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/integrability-criterion/</guid><description>f is integrable exactly when for every ε &amp;gt; 0 some partition has U(f, P) − L(f, P) &amp;lt; ε; for monotone f on n equal pieces the gap is |f(b) − f(a)|(b − a)/n. Real Analysis · Math Ladder</description></item><item><title>Which Functions Are Integrable</title><link>https://teddyrookbook.com/math/real-analysis/integrable-functions/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/integrable-functions/</guid><description>Continuous functions, monotone functions and bounded functions with finitely many jumps are integrable; Dirichlet&amp;#39;s function is not, since every U = b − a and every L = 0. Real Analysis · Math Ladder</description></item><item><title>Bounds and the Mean Value Theorem for Integrals</title><link>https://teddyrookbook.com/math/real-analysis/integral-properties/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/integral-properties/</guid><description>If m ≤ f ≤ M on [a, b], then m(b − a) ≤ ∫f ≤ M(b − a); a continuous f equals its average value at some c in [a, b]. Real Analysis · Math Ladder</description></item><item><title>Proving the Fundamental Theorem of Calculus</title><link>https://teddyrookbook.com/math/real-analysis/ftc/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/ftc/</guid><description>F(x) = ∫ₐˣ f is continuous, and F′(c) = f(c) wherever f is continuous; at a jump of f, F has a corner. Real Analysis · Math Ladder</description></item><item><title>Limits of Sums as Integrals</title><link>https://teddyrookbook.com/math/real-analysis/riemann-sum-limits/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/riemann-sum-limits/</guid><description>Because continuous functions are integrable, every Riemann sum tends to the integral; so a limit like (1/n)∑f(k/n) is ∫₀¹ f(x) dx. Real Analysis · Math Ladder</description></item><item><title>Pointwise Convergence</title><link>https://teddyrookbook.com/math/real-analysis/pointwise-convergence/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/pointwise-convergence/</guid><description>fₙ → f pointwise when fₙ(x) → f(x) at each x separately; a pointwise limit of continuous functions can jump, as xⁿ on [0, 1] does. Real Analysis · Math Ladder</description></item><item><title>Uniform Convergence and the Sup Norm</title><link>https://teddyrookbook.com/math/real-analysis/uniform-convergence/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/uniform-convergence/</guid><description>fₙ → f uniformly when ‖fₙ − f‖ = sup |fₙ(x) − f(x)| → 0: one N works for every x at once. Real Analysis · Math Ladder</description></item><item><title>What Uniform Convergence Keeps</title><link>https://teddyrookbook.com/math/real-analysis/uniform-limits/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/uniform-limits/</guid><description>A uniform limit of continuous functions is continuous, and ∫fₙ → ∫f; without uniform convergence, the limit of the integrals can differ from the integral of the limit. Real Analysis · Math Ladder</description></item><item><title>The Weierstrass M-Test</title><link>https://teddyrookbook.com/math/real-analysis/weierstrass-m-test/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/weierstrass-m-test/</guid><description>If |fₖ(x)| ≤ Mₖ for every x and ∑Mₖ converges, then ∑fₖ converges uniformly (and absolutely). Real Analysis · Math Ladder</description></item><item><title>Power Series: Radius and Uniform Convergence</title><link>https://teddyrookbook.com/math/real-analysis/power-series-radius/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/power-series-radius/</guid><description>∑cₙxⁿ has radius R = 1/lim sup |cₙ|^(1/n); it converges uniformly on every [−r, r] with r &amp;lt; R, so its sum is continuous inside the interval. Real Analysis · Math Ladder</description></item><item><title>Metric Spaces</title><link>https://teddyrookbook.com/math/real-analysis/metric-spaces/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/metric-spaces/</guid><description>A metric d measures distance: d(x, y) &amp;gt; 0 unless x = y, d(x, y) = d(y, x), and d(x, z) ≤ d(x, y) + d(y, z); the taxicab, Euclidean and max metrics on ℝ² are three examples. Real Analysis · Math Ladder</description></item><item><title>Open and Closed Sets</title><link>https://teddyrookbook.com/math/real-analysis/open-closed-sets/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/open-closed-sets/</guid><description>A set is open when every point has a ball around it inside the set, and closed when it contains all its limit points; the closure adds the limit points. Real Analysis · Math Ladder</description></item><item><title>Compact Sets</title><link>https://teddyrookbook.com/math/real-analysis/compactness/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/compactness/</guid><description>K is compact when every open cover has a finite subcover; in ℝⁿ that happens exactly when K is closed and bounded (Heine–Borel). Real Analysis · Math Ladder</description></item><item><title>The Contraction Mapping Theorem</title><link>https://teddyrookbook.com/math/real-analysis/contraction-mapping/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://teddyrookbook.com/math/real-analysis/contraction-mapping/</guid><description>If d(g(x), g(y)) ≤ k·d(x, y) with k &amp;lt; 1 on a complete space, g has exactly one fixed point, and the nth iterate is within kⁿd(x₁, x₀)/(1 − k) of it. Real Analysis · Math Ladder</description></item></channel></rss>