Tags

  • AWS (7)
  • Apigee (3)
  • ArchLinux (5)
  • Array (6)
  • Backtracking (6)
  • BinarySearch (6)
  • C++ (19)
  • CI&CD (3)
  • Calculus (2)
  • DesignPattern (43)
  • DisasterRecovery (1)
  • Docker (8)
  • DynamicProgramming (20)
  • FileSystem (11)
  • Frontend (2)
  • FunctionalProgramming (1)
  • GCP (1)
  • Gentoo (6)
  • Git (15)
  • Golang (1)
  • Graph (10)
  • GraphQL (1)
  • Hardware (1)
  • Hash (1)
  • Kafka (1)
  • LinkedList (13)
  • Linux (27)
  • Lodash (2)
  • MacOS (3)
  • Makefile (1)
  • Map (5)
  • MathHistory (1)
  • MySQL (21)
  • Neovim (10)
  • Network (66)
  • Nginx (6)
  • Node.js (33)
  • OpenGL (6)
  • PriorityQueue (1)
  • ProgrammingLanguage (9)
  • Python (10)
  • RealAnalysis (20)
  • Recursion (3)
  • Redis (1)
  • RegularExpression (1)
  • Ruby (19)
  • SQLite (1)
  • Sentry (3)
  • Set (4)
  • Shell (3)
  • SoftwareEngineering (12)
  • Sorting (2)
  • Stack (4)
  • String (2)
  • SystemDesign (13)
  • Terraform (2)
  • Tree (24)
  • Trie (2)
  • TwoPointers (16)
  • TypeScript (3)
  • Ubuntu (4)
  • Home

    [Understanding Analysis by Stephen Abbott] - [Chapter 5 The Derivatives] - [5.2 Derivatives and the Intermediate Value Property]

    Published Jul 03, 2021 [  RealAnalysis  ]

    Definition 5.2.1 (Differentiability) Let \(g : A \to \mathbb{R}\) be a function defined on an interval \(A\). Given \(c \in A\), the derivative of \(g\) at \(c\) is defined by $$ g^\prime(c) = \lim_{x \to c}\frac{g(x) - g(c)}{x - c} $$ provided this limit exists. In this case, we say \(g\) is differentiable at \(c\) if \(g^\prime\) exists for all points \(c \in A\), we say that \(g\) is differentiable on \(A\)

    Theorem 5.2.3. If \(g : A \to \mathbb{R}\) is differentiable at a point \(c \in A\), then \(g\) is continuous at \(c\) as well.

    Theorem 5.2.4 (Algebraic Differentiability Theorem). Let \(f\) and \(g\) be functions defined on an interval \(A\), and assume both are differentiable at some point \(c \in A\). Then,

    1. \((f + g)^\prime(c) = f^\prime(c) + g^\prime(c)\)
    2. \((kf)^\prime(c) = kf^\prime(c)\), for all \(k \in \mathbb{R}\)
    3. \((fg)^\prime(c) = f^\prime(c)g(c) + f(c)g^\prime(c)\)
    4. \((f/g)^\prime(c) = \frac{f^\prime(c)g(c) - f(c)g^\prime(c)}{[g(c)]^2} \), provided that \(g(c) \neq 0\)

    Theorem 5.2.5 (Chain Rule). Let \(f : A \to \mathbb{R}\) and \(g : B \to \mathbb{R}\) satisfy \(f(A) \subseteq B\) so that the composition of \(g \circ f\) is defined. If \(f\) is differentiable at \(c \in A\) and \(g\) is differentiable at \(f(c) \in B\), then \(g \circ f\) is differentiable at \(c\) with \((g \circ f)^\prime(c) = g^\prime(f(c)) \cdot f^\prime(c)\)

    Theorem 5.2.6 (Interior Extremum Theorem). Let \(f\) be differentiable on an open interval \((a, b).\) if \(f\) attains a maximum value at some point \(c \in (a, b)\), then \(f^\prime(c) = 0\). The same is true if \(f(c)\) is a minimum value.

    Theorem 5.2.7 (Darboux's Theorem). If \(f\) is differentiable on an interval \([a, b]\), and if \(\alpha\) satisfies \(f^\prime(a) < \alpha < f^\prime(b)\), then there exists a point \(c \in (a, b)\) where \(f^\prime(c) = \alpha\)