the union bound says: P(A∪B) ≤ P(A) + P(B)

Chebyshev's inequality says: P(|X-μ| ≥ kσ) ≤ 1/k²

Chebyshev's inequality states: P(|X-μ| ≥ kσ) ≤ 1/k²

Sum of angles of a triangle

Sum of angles in a triangle equals 180 degrees

Curry–Howard correspondence

Proofs are programs, types are propositions

CAP theorem states: you can have at most 2 of consistency, availability, partition tolerance

CAP theorem: A system can achieve at most two out of Consistency, Availability, Partition Tolerance

Yoneda lemma

The Yoneda lemma embeds a locally small category into a functor category

O(n log n) is the lower bound for comparison-based sorting

O(n log n) is the lower bound because each of n elements must be compared at least log n times to ensure all permutations are considered