|
You are here |
g-w1.github.io | ||
| | | | |
nulliq.dev
|
|
| | | | | In search of a better dot product | |
| | | | |
richardzach.org
|
|
| | | | | Paolo Mancosu, Sergio Galvan, and Richard Zach. An Introduction to Proof Theory: Normalization, Cut-elimination, and Consistency Proofs. Oxford: Oxford University Press, 2021. DOI: 10.1093/oso/9780... | |
| | | | |
nhigham.com
|
|
| | | | | The Cayley-Hamilton Theorem says that a square matrix $LATEX A$ satisfies its characteristic equation, that is $latex p(A) = 0$ where $latex p(t) = \det(tI-A)$ is the characteristic polynomial. This statement is not simply the substitution ``$latex p(A) = \det(A - A) = 0$'', which is not valid since $latex t$ must remain a scalar... | |
| | | | |
almostsuremath.com
|
|
| | | I will give a proof of the measurable section theorem, also known as measurable selection. Given a complete probability space $latex {(\Omega,\mathcal F,{\mathbb P})}&fg=000000$, we denote the projection from $latex {\Omega\times{\mathbb R}}&fg=000000$ by $latex \displaystyle \setlength\arraycolsep{2pt} \begin{array}{rl} &\displaystyle\pi_\Omega\colon \Omega\times{\mathbb R}\rightarrow\Omega,\smallskip\\ &\displaystyle\pi_\Omega(\omega,t)=\omega. \end{array} &fg=000000$ By definition, if $latex {S\subseteq\Omega\times{\mathbb R}}&fg=000000$ then, for every $latex {\omega\in\pi_\Omega(S)}&fg=000000$, there... | ||