The diagonal argument, introduced by Cantor in 1891, proves some infinities are strictly larger than others by constructing an object that evades any proposed complete list or mapping. This same self-referential trick underlies Cantor's theorem, Turing's halting problem, and Gödel's incompleteness theorem—one idea unifying set theory, computability, and logic.

From a statistical learning perspective, modern neural networks can indeed be understood as a large-scale maximum likelihood estimation (MLE) process. Specifically, a neural network is a parameterized function, and the most common way to train a neural network is to perform maximum likelihood estimation on the data.

The core purpose of UAT (Universal Approximation Theorem) is that neural networks can approximate any continuous function, and continuous functions can be approximated by polynomials (Weierstrass theorem).

Vectors are arrows, dual vectors are rulers—their pairing yields invariant scalars. Tensors are multi-slot linear machines with fillable slots, resolving the vector-in/vector-out vs. scalar-out paradox. The metric tensor bridges the two, keeping lengths and energies coordinate-invariant.

The Fréchet Mean Prototype is the center point in a metric space that minimizes the sum of the squared distances to all data points. It extends the averaging operation from flat vector spaces to arbitrary curved spaces or complex objects.