Explore >> Select a destination
|
You are here 
|
www.math3ma.com | ||
| | | | |
www.jeremykun.com
|
|
| | | | | Last time we defined and gave some examples of rings. Recapping, a ring is a special kind of group with an additional multiplication operation that "plays nicely" with addition. The important thing to remember is that a ring is intended to remind us arithmetic with integers (though not too much: multiplication in a ring need not be commutative). We proved some basic properties, like zero being unique and negation being well-behaved. | |
| | | | |
mattbaker.blog
|
|
| | | | | I'm teaching Graduate Algebra this semester, and I wanted to record here the proof I gave in class of the (existence part of the) structure theorem for finitely generated modules over a PID. It's a standard argument, based on the existence of the Smith Normal Form for a matrix with entries in a PID, but... | |
| | | | |
mikespivey.wordpress.com
|
|
| | | | | The Riemann zeta function $latex \zeta(s)$ can be expressed as $latex \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for complex numbers s whose real part is greater than 1. By analytic continuation, $latex \zeta(s)$ can be extended to all complex numbers except where $latex s = 1$. The power sum $latex S_a(M)$ is given by $latex S_a(M) =... | |
| | | | |
francisbach.com
|
|
| | | [AI summary] This technical blog post explores the mathematical properties of symmetric positive definite matrices, specifically focusing on the Löwner order, matrix monotonicity, and matrix convexity in the context of machine learning and optimization. | ||
