Ciro Santilli @cirosantilli 35

GPIO generally only supports discrete outputs.

But for some types of hardware, like LEDs and some motors, the system has some inertia, and if you switch on and off fast enough, you get a result similar to having an intermediate voltage.

So with pulse width modulation we can fake analog output from digital output in a good enough manner.

Their project lead as of 2018 was pro-CCP: github.com/cirosantilli/china-dictatorship/blob/aa1176c57fc2929465294e520b43b50d44e202ba/communities-that-censor-politics.md

The most powerful GUI file manager ever?? Infinite configurability??

Ciro Santilli wasted some time on it before he gave up on file managers altogether.

Like everything else in Lie group theory, you should first look at the matrix version of this operation: the matrix exponential.

The exponential map links small transformations around the origin (infinitely small) back to larger finite transformations, and small transformations around the origin are something we can deal with a Lie algebra, so this map links the two worlds.

The idea is that we can decompose a finite transformation into infinitely arbitrarily small around the origin, and proceed just like the product definition of the exponential function.

The definition of the exponential map is simply the same as that of the regular exponential function as given at Taylor expansion definition of the exponential function, except that the argument $x$ can now be an operator instead of just a number.

Examples:

The main interest of this theorem is in classifying the indefinite orthogonal groups, which in turn is fundamental because the Lorentz group is an indefinite orthogonal groups, see: all indefinite orthogonal groups of matrices of equal metric signature are isomorphic.

It also tells us that a change of basis does not the alter the metric signature of a bilinear form, see matrix congruence can be seen as the change of basis of a bilinear form.

The theorem states that the number of 0, 1 and -1 in the metric signature is the same for two symmetric matrices that are congruent matrices.

For example, consider:

The eigenvalues of $A$ are $1$ and $4$, and the associated eigenvectors are:symPy code:and from the eigendecomposition of a real symmetric matrix we know that:

Now, instead of $P$, we could use $PE$, where $E$ is an arbitrary diagonal matrix of type:With this, would reach a new matrix $B$:Therefore, with this congruence, we are able to multiply the eigenvalues of $A$ by any positive number $e_1^2$ and $e_2^2$. Since we are multiplying by two arbitrary positive numbers, we cannot change the signs of the original eigenvalues, and so the metric signature is maintained, but respecting that any value can be reached.

Note that the matrix congruence relation looks a bit like the eigendecomposition of a matrix:but note that $D$ does not have to contain eigenvalues, unlike the eigendecomposition of a matrix. This is because here $S$ is not fixed to having eigenvectors in its columns.

But because the matrix is symmetric however, we could always choose $S$ to actually diagonalize as mentioned at eigendecomposition of a real symmetric matrix. Therefore, the metric signature can be seen directly from eigenvalues.

Also, because $D$ is a diagonal matrix, and thus symmetric, it must be that:

What this does represent, is a general change of basis that maintains the matrix a symmetric matrix.

Related: