hehehe

formal system

a formal system describes a formal language for…

1. writing finite mathematical statements
2. have a definition of what statements are true
3. has a definition of a proof of a statement

examples

Every Turing Machine \(M\) defines some formal system \(\mathcal{F}\) such that \(\Sigma^{*}\) string \(w\) represents the statement “\(M\) accepts \(w\)”

• “true statements \(\mathcal{F}\)” is \(L(M)\)
• a proof that \(M\) accepts \(w\) can be defined to be an accepting computation history on \(M\) for \(w\)

interesting

a formal system \(\mathcal{F}\) is “interesting” if:

matricies are like buckets of numbers. ok, ok, seriously:

matricies are a way of encoding the basis of domain proof: that if Linear Maps are determined uniquely by where they map the basis anyways, why don’t we just make a mathematical object that represents that to encode the linear maps.

definition

Let \(n\), \(m\) be positive integer. An \(m\) by \(n\) matrix \(A\) is a rectangular array of elements of \(\mathbb{F}\) with \(m\) rows and \(n\) columns:

If we have some system:

\begin{equation} x’ = Ax \end{equation}

the solution for this system should be \(e^{At}\). This gives rise to, given the power series:

\begin{equation} e^{At} = 1 + At + \frac{1}{2} \qty(At)^{2} + \frac{1}{3!} (At)^{3}+ \dots \end{equation}

the derivative of which:

\begin{align} \dv t e^{At} &= A + A^{2}t + \frac{A^{3}t^{2}}{2} + \dots \\ &= A\qty(1 + At + \frac{A^{2}t^{2}}{2}) \end{align}

This intuition makes sense for all matrices \(A\). Meaning the general solution gives: