/explore
|
You are here 
|
siddhartha-gadgil.github.io | ||
| | | | |
mattbaker.blog
In my previous post, I presented a proof of the existence portion of the structure theorem for finitely generated modules over a PID based on the Smith Normal Form of a matrix. In this post, I'd like to explain how the uniqueness portion of that theorem is actually a special case of a more general... |
|
| | | | | ||
| | | | |
www.jeremykun.com
The First Isomorphism Theorem The meat of our last primer was a proof that quotient groups are well-defined. One important result that helps us compute groups is a very easy consequence of this well-definition. Recall that if $ G,H$ are groups and $ \varphi: G \to H$ is a group homomorphism, then the image of $ \varphi$ is a subgroup of $ H$. Also the kernel of $ \varphi$ is the normal subgroup of $ G$ consisting of the elements which are mapped to the identity under $ \varphi$. |
|
| | | | | ||
| | | | |
almostsuremath.com
The aim of this post is to motivate the idea of representing probability spaces as states on a commutative algebra. We will consider how this abstract construction relates directly to classical probabilities. In the standard axiomatization of probability theory, due to Kolmogorov, the central construct is a probability space $latex {(\Omega,\mathcal F,{\mathbb P})}&fg=000000$. This consists... |
|
| | | | | ||
| | | | |
dominiczypen.wordpress.com
Let $latex \omega$ denote the first infinite cardinal - that is, the set of non-negative integers. Let $latex p_0 = 2$ be the smallest prime number, and let $latex (p_n)_{n\in\omega}$ enumerate all prime numbers in ascending order. Let $latex \mathcal{U}$ be a free ultrafilter on $latex \omega$. We consider the field $latex F = \big(\prod_{n\in\omega}\mathbb{Z}/p_n\mathbb{Z}\big)/{\mathcal... |
|
| | | |||
