Ciro Santilli @cirosantilli  40

Wikipedia mentions quoting his Nobel Prize biography:

A phase of Fe-C characterized by the low ammount of carbon.

Setting: you are sending bits through a communication channel, each bit has a random probability of getting flipped, and so you use some error correction code to achieve some minimal error, at the expense of longer messages.

This theorem sets an upper bound on how efficient you can be in your encoding, for any encoding.

The next big question, which the theorem does not cover is how to construct codes that reach or approach the limit. Important such codes include:

But besides this, there is also the practical consideration of if you can encode/decode fast enough to keep up with the coded bandwidth given your hardware capabilities.

news.mit.edu/2010/gallager-codes-0121 explains how turbo codes were first reached without a very good mathematical proof behind them, but were still revolutionary in experimental performance, e.g. turbo codes were used in 3G/4G.

But this motivated researchers to find other such algorithms that they would be able to prove things about, and so they rediscovered the much earlier low-density parity-check code, which had been published in the 60's but was forgotten, partially because it was computationally expensive.

Like a heat equation but for functions without time dependence, space-only.

TODO confirm: does the solution of the heat equation always converge to the solution of the Laplace equation as time tends to infinity?

In one dimension, the Laplace equation is boring as it is just a straight line since the second derivative must be 0. That also matches our intuition of the limit solution of the heat equation.

Uniqueness: Uniqueness theorem for Poisson's equation.

Besides being useful in engineering, it was very important historically from a "development of mathematics point of view", e.g. it was the initial motivation for the Fourier series.

Some interesting properties:

Sample numerical solutions:

Describes perfect lossless waves on the surface of a string, or on a water surface.

Uniqueness: math.stackexchange.com/questions/1113622/uniqueness-of-solutions-to-the-wave-equation

As mentioned at: math.stackexchange.com/questions/579453/real-world-application-of-fourier-series/3729366#3729366 from solving partial differential equations with the Fourier series citing courses.maths.ox.ac.uk/node/view_material/1720, analogously to the heat equation, the wave linear equation can be be solved nicely with separation of variables.

This important and common simple case has easy properties.

Invertible matrices. Or if you think a bit more generally, an invertible linear map.

When the field $F$ is not given, it defaults to the real numbers.

Non-invertible are excluded "because" otherwise it would not form a group (every element must have an inverse). This is therefore the largest possible group under matrix multiplication, other matrix multiplication groups being subgroups of it.

Is the set of all n-by-y square matrices.

Because $GL(n)$ is a Lie group we can use Section "Lie algebra of a matrix Lie group".

For every matrix $x$ in the set of all n-by-y square matrices $M_n$, $e^x$ has inverse $e^{-}x$.

Note that this works even if $x$ is not invertible, and therefore not in $GL(n)$!

Therefore, the Lie algebra of $GL(n)$ is the entire $M_n$.

Specials sub case of the general linear group when the determinant equals exactly 1.

The group of all transformations that preserve some bilinear form, notable examples: