Articles in This Field
Measure-Theoretic Probability: σ-Algebras, Random Variables, and Expectation as an Integral
Probability theory becomes conceptually complete when it is formulated as measure theory with total mass one. The benefit is not abstraction for its own sake. The measure-theoretic framework tells you exactly which sets can be assigned probabilities without contradiction, which functions can be treated as random variables, and why the operations that dominate probability—limits, conditioning, […]
Martingales and Stopping Times: Optional Stopping, Maximal Inequalities, and Convergence Machinery
Martingales are the most efficient language for “no predictable drift.” They formalize fair games, but their reach is broader: they govern many stochastic processes, provide clean proofs of limit theorems, and yield sharp bounds on fluctuations. The power of martingales comes from two facts. First, the defining identity is conditional: it tracks what can be […]
Characteristic Functions and Weak Convergence: Proving the Central Limit Theorem by Analytic Limits
Convergence in distribution is the basic language of limit laws. It is weak enough to describe asymptotic shapes of random variables without requiring a pointwise coupling, yet strong enough to support stable consequences such as convergence of probabilities of continuity sets and convergence of expectations of bounded continuous test functions. The most direct tool for […]
A Counterexample That Teaches Probability Better Than a Lecture
Probability feels intuitive until you try to make a single sentence precise. The fastest way to learn what the definitions really mean is to watch one plausible inference fail in a clean, controlled setting. Counterexamples do not just refute; they expose the boundary of a concept, and they teach you how to reason without importing […]
Common Mistakes in Probability and How to Avoid Them
Probability is unforgiving in a helpful way: a statement is either true under stated assumptions or it is not. Many mistakes come from skipping the assumptions that make a familiar identity valid. The fastest way to become reliable is to learn the standard failure modes and the correct replacement moves. This article collects frequent mistakes […]
Computing with Probability: What Survives Discretization
Probability lives in a world of measures on large spaces. Computing lives in a world of finite objects: floating-point numbers, arrays, finite graphs, finite random seeds. Almost every computational workflow in probability is a discretization, even when you do not call it that. The interesting question is not whether discretization changes things. It always changes […]
Subfields
No subfields yet.
Study Topics
- A Counterexample That Teaches Probability Better Than a Lecture
- Characteristic Functions and Weak Convergence: Proving the Central Limit Theorem by Analytic Limits
- Common Mistakes in Probability and How to Avoid Them
- Computing with Probability: What Survives Discretization
- Martingales and Stopping Times: Optional Stopping, Maximal Inequalities, and Convergence Machinery
- Measure-Theoretic Probability: σ-Algebras, Random Variables, and Expectation as an Integral
- Markov Chains: Stationary Distributions, Mixing, and Why Reversibility Is So Useful
- Brownian Motion and the Central Limit Principle: Scaling Limits That Create a Universal Process
- Concentration Inequalities: Hoeffding, Bernstein, and How Random Sums Stay Near Their Means
Related Topics
Algebra
- A Proof Strategy Guide for Algebra: Starting with Symmetry
- Building Examples in Algebra: A Practical Recipe
- Computing with Algebra: What Survives Discretization
- Generators and Relations Done Right: Presentations, Normal Forms, and What They Actually Prove
- Tensor Products Without Tears: How Algebra Forces the Universal Bilinear Object
- The First Isomorphism Theorem as a Workhorse in Algebra: Kernels, Images, and Structure
Analysis and Partial Differential Equations
- A Counterexample That Teaches Analysis and Partial Differential Equations Better Than a Lecture
- A Proof Strategy Guide for Analysis and Partial Differential Equations: Starting with Regularity
- Analysis and Partial Differential Equations and the Art of Choosing the Right Notation
- Analysis and Partial Differential Equations Through Worked Examples: Estimates as the Thread
- Building Examples in Analysis and Partial Differential Equations: A Practical Recipe
- Common Mistakes in Analysis and Partial Differential Equations and How to Avoid Them
Category Theory
- A Counterexample That Teaches Category Theory Better Than a Lecture
- Category Theory and the Art of Choosing the Right Notation
- Category Theory as a Language: What It Lets You Say Precisely
- Category Theory Through Worked Examples: Adjunctions as the Thread
- Five Standard Proof Patterns in Category Theory
- From Definitions to Power: The Minimal Core of Category Theory
Related Fields
Mathematics
Mathematics fields mapped as stable hub paths that follow prerequisites from foundations to advanced topics.
Algebra
Analysis and Partial Differential Equations
Category Theory
Combinatorics
Dynamical Systems
Geometry
Logic and Foundations
Mathematical Physics
Number Theory
Numerical Analysis
Science
Natural and applied sciences mapped as stable hub paths for focused study from fundamentals to applications.
Philosophy
Philosophy fields mapped as stable hub paths for core questions, key arguments, and major positions.
History
History fields mapped as stable hub paths across periods, regions, methods, and themes for deep study.
Logic
Philosophy of Mathematics