Sigma Notation in Sequences and Series | Engineering Math Basics

The definite integral is defined as the limit of Riemann sums as n approaches infinity: ∫ from a to b of f(x) dx = lim(n→∞) Σ from k=1 to n of [f(x_k*) × Δx]. The instructor demonstrates this with specific examples, showing how the Riemann sum for f(x) = x over [0, 1] approaches 0.5 as n increases. The instructor emphasizes that this limit process transforms the approximation into an exact value, which is the fundamental concept of the definite integral.

This comprehensive section establishes the theoretical framework for understanding Riemann sums. It begins by defining the integral as the area under a curve, then explores how to calculate areas for irregular shapes by approximating them with rectangles. The video introduces two methods: left endpoint and right endpoint approaches, explaining how increasing the number of rectangles improves approximation accuracy. Key formulas are derived for rectangle width ((b-a)/n) and heights based on function evaluation at specific points. The section culminates in presenting the Riemann Sum Theorem, which states that for continuous functions on closed intervals, the definite integral equals the limit of Riemann sums as the number of rectangles approaches infinity.

Riemann sums approximate definite integrals by dividing the interval into subintervals and summing the areas of rectangles. The lower sum uses the minimum function value in each subinterval, while the upper sum uses the maximum.

This segment develops the complete theory of integration. The instructor explains that the sum of all rectangle areas (f(tᵢ) × Δxᵢ for i = 1 to n) provides an approximation that improves as the number of subintervals increases. The integral is formally defined as the limit of these Riemann sums as the maximum subinterval width approaches zero, transforming the approximation into an exact value. The notation ∫ₐᵇ f(x) dx is explained: ∫ is an elongated S (from 'sum'), a and b are limits, f(x) is the function, and dx represents the differential element. The instructor addresses how to handle negative functions: when f(x) is negative, the integral gives the negative of the area, and for functions that change sign, we must separate positive and negative regions. The segment culminates in introducing the Fundamental Theorem of Calculus, which connects differentiation and integration by stating that integration can be computed using antiderivatives. This theorem transforms the limit process into algebraic computation, making integration practical for calculation.

The definite integral ∫ₐᵇ f(x)dx is defined as the limit of Riemann sums as the mesh of the partition approaches zero: ∫ₐᵇ f(x)dx = lim(||P||→0) Σᵢ₌₁ⁿ f(cᵢ)Δxᵢ. This definition shows that the integral represents the exact area under the curve, which is the limit of increasingly accurate Riemann sum approximations. The geometric interpretation is that the integral equals the net signed area between the function and the x-axis.

An infinite series sums terms a₁ + a₂ + ... + aₙ + ... and requires different convergence tests. The Integral Test applies when f(n) is continuous, positive, and decreasing: if ∫₁^∞ f(x)dx converges, the series converges. The Comparison Test compares series: if 0 ≤ aₙ ≤ bₙ and ∑bₙ converges, then ∑aₙ converges. The Limit Comparison Test uses lim(n→∞) aₙ/bₙ = L (0<L<∞) to determine simultaneous convergence/divergence. The Ratio Test computes L = lim(n→∞) |aₙ₊₁/aₙ|: L<1 implies convergence, L>1 implies divergence, L=1 is inconclusive.

Apply the Integral Test by evaluating ∫₁^∞ x^(-3/2) dx. Using the power rule, the antiderivative is -2x^(-1/2) = -2/√x. Evaluate from 1 to ∞: lim(x→∞) [-2/√x] - [-2/√1] = 0 - (-2) = 2. Since the integral converges to 2 (a finite value), the series converges by the Integral Test. The test guarantees convergence but does not specify the exact sum.

For the series sum from n=1 to infinity of n times e^(-n^2), two approaches work: (1) Ratio test: take the limit of the ratio of consecutive terms. (2) Integral test: consider f(x) = x/e^(x^2), show it is positive, continuous, and decreasing, then integrate from 1 to infinity. Both methods can determine convergence or divergence.

Convergence tests determine whether infinite series converge to finite values or diverge to infinity. The integral test compares a series to an improper integral by visualizing terms as rectangles. If the integral diverges, the series diverges; if the integral converges and rectangles are above the curve, the series converges. The harmonic series (1 + 1/2 + 1/3 + ...) diverges because the integral of 1/x from 1 to infinity equals infinity.

To test ∑₂^∞ 1/[n(log n)²], use f(x) = 1/[x(log x)²]. Since f'(x) = -[1/x²(log x)⁴](log x + 2) < 0 for x ≥ 2, f(x) is decreasing. Compute ∫₂^∞ 1/[x(log x)²] dx = ∫₂^∞ d(log x)/(log x)² = [-1/log x]₂^∞ = 1/log 2, which is finite. Therefore, the series converges.

Taylor Series is a mathematical method developed by Brook Taylor that allows transcendental functions (such as exponential, sine, and cosine functions) to be represented as infinite polynomials by using derivatives evaluated at a specific point. The series is expressed as f(x) = Σ [f^(n)(a)/n!] * (x-a)^n, where f^(n)(a) is the nth derivative of f evaluated at point a. This groundbreaking technique, which connects algebraic and transcendental functions, enables mathematicians to approximate complex functions using polynomial expressions, with the Maclaurin Series being the special case where a=0.

The Maclaurin series derives from Taylor series by setting the expansion point to zero. For f(x) = sin(x), substituting x=0 yields an alternating series with non-zero terms only at odd powers: sin(x) = x - x³/3! + x⁵/5! - x⁷/7! + ... Similarly, for f(x) = cos(x), the expansion contains only even powers: cos(x) = 1 - x²/2! + x⁴/4! - x⁶/6! + ... The exponential function e^x produces the simplest case: e^x = 1 + x/1! + x²/2! + x³/3! + x⁴/4! + ..., where all derivatives at zero equal 1. These expansions demonstrate how transcendental functions become tractable polynomial representations.

Taylor series and Maclaurin series are mathematical tools for representing functions as infinite power series. A Taylor series centered at point 'a' is expressed as f(x) = Σ (from n=0 to ∞) of [f^(n)(a)/n!] * (x-a)^n, where f^(n)(a) is the nth derivative of f evaluated at a. A Maclaurin series is a special case of Taylor series where a=0, simplifying to f(x) = Σ (from n=0 to ∞) of [f^(n)(0)/n!] * x^n. For example, the Maclaurin series for e^x is 1 + x + x²/2! + x³/3! + ..., and for cos(x) it is 1 - x²/2! + x⁴/4! - x⁶/6! + ..., while the Taylor series for ln(x) centered at x=1 is (x-1) - (x-1)²/2 + (x-1)³/3 - (x-1)⁴/4 + ....

Taylor and Maclaurin series are infinite series that represent functions as sums of terms involving derivatives evaluated at a specific point, allowing complex functions to be approximated by polynomials; Maclaurin series are a special case of Taylor series where the expansion point is zero.

Taylor series expansion represents a function as an infinite sum of terms calculated from derivatives at a point 'a': f(x) = f(a) + f'(a)(x-a) + f''(a)(x-a)²/2! + f'''(a)(x-a)³/3! + ... Maclaurin series is the special case where expansion is about x=0. The choice of function to expand depends on the question—use standard series for sin(x), e^x, ln(1+x), etc., and the general formula for composite functions. For composite functions like sin(x-5), expand the inner function first, then substitute into the standard series.

When integrating the square of a Fourier series, we encounter double summations: ∫₋π^π [Σₙ=₁^∞ (aₙcos(nx) + bₙsin(nx))]² dx becomes Σₙ=₁^∞ Σₘ=₁^∞ [aₙaₘcos(nx)cos(mx) + aₙbₘcos(nx)sin(mx) + bₙaₘsin(nx)cos(mx) + bₙbₘsin(nx)sin(mx)] dx. Different indices (n and m) must be used to distinguish between the two summations.

The discrete-time Fourier series (DTFS) represents periodic discrete-time signals using a finite set of frequency components. Unlike continuous-time Fourier series with infinite coefficients, DTFS has exactly N distinct coefficients matching the signal's period N. The analysis equation computes coefficients from the time-domain signal, while the synthesis equation reconstructs the signal from these coefficients. Both involve summation over one period of the waveform. This finite nature makes DTFS essential for digital signal processing of sampled signals.

This video demonstrates how to study the convergence of Fourier series using Dirichlet's theorem and calculate infinite series sums by evaluating the Fourier series at specific points (such as x=0) and applying Parseval's identity, showing that the sum of 1/(2n+1)² equals π²/8 and the sum of 1/(2n+1)⁴ equals π⁴/96.

Discrete-time complex exponentials are defined as s_k(n) = e^(j2πkn/N), where unlike continuous-time cases with infinite harmonics, discrete-time signals have a finite number of distinct harmonics determined by the denominator of the rational relative frequency f₀ = k/N; specifically, when f₀ is rational, there are exactly N distinct harmonics (k = 0 to N-1) that share the same fundamental period N, enabling any periodic discrete-time signal x(n) to be decomposed into a weighted sum of these harmonics through the discrete-time Fourier series expansion.

This comprehensive lecture covers two fundamental topics in signals and systems. First, discrete-time systems are described by constant coefficient linear difference equations of the form a_K * y(n-K) = Σ b_K * x(n-K). Systems are classified as Finite Impulse Response (FIR) or Infinite Impulse Response (IIR) based on whether they are recursive or non-recursive. For a first-order equation y(n) - (1/2)y(n-1) = x(n), solving requires one initial condition, with solutions found through forward recursion (n ≥ 0) and backward recursion (n < 0). A system is linear if and only if the initial condition is zero, and causal if x(n) = 0 for all n ≤ n₀ implies y(n) = 0 for all n ≤ n₀. For discrete-time systems, if a system is linear and causal, it is also time-invariant. Second, Fourier series is a fundamental tool for analyzing linear time-invariant systems. Joseph Fourier (1768-1830) was a French mathematician and Egyptologist who published his influential work on heat conduction in 1822. Euler first proposed that string vibrations could be decomposed into sines and cosines, but Fourier developed the rigorous mathematical framework. Any general signal can be decomposed into a summation of exponential signals e^(st), which are eigenfunctions of LTI systems. For an LTI system with impulse response h(t), if the input is x(t) = e^(st), the output is y(t) = H(s) * e^(st), where H(s) is the eigenvalue. For a linear system, if the input is a linear combination of eigenfunctions, the output is the sum of scaled eigenfunctions. This is the mathematical foundation of Fourier series.