A Natural Proof of the Dominated Convergence Theorem
Egorov's Theorem provides a more natural proof of the celebrated Dominated Convergence Theorem than the traditional clean proof via Fatou's Lemma.
Egorov's Theorem provides a more natural proof of the celebrated Dominated Convergence Theorem than the traditional clean proof via Fatou's Lemma.
The solution to Exercise 2A, Problem 8 and 9, in Measure, Integration & Real Analysis.
Why do we use the Kullback-Leibler (KL) divergence as a measure of distance between probability distributions? Why do we use the cross-entropy loss function in supervised machine learning?
What is the mysterious axiom of choice? Why the hell do we need it even just to show that every infinite set has a countable subset? Why does every vector space have a basis? ...
The best approximate solution to a system of linear equations, and applications beyond linear equations.
This post is part of a series of algorithm notes originally intended only for myself.
This post is part of a series of algorithm notes originally intended only for myself.
The awkward introduction and definition of determinants often puzzle beginners, including me. However, as the level of abstraction increases, its motivation becomes clearer and the underlying elegance emerges.