Borel Sigma Algebras Explained | Measure Theory 2

In measure theory, a function f: Ω → ℝ̄ is measurable if the preimage of every Borel set belongs to the σ-algebra F; equivalently, it suffices to check that f⁻¹((−∞, x]) ∈ F for all x ∈ ℝ. Simple functions are measurable functions that take finitely many values and can be expressed as finite linear combinations of indicator functions of measurable sets. For a non-negative simple function f = Σc_k·1_E_k, its integral is defined as Σc_k·μ(E_k), and this definition extends to all non-negative measurable functions via monotone convergence, and finally to all measurable functions by decomposing them into positive and negative parts.

A function f: X → ℝ is called measurable if for every real number α, the set f⁻¹([α, ∞)) is a measurable set; this definition extends to extended real-valued functions, and it can be shown that a function is measurable if and only if any one of the four equivalent conditions holds: f⁻¹((α, ∞)), f⁻¹([α, ∞)), f⁻¹((−∞, α)), or f⁻¹((−∞, α]) is measurable for all α ∈ ℝ, and measurable functions are closed under countable unions, intersections, and complements.

This section covers measurable functions: (1) f is measurable if {x: f(x)>a} is measurable for all a∈R; (2) Translation invariance: if E is measurable, E+a is measurable; (3) Algebra of measurable functions: if f,g measurable, then f+g, f-g, f×g, f/g (g≠0) are measurable; (4) Limits: lim sup f_n, lim inf f_n, and lim f_n (if exists) are measurable. These properties ensure measurability is preserved under standard operations.

Measurable functions generalize continuous functions by preserving measurable structure rather than topological structure. A function f: (E, A) → (F, B) is measurable if f⁻¹(B) ∈ A for all B ∈ B. Continuous functions are always Borel measurable because they preserve open sets, which generate the Borel tribe. The composition of measurable functions remains measurable, as (g∘f)⁻¹(C) = f⁻¹(g⁻¹(C)) preserves measurability through composition.

If f is continuous and g is measurable, then f ∘ g is measurable. A function f is measurable if and only if for every open set G, the inverse image f⁻¹(G) is measurable. If f is measurable on each Eᵢ in a countable collection of disjoint measurable sets, then f is measurable on ∪Eᵢ. If f is measurable on a measurable set E, and E₁ is a measurable subset of E, then f is measurable on E₁. If f and g are measurable functions on a measurable set E, then the set {x ∈ E : f(x) < g(x)} is measurable, as it equals ∪_{r ∈ ℚ} ({x : f(x) < r} ∩ {x : g(x) > r}), a countable union of measurable sets.

Lebesgue integration, developed by French mathematician Henri Lebesgue, provides a more powerful alternative to Riemann integration by measuring the size of sets in the range (y-axis) rather than partitioning the domain (x-axis); this approach enables integration of highly discontinuous functions like the Dirichlet function (which equals 1 for irrationals and 0 for rationals) by summing the product of function values and the measure of their corresponding sets, and forms the foundation for modern probability theory and expected value calculations.

Lebesgue integration approximates functions using simple functions (step functions). For f(x) = x² on [0,1], partition [0,1] into n equal intervals and define fn(x) = i/n on [(i-1)/n, i/n) for i = 1 to n-1, with fn(1) = 1. This sequence converges pointwise to x² as n→∞. The integral equals the limit of integrals of these simple functions, which equals the same Riemann sum expression that evaluates to 1/3. The pointwise convergence is proven by showing |fn(x) - f(x)| ≤ (2n-1)/n², which approaches 0 as n→∞.

The Dirichlet function D(x) = 1 if x is rational, 0 if irrational, has Lebesgue integral 0 from 0 to 1 because rationals have measure 0. The Lebesgue integral ignores values on sets of measure 0, so changing D(x) on rational points doesn't change the integral. Teaching advanced mathematics requires deep understanding, not just surface knowledge. To explain a topic well, one must understand its origins, proofs, and relationships. Effective teaching comes from genuine mastery, not from reading and simplifying unfamiliar material.

The Lebesgue integral, developed by Henri Lebesgue in 1902, revolutionized integration by shifting from partitioning the x-axis (as in the Riemann integral) to partitioning the y-axis based on function values, combined with the Lebesgue measure which assigns length zero to individual points; this approach successfully integrates functions like the Dirichlet function (which equals 1 at rationals and 0 at irrationals) that the Riemann integral cannot handle, and forms the foundation for modern analysis, probability theory, Fourier analysis, and quantum mechanics through L2 Hilbert spaces.

Lebesgue integration is a university-level mathematical theory that measures the size of objects by dividing them into measurable sets, with the key advantage being its superior handling of function sequence convergence compared to Riemann integration; it expands the range of integrable functions and provides the theoretical foundation for probability theory, statistics, stochastic processes, and functional analysis, making it essential for understanding continuous and infinite phenomena in modern mathematics.

The Lebesgue σ-algebra (sets satisfying the Carathéodory condition) equals the Borel σ-algebra on ℝ^d. One inclusion is clear since every rectangle can be represented as a countable intersection of open rectangles, making all rectangles Borel measurable. Since the algebra of finite unions of rectangles generates the Borel σ-algebra, the Lebesgue σ-algebra contains the Borel σ-algebra. For the reverse inclusion, every open set can be written as a countable union of open rectangles with rational endpoints (using second-countability of ℝ^d), and since rectangles are in the Lebesgue σ-algebra, all open sets are also in it, hence the entire Borel σ-algebra is contained.

A sigma algebra is closed under countable unions, intersections, and complementation. The Borel sigma algebra B is the smallest containing all open intervals. The Lebesgue sigma algebra M contains B and is closed under countable operations. M cannot equal the power set of R because outer measure M* is not countably additive on the power set, while its restriction to M is. This proves M is properly contained in the power set, guaranteeing non-measurable sets exist.

A sigma-algebra is a collection of subsets closed under complements and countable unions. The Borel sigma-algebra on a metric space is generated by all open sets. Starting with finite unions of intervals gives an algebra but not a sigma-algebra, because countable unions may not belong to this family. The Borel sigma-algebra includes complex sets like the Cantor set. The Carathéodory extension theorem guarantees that any finitely additive function on an algebra extends uniquely to a countably additive measure on the generated sigma-algebra. Applying this to the unit interval with length as the initial definition yields Lebesgue measure on the Borel sigma-algebra.

The Borel sigma-algebra on R can be generated by different collections: open intervals, closed intervals, semi-infinite intervals, or intervals of the form (a,b] or [a,b]. All generate the same sigma-algebra. The Lebesgue measure on R is constructed by applying the same procedure as for [0,1]: define a pseudo-measure on intervals by λ([a,b]) = b - a, verify countable additivity, and apply Carathéodory's Extension Theorem. The resulting measure λ is called the Lebesgue measure on R. Unlike the Lebesgue measure on [0,1], which is a probability measure, λ(R) = +∞, so it is an infinite measure.

The Borel sigma-algebra is defined as the smallest sigma-algebra containing all open sets (or equivalently, all intervals). Any open set in R can be represented as a countable union of disjoint open intervals. The Borel sigma-algebra contains all intervals because it contains all open sets, and every interval can be obtained from open sets through countable operations. The Borel measure is the restriction of the Lebesgue measure to the Borel sigma-algebra. The Lebesgue measurable sets form a larger sigma-algebra than the Borel sigma-algebra because the Lebesgue measure is complete (contains all subsets of null sets), while the Borel measure is not complete.

This comprehensive section establishes the foundational concepts of probability theory essential for understanding stochastic processes. A random experiment (Zufallsexperiment) is a trial where all possible outcomes are known but the specific outcome cannot be predicted. Three central concepts must be distinguished: Outcome (Ergebnis) is a single possible result; Event (Ereignis) is a set of one or more outcomes; Sample Space (Ergebnisraum, Omega) is the set of all possible outcomes. The cardinality (Mächtigkeit) represents the number of elements in a set. Probability (P(A)) measures the likelihood of an event occurring, always between 0 and 1. The complementary event probability follows P(A') = 1 - P(A). The Laplace probability formula calculates probability as favorable outcomes divided by total outcomes: P(A) = |A| / |Omega|. The addition rule (Additionssatz) calculates union probability: P(A ∪ B) = P(A) + P(B) - P(A ∩ B), subtracting the intersection to avoid double-counting. Stochastic independence occurs when P(A ∩ B) = P(A) × P(B), meaning events don't influence each other. Conditional probability (P(A|B) = P(A ∩ B) / P(B)) calculates probability given a condition. These concepts form the mathematical foundation for all probability calculations.

Probability theory begins with random experiments having unpredictable outcomes with multiple possibilities. Sample space represents all possible outcomes as a set. Probability equals favorable outcomes divided by total outcomes, always between 0 and 1. For coin tosses, sample space size follows 2^n. Dice problems yield 36 total outcomes. Events are classified as equally likely, mutually exclusive (cannot occur together), exhaustive (cover all outcomes), or independent (one doesn't affect the other). The addition theorem P(A ∪ B) = P(A) + P(B) - P(A ∩ B) calculates probability of either event occurring. For exactly one event, use P(A) + P(B) - 2P(A ∩ B). For three events, the inclusion-exclusion principle extends with alternating addition and subtraction of intersection terms.

Probability theory studies the likelihood of events occurring. The sample space (espace fondamental) contains all possible outcomes of an experiment, such as the six faces of a die. Events are subsets of the sample space representing one or more outcomes. Events can be certain (probability 1), impossible (probability 0), or uncertain. Probability measures the likelihood of events, expressed as values between 0 and 1. For example, rolling a specific number on a fair die has probability 1/6.

This comprehensive section establishes the foundational concepts of probability theory. An experiment is a test or observation performed to gain information about an event. The sample space (örnek uzay) is the set of all possible outcomes—for example, when rolling a die, the sample space is {1, 2, 3, 4, 5, 6}. An event is any subset of the sample space. An impossible event has zero probability, while a certain event has 100% probability. An equally likely sample space is one where all outcomes have equal probability. The probability function maps events to values between 0 and 1. Complementary events cannot occur simultaneously. The probability of the union of two events is P(A ∪ B) = P(A) + P(B) - P(A ∩ B). For mutually exclusive events, this simplifies to P(A) + P(B). The probability of an event not occurring is P(A') = 1 - P(A). These principles form the mathematical foundation for solving probability problems.

Probability theory rests on three fundamental concepts: (1) Random Experiment - an experiment where all possible outcomes can be identified before performing it, but the actual outcome cannot be predicted; (2) Sample Space - the complete set of all possible outcomes, denoted by Ω; (3) Event - a subset of the sample space representing a specific outcome. Events are classified as: Impossible (probability = 0), Certain (probability = 1), or Possible (probability between 0 and 1). The probability formula is: Probability = (Number of favorable outcomes) / (Total number of possible outcomes). This 'part over whole' principle applies universally across all probability problems.