Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Demonstration

Description

This lecture presents the demonstration of a theorem using the function g(x) to evaluate f(x) along a specific line, showing that g inherits properties from f, such as continuity and differentiability.

In MOOCs (2)

Analysis I

Analysis I (part 5): Continuous and derivable functions, the derivative function

Official source

Quiz

Related concepts (11)

Evaluation strategy

In a programming language, an evaluation strategy is a set of rules for evaluating expressions. The term is often used to refer to the more specific notion of a parameter-passing strategy that defines the kind of value that is passed to the function for each parameter (the binding strategy) and whether to evaluate the parameters of a function call, and if so in what order (the evaluation order). The notion of reduction strategy is distinct, although some authors conflate the two terms and the definition of each term is not widely agreed upon.

Lazy evaluation

In programming language theory, lazy evaluation, or call-by-need, is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (by the use of sharing). The benefits of lazy evaluation include: The ability to define control flow (structures) as abstractions instead of primitives. The ability to define potentially infinite data structures. This allows for more straightforward implementation of some algorithms.

Short-circuit evaluation

Short-circuit evaluation, minimal evaluation, or McCarthy evaluation (after John McCarthy) is the semantics of some Boolean operators in some programming languages in which the second argument is executed or evaluated only if the first argument does not suffice to determine the value of the expression: when the first argument of the AND function evaluates to false, the overall value must be false; and when the first argument of the OR function evaluates to true, the overall value must be true.

Semi-differentiability

In calculus, a branch of mathematics, the notions of one-sided differentiability and semi-differentiability of a real-valued function f of a real variable are weaker than differentiability. Specifically, the function f is said to be right differentiable at a point a if, roughly speaking, a derivative can be defined as the function's argument x moves to a from the right, and left differentiable at a if the derivative can be defined as x moves to a from the left.

Differentiable function

In mathematics, a differentiable function of one real variable is a function whose derivative exists at each point in its domain. In other words, the graph of a differentiable function has a non-vertical tangent line at each interior point in its domain. A differentiable function is smooth (the function is locally well approximated as a linear function at each interior point) and does not contain any break, angle, or cusp. If x0 is an interior point in the domain of a function f, then f is said to be differentiable at x0 if the derivative exists.

Related lectures (5)

Tangent to Graph of a Function

Explores finding the equation of the tangent line to a function's graph at a point.

Differential and Tangent Plan

Explores differentiable functions, gradients, and tangent planes in two-variable functions.

Linear Approximation and Derivative Parametric

Covers linear approximation, parametric derivatives, and differentiability conditions on intervals.

Optimal Stopping Problems: Theory and Applications Log in to Mediaspace to watch this video

Covers optimal stopping problems in applied probability and stochastic processes, focusing on theory and practical applications.

Solving the Quintic: Dominant Balance Analysis Log in to Mediaspace to watch this video