<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://fwhitton.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://fwhitton.github.io/" rel="alternate" type="text/html" /><updated>2026-10-19T09:22:05+00:00</updated><id>https://fwhitton.github.io/feed.xml</id><title type="html">Finlay Whitton</title><entry><title type="html">A Note On Notation</title><link href="https://fwhitton.github.io/2026/10/19/A-Note-on-Notation.html" rel="alternate" type="text/html" title="A Note On Notation" /><published>2026-10-19T00:00:00+00:00</published><updated>2026-10-19T00:00:00+00:00</updated><id>https://fwhitton.github.io/2026/10/19/A-Note-on-Notation</id><content type="html" xml:base="https://fwhitton.github.io/2026/10/19/A-Note-on-Notation.html"><![CDATA[<p>Terence Tao has written extensively about the way that good notation can “relieve the brain of all unnecessary work” and “set it free to concentrate on more advanced problems” (<a href="https://terrytao.wordpress.com/advice-on-writing-papers/use-good-notation/">here in his blog</a> and <a href="https://mathoverflow.net/questions/366070/what-are-the-benefits-of-writing-vector-inner-products-as-langle-u-v-rangle">here in an answer on mathoverflow</a>). He argues that the relationship between symbols should respect the relationship between the objects they represent: $u,v,w$ might be vectors in $V$ but if $V=U\oplus W$ then I sure hope $u\in U$ and $w\in W$. In a similar respect, Nick Higham said that a symmetric matrix should be represented by a symmetric letter like $A$ or $M$. While I’m not so convinced by this, I think that only commutative operations should have symmetric symbols. Good examples of this are: $x + y, x\times y, A \cap B,$ and $A \cup B$. There’s a reason I’ll always use $A\setminus B$ instead of $A - B$. When the direction matters, the symbol should reflect this, not the order of writing: $x\le y$ and $A \subset B$ are equivalent to $y\ge x$ and  $B \supset A$ however $x \vert y$ doesn’t indicate a direction. Some other offenders are $x - y$, $dx\wedge dy$ and $a\propto ka$. Worst of all, as 3B1B has pointed out, by using position, a symbol, and a word, we obscure the fact that the following statements convey the same piece of information: $2^3 =8$, ${} \sqrt[3]{8} = 2 {}$, and $\log_{2}(8) = 3$.</p>

<p>What made me think about this is the lack of a symbol which I wish to exist (please put me out of my misery if it already does). We don’t write $A\cup B = B$ or $A\cap B = A$ to say that $A$ is a subset of $B$. While logically correct, we invented a symbol for this common scenario. I would argue that stating whether two sets are disjoint occurs frequently enough to deserve a symbol. In both cases too! If $E\cap F = \emptyset$ then $\mu(E\cup F) = \mu(E) + \mu(F)$ and if $U_i \cap U_j \neq \emptyset$ then the transition map $\phi_{ij}$ should be smooth. I propose a symmetric symbol to denote whether two sets intersect non-trivially: the best I’ve found is $\between$ for ‘non-disjoint’ but I am open to suggestions!</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Terence Tao has written extensively about the way that good notation can “relieve the brain of all unnecessary work” and “set it free to concentrate on more advanced problems” (here in his blog and here in an answer on mathoverflow). He argues that the relationship between symbols should respect the relationship between the objects they represent: $u,v,w$ might be vectors in $V$ but if $V=U\oplus W$ then I sure hope $u\in U$ and $w\in W$. In a similar respect, Nick Higham said that a symmetric matrix should be represented by a symmetric letter like $A$ or $M$. While I’m not so convinced by this, I think that only commutative operations should have symmetric symbols. Good examples of this are: $x + y, x\times y, A \cap B,$ and $A \cup B$. There’s a reason I’ll always use $A\setminus B$ instead of $A - B$. When the direction matters, the symbol should reflect this, not the order of writing: $x\le y$ and $A \subset B$ are equivalent to $y\ge x$ and $B \supset A$ however $x \vert y$ doesn’t indicate a direction. Some other offenders are $x - y$, $dx\wedge dy$ and $a\propto ka$. Worst of all, as 3B1B has pointed out, by using position, a symbol, and a word, we obscure the fact that the following statements convey the same piece of information: $2^3 =8$, ${} \sqrt[3]{8} = 2 {}$, and $\log_{2}(8) = 3$.]]></summary></entry><entry><title type="html">Eigenvalues On A Donut</title><link href="https://fwhitton.github.io/2026/09/02/Eigenvalues-on-a-Donut.html" rel="alternate" type="text/html" title="Eigenvalues On A Donut" /><published>2026-09-02T00:00:00+00:00</published><updated>2026-09-02T00:00:00+00:00</updated><id>https://fwhitton.github.io/2026/09/02/Eigenvalues-on-a-Donut</id><content type="html" xml:base="https://fwhitton.github.io/2026/09/02/Eigenvalues-on-a-Donut.html"><![CDATA[<p>This is the first in a (hopefully) three part series, building up to the Fourier Transform on a (locally compact) abelian group. This first post is purely a motivating example with few technicalities; in later posts we will proceed as per the mathematician’s directive:</p>

<blockquote>
  <p>“Go forth and generalise.”</p>
</blockquote>

<p><a href="https://fwhitton.github.io/2025/03/21/Topology-I-Snake-on-a-Donut.html">This post</a> contains more information abouts donuts (<em>tori</em> herein), but to recap we build one by gluing together the opposite edges of a square:</p>

<p><img src="/assets/images/torus.gif" alt="torus" width="200" /></p>

<p>Functions on the torus naturally arise as functions of two real variables which are periodic in both arguments. The specific functions on the torus that we’re interested in are the solutions to my favourite PDE:</p>

\[-(\partial_x^2 + \partial_y^2) u = \lambda u.\]

<p>Rather than working on the torus, denoted $\mathbb{T}$, it is easier to solve this equation on the square and then ask that the solution is periodic in both $x$ and $y$ with period $1$. Trusty separation of variables yields</p>

\[u_k(x,y) = \exp(2\pi i (k_x x + k_y y))\]

<p>which is an eigenfunction with eigenvalue</p>

\[\lambda = 4\pi^2(k_x^2 + k_y^2).\]

<p>For $u_k(x,y)$ to be periodic we need</p>

\[u_k(x,y) = u_k(x+1,y) = u_k(x,y+1),\]

<p>and by the definition of $u_k$, this means that</p>

\[\exp(2\pi i k_x) = \exp(2\pi i k_y) = 1 \implies k_x,k_y \in \mathbb{Z}.\]

<p>Renaming $k_x = m$ and $k_y = n$, we find that</p>

\[-\Delta u_{m,n} = 4\pi^2 (m^2 + n^2) u_{m,n}.\]

<p>The points $(m,n)\in\mathbb{Z}^2$ form a <em>lattice</em>. Is it a coincidence that the unit square we started out with tiles this lattice? More on that later…</p>

<p>Now we have the eigenfunctions of the Laplacian, the spectral theorem tells us that these form a basis for a friendly bunch of functions on the torus:</p>

\[L^2(\mathbb{T}) = \left\{f:\mathbb{T} \to \mathbb{C} : \int_{\mathbb{T}} |f(x)|^2 \, dx &lt; \infty \right\}.\]

<p>That is, every $f\in L^2(\mathbb{T})$ can be decomposed as</p>

\[f(x) = \sum_{m,n\in\mathbb{Z}} \hat{f}(m,n) u_{m,n}(x,y),\]

<p>where</p>

\[\hat{f}(m,n) = \int_{\mathbb{T}} f(x,y) \exp(2\pi i (mx+ny))\,dxdy.\]

<p>The advantage of the notation $\hat{f}$ over the usual $a_n$ or $c_n$ for a coefficient is to remind us that the coefficient depends directly on the function $f$. While $f$ is a function on $\mathbb{T}$, we’ll see later that $\hat{f}$ is a function on $\hat{\mathbb{T}}$.</p>

<p>Philosophically, the spectral theorem says that the Laplacian on a torus is diagonalisable, in the sense that</p>

\[-\Delta f = 4\pi^2 \sum_{m,n\in\mathbb{Z}} (m^2 + n^2) \hat{f}(m,n) u_{m,n}(x).\]

<p>That’s the end of the example. I hope it’s clear that there is fecund ground for abstraction.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[This is the first in a (hopefully) three part series, building up to the Fourier Transform on a (locally compact) abelian group. This first post is purely a motivating example with few technicalities; in later posts we will proceed as per the mathematician’s directive:]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://fwhitton.github.io/assets/images/torus.gif" /><media:content medium="image" url="https://fwhitton.github.io/assets/images/torus.gif" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Top 7 Types Of Derivative</title><link href="https://fwhitton.github.io/2026/05/22/Top-7-types-of-derivative.html" rel="alternate" type="text/html" title="Top 7 Types Of Derivative" /><published>2026-05-22T00:00:00+00:00</published><updated>2026-05-22T00:00:00+00:00</updated><id>https://fwhitton.github.io/2026/05/22/Top-7-types-of-derivative</id><content type="html" xml:base="https://fwhitton.github.io/2026/05/22/Top-7-types-of-derivative.html"><![CDATA[<p>Welcome to Watchmojo where I’ll be counting down my top 7 favourite types of derivative.</p>

<h2 id="7-ordinary">7. Ordinary</h2>

<p>Got to start where it all started. You’re on a hike and you know what the elevation is at each point but you want to know how steep it is at each point i.e. what is the gradient? This is precisely the question ``What is the (ordinary) derivative of the elevation as a function of distance?”. Alternative to the usual slope interpretation, the derivative also measures the degree to which each point gets stretched or squashed when squeezing the domain into the co-domain.</p>

<h2 id="6-partial">6. Partial</h2>

<p>I can look at how one location and compare how it changed over time: call this history. Alternatively I can look at a fixed point in time and compare different places: call this geography perhaps. What about something like the Roman empire which spread over time: I could follow the path of a Roman legion as it moves through space and time and measure something along its path: this would be called a directional derivative. As I said in the post on <strong>partial</strong> differential equations, <em>most things depend on more than one thing</em> and so it’s important we know how something responds to changes in the various things it depends on.</p>

<h2 id="5-material">5. Material</h2>

<p>Imagine a bear sitting on the bank of a river with a fishing rod. It looks at the river and wonders how fast it’s flowing at each point. It could take a snapshot in time and look at how the flow of the river changed from point to point. It could also look at a point in the flow and see how the flow changes over time, say by attaching a detector to the river bed. However this is only one perspective (called the Eulerian one). If I were a fish being carried along in the flow, hoping to avoid the bear’s fishing rod, (whaling, fishing, crabbing are the only examples I can think of where turning an animal’s name into a verb means to hunt that animal) I would experience speeding up, slowing down and changing direction. This is a more natural way to phrase the laws of fluid mechanics. A point that is carried along in the flow is affected by its neighbouring points which are carried along in the same flow. This idea is encapsulated by the material derivative. I talk about this in more depth in my Navier-Stokes post.</p>

<h2 id="4-weak">4. Weak</h2>

<p>Suppose I want to loosen the sense of what it means for a function to have a derivatve. I can only differentiate some functions but I can integrate <em>way</em> more functions. Therefore it makes sense to ask for functions that satisfy conditions in integrals: integrals are blind to finite sets of points (and even sets of measure zero) and so is more lenient to functions with pesky discontinuities in their derivative like the absolute value $f(x) =\mid x\mid$. The way we phrase this is that a function is weakly differentiable if we can do integration by parts on it. Specifically, $u$ has weak derivative $v$ if for all smooth functions $\phi$,</p>

\[\int u(x)\phi'(x) = -\int v(x)\phi(x).\]

<p>A small problem: by broadening the class of possible solutions to an equation, we’ve exchanged uniqueness for existence. Two different functions can satisfy the above condition which disagree on a set of measure zero. The boundary of a domain is a set of measure zero so what does it even mean for a weak solution to satisfy a boundary condition?</p>

<h2 id="3-radon---nikodym">3. Radon - Nikodym</h2>

<p>I want to assign sizes to parts of a material in a consistent way. Two possible ways for me to do this are by measuring the volume or the mass of a chunk. Volume might seem like the natural choice but mass is just as good and they are related by the fact that if I know the density of the material (a positive function) $\rho$ then the mass of a subset, denoted $M(E)$, is related to the volume of that subset, denoted $V(E)$, by</p>

\[m(E) = \int_E \rho dV.\]

<p>So in a sense we can build new measures (ways of assigning size to sets) out of old ones using a density function. The Radon-Nikodym theorem goes the other way and states that if I have two measures $\mu$ and $\nu$ with the property that $\nu(E)$ is $0$ whenever $\mu(E)$ is $0$ (specifically $\nu$ is absolutely continuous with respect to $mu$ which is written $\nu \ll \mu$) then there is a non-negative density function $f$ so that</p>

\[\mu(E) = \int_E f d\nu\]

<p>and the density is called the Radon-Nikodym derivative and denoted $f = \frac{d\mu}{d\nu}$.</p>

<h2 id="2-exterior">2. Exterior</h2>

<p>The ordinary derivative, the gradient of a function and the curl of a vector field are all examples of the exterior derivative. This is a huge generalisation of familiar derivatives and some of our favourite facts from calculus are just examples of powerful theorems in differential geometry. If the exterior derivative is denoted $d$ then the fundamental theorem of calculus, Stokes theorem and the divergence theorem are all just examples of the fact</p>

\[\int_{ C} d\alpha = \int_{\partial C} \alpha.\]

<p>Furthermore, facts like ‘the curl of a gradient vanishes’ and ‘the divergence of a curl is zero’ are special cases of the succinct fact</p>

\[d^2 = 0\]

<p>(as an operator).</p>

<h2 id="1-covariant">1. Covariant</h2>

<p>“A tensor is something that transforms like a tensor” is a horrible description but I don’t have much better. General relativity seeks descriptions of a physical system which are independent of the observer making the description. Changes in perspective between observers manifests as coordinate transformations so we would like to keep track of how quantities change under coordinate transformations so that we’re all measuring the same things. The gradient of a function is a tensor because if I scale my coordinate system in some way then by the chain rule the gradient will scale by some overall factor. But if I take the gradient of a tensor rather than a function and I change coordinates then the tensor will pick up a factor but the gradient is now acting on a product so I get a sum of terms. This is <strong>not</strong> how a tensor transforms and so our typical partial derivatives can’t define a tensor. Thankfully we can define a new tensor by subtracting off that extra term that comes out of the product rule to construct something that <strong>does</strong> transform like a tensor: the covariant derivative. And this is what allows us to take derivatives in relativity and thus express some pretty important laws.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[Welcome to Watchmojo where I’ll be counting down my top 7 favourite types of derivative.]]></summary></entry><entry><title type="html">Sums Of Squares For Kids</title><link href="https://fwhitton.github.io/2026/05/21/Sums-Of-Squares-for-kids.html" rel="alternate" type="text/html" title="Sums Of Squares For Kids" /><published>2026-05-21T00:00:00+00:00</published><updated>2026-05-21T00:00:00+00:00</updated><id>https://fwhitton.github.io/2026/05/21/Sums-Of-Squares-for-kids</id><content type="html" xml:base="https://fwhitton.github.io/2026/05/21/Sums-Of-Squares-for-kids.html"><![CDATA[<p>This post arose out of an extended conversation I had with my 13 year old sister. By the end of the conversation she was able to determine which numbers could be written as a sum of squares (SoS) (e.g. $5 = 2^2 + 1^2$, $13 = 3^2 + 2^2$) and which numbers could not (e.g. $3$, $6$) based off some principles I had demonstrated only through the medium of examples. <em>a priori</em> we have no better method than trial and error: is $1079$ a SoS? My best bet is subtracting off all $32$ squares less than $1079$ and seeing whether a square remains. We would like to develop a method which is more robust and hopefully even explains <em>why</em> a number can or cannot.</p>

<p>We begin with a fact so fundamental it is called the fundamental theorem of arithmetic:</p>

<blockquote>
  <p><strong>(1)</strong> Every number can be written, in a unique way, as a product of prime numbers.</p>
</blockquote>

<p>This is taught as factor trees e.g. $48 = 3 \times 16= 3\times 2^4$, $49 = 7^2$, $50 = 2\times 5^2$. Now for another fact</p>

<blockquote>
  <p><strong>(2)</strong> If two numbers can both be written as a SoS then their product can also be written as a sum of squares</p>
</blockquote>

<p>for examaple,:  $5 = 2^2 + 1^2$, $13 = 3^2 + 2^2$, $5\times 13 = 65 = 8^2 + 1^2 = 7^2 + 4^2$. Notice that I haven’t actually told you how we find the sum of squares of $65$ from the sums of squares of $5$ and $13$, only that it’s possible. A formula exists (Brahamgupta’s) but I won’t include it lest this post stops being kid friendly. The first two facts mean that we can work out which prime numbers are SoS because if all a number’s prime factors are SoS then the number must be too.</p>

<blockquote>
  <p><strong>(3)</strong> Every prime number (other than $2$) has remainder $1$ or $3$ when divided by $4$</p>
</blockquote>

<p>e.g. $3,7,11,19$ are all remainder $3$ and $5,13,17$ are all remainder $1$. If a number had remainder $0$ it’d be a multiple of $4$ so wouldn’t be prime and if it had remainder $2$ then it’d be even. Notice that just because a number has remainder $1$ that doesn’t make it prime e.g. $9 = 4\times 2 + 1 = 3^2$. From now on ‘remainder $1$’ and ‘remainder $3$’ always mean ‘when divided by $4$’.</p>

<blockquote>
  <p><strong>(4a)</strong> A prime number that is remainder $1$ can be written as a SoS</p>
</blockquote>

<blockquote>
  <p><strong>(4b)</strong> A prime number that is remainder $3$ cannot be written as a SoS</p>
</blockquote>

<blockquote>
  <p><strong>(4c)</strong> $2$ is the only prime number which is remainder $2$ and can be written as $2 = 1^2 + 1^2$.</p>
</blockquote>

<p>I have to mention that it is easy to prove the contrapositive of <strong>(4b)</strong> but the proof of <strong>(4a)</strong> requires Legendre symbols. Using the first four facts we can now partially answer whether a number <em>can</em> be written as a SoS. e.g. $325 = 5\times 65 = 5\times 5\times 13$ and $5$ and $13$ are both prime numbers which are remainder $1$ so by fact <strong>(4a)</strong> they can be written as a SoS and then by fact <strong>(2)</strong> $325$ can be too because it is a product of numbers that can and indeed $325 = 18^2 + 1^2 = 15^2 + 10^2$. On the other hand e.g. $39 = 3\times 13$ and can’t be written as a sum of squares. However $45 = 3^2 \times 5$ which can be written as a sum of squares ($45 = 6^2 + 3^2$) even though it has a prime factor which is remainder $3$ so our current method can tell us which numbers can be written as SoS but it is not yet able to tell us whether a number cannot be written as a SoS.</p>

<blockquote>
  <p><strong>(5)</strong> If a number can be written as a SoS then that number multiplied by a square number can still be written as a sum of squares.</p>
</blockquote>

<p>e.g. $5 = 2^2 + 1^2$ and $45 = 3^2 \times 5 = 3^2(2^2 + 1^2) = 3^2\times 2^2 + 3^2 \times 1^2= (3\times 2)^2 + (3\times 1)^2 = 6^2 + 3^2$.</p>

<p>A number which is a product of prime numbers which are remainder $1$ can be written as as sum of squares and multiplying by a square number or a power of $2$ doesn’t change whether a number can be written as a sum of squares. Now we have all the pieces.</p>

<blockquote>
  <p><strong>(6)</strong> A number can be written as a SoS if and only if when decomposed into prime factors, all the primes which are remainder $3$ multiply together to make a square number.</p>
</blockquote>

<p>Finally, some examples</p>
<ol>
  <li>$234 = 2\times 13 \times 3^2 = (1^2 +1^2)\times (3^2 + 2^2) \times 3^2 = (5^2 + 1^2) \times 3^2 = 15^2 + 3^2$ so $13$ is a remainder $1$ prime and multiplying by a power of $2$ and a square number doesn’t change the fact that it can be written as a SoS.</li>
  <li>$40 = 8\times 5 = 2^2 (2 \times 5) = 2^2(1^2+1^2)(2^2 + 1) = 2^2(3^2 + 1^2) = 6^2 + 2^2$</li>
  <li>$25 = 5 \times 5 = (2^2+ 1^2)(2^2 +1^2) = 3^2 + 4^2$</li>
  <li>$98,000 = 98 \times 10^3 = 2\times 7^2 \times 2^3 \times 5^3 = 5 \times (7\times4\times 25)^2 = 5\times 700^2 = (2^2 + 1^2)\times 700^2 = 1400^2 + 700^2$</li>
</ol>]]></content><author><name></name></author><summary type="html"><![CDATA[This post arose out of an extended conversation I had with my 13 year old sister. By the end of the conversation she was able to determine which numbers could be written as a sum of squares (SoS) (e.g. $5 = 2^2 + 1^2$, $13 = 3^2 + 2^2$) and which numbers could not (e.g. $3$, $6$) based off some principles I had demonstrated only through the medium of examples. a priori we have no better method than trial and error: is $1079$ a SoS? My best bet is subtracting off all $32$ squares less than $1079$ and seeing whether a square remains. We would like to develop a method which is more robust and hopefully even explains why a number can or cannot.]]></summary></entry><entry><title type="html">Derivatives and linearity</title><link href="https://fwhitton.github.io/2026/05/20/Derivatives-and-linearity.html" rel="alternate" type="text/html" title="Derivatives and linearity" /><published>2026-05-20T00:00:00+00:00</published><updated>2026-05-20T00:00:00+00:00</updated><id>https://fwhitton.github.io/2026/05/20/Derivatives-and-linearity</id><content type="html" xml:base="https://fwhitton.github.io/2026/05/20/Derivatives-and-linearity.html"><![CDATA[<p>I’d like to share three examples where I was pleasantly surprised by the interplay of derivatives and linearity.</p>

<h1 id="differentiation-as-a-matrix">Differentiation as a matrix</h1>
<p>One of the first things we learn about differentiation is that it is <em>linear</em>, which is something we end up using reflexively. If I ask you to differentiate $ex^2 + \pi x + \gamma$ then it doesn’t matter that this is a quadratic I’m sure you’ve never seen before: it’s a linear combination of functions you <em>do</em> know how to differentiate and so it poses no problem. More formally, differention is a linear map from functions with one continuous derivative to continuous functions, i.e. $D:C^1(\mathbb{R})\rightarrow C(\mathbb{R})$. And we know that, after we’ve picked a basis, linear maps on vector spaces can be represented by matrices. Unfortunately $C^1(\mathbb{R})$ doesn’t have a nice basis for me to work with so I’m going to restrict my attention to the vector spaces of polynomials. The monomials (shouldn’t it be mononomials?) form a nice basis for the polynomials and we know that the columns of a matrix in a basis are just the images of the basis elements under that map. Because $D:1\mapsto 0$, $D:x\mapsto 1$, $D:x^2\mapsto 2x$ i.e. derivatives reduce the order of a monomial by one, the matrix has non-zero entries only on the superdiagonal:</p>

\[D=
\begin{pmatrix}
0 &amp; 1 &amp; 0 &amp; 0 &amp;\cdots\\
0 &amp; 0 &amp; 2 &amp; 0 &amp;\cdots\\
0 &amp; 0 &amp; 0 &amp; 3 &amp;\cdots \\
\vdots &amp; \vdots &amp; \vdots &amp; \vdots &amp; \ddots
\end{pmatrix}\]

<p>By writing differentiation as a matrix we can study ODEs using techniques from linear algebra. When I first saw this in my first term of undergrad it blew my mind: calculus is curvy and linear algebra is straight and never the twain shall meet. But little did I know this was the beginning of a very happy marriage with a healthy baby called function spaces.</p>

<h1 id="pdes-as-bilinear-forms">PDEs as bilinear forms</h1>

<p>Fast-forward 3 years and I’ve studied a bit of PDEs and some Hilbert spaces. Taking my Poisson’s equation on a domain $\Omega$</p>

\[\begin{cases}
-\nabla^2 u = f &amp; x\in\Omega\\
u=0 &amp; x\in\partial\Omega,
\end{cases}\]

<p>if we multiply by any test function (compactly supported and infinitely differentiable) $\phi$ and integrate over $\Omega$ we can use integration by parts to move a derivative from $u$ to $\phi$ to find</p>

\[\int_\Omega \nabla \phi \cdot \nabla u dx =  \int_\Omega \phi f dx\]

<p>Any eigenfunction satisfies this equation but we’ve now formulated it in a way that only asks $u$ to have one derivative. Thus we can loosen the sense in which we ask a function to be an solution: a <em>weak solution</em> of Poisson’s equation is one that satisfies the above equation for all $\phi\in C^\infty_C(\Omega)$. As with any PDE we would like to know about the existence and uniqueness of a solution. If we define the <em>bilinear form</em> associated to the Laplacian by</p>

\[B[u,v] =  \int_\Omega \nabla u \cdot \nabla v dx\]

<p>then the weak form of Poisson’s equation is asking for a $u$ such that</p>

\[B[u,v] = (f,v)\]

<p>for all $v$, where $(\cdot,\cdot)$ denotes the $L^2$ inner product. Fortunately this is the content of the Lax-Milgram theorem, which guarantees existence and uniqueness of a $u$ given some constraints (boundedness and coercivity) on $B$. Of course I haven’t addressed which Hilbert space we’re working in for this to make sense (it’s a Sobolev space) but it’s clear that the theory of PDEs cannot stand alone without the support of vector space methods.</p>

<h1 id="derivatives-are-linear-maps">Derivatives are linear maps</h1>
<p>I am not just saying that <em>differentiation</em> is a linear map: I am also saying the output, a derivative, is itself a linear map. For functions of one variable this is subtle. The derivative evaluated at a point gives the ‘slope’ of the curve at that point which is just a number. Of course in one dimension a linear map is specified by a single number so at this resolution we cannot distinguish. However when we move up to functions of more variables the derivative is the gradient $\nabla f = (\partial_1 f, \partial_2 f,\cdots,\partial_n f)$. If I evaluate this at point $\mathbf{x_0}$ then $\nabla f(\mathbf{x_0})$ is a fixed vector and defines a linear map by acting on a unit vector $\mathbf{n}$ via $\nabla f(\mathbf{x_0}) \cdot \mathbf{n}$ to tell us the rate of change of the function $f$ in the direction $\mathbf{n}$ at the point $\mathbf{x_0}$. Thus when evaluated at the point $\mathbf{x_0}$, $\nabla f(\mathbf{x_0})$ belongs to the dual space of $\mathbb{R}^n$. Differential geometry generalises the hell out of this but we’ll only give the definition that a $0$-form is just a smooth function and a $1$-form is a smooth map from an open set in a vector space (like the domain of our function $f$) to the dual space of that vector space. Given a basis of $\mathbb{R}^n$ like $e_1,e_2,\cdots,e_n$ there is a dual basis $e_1^* ,\cdots,e_n^* $ such that $e_i^* (e_j) = \delta_{ij}$ and we can write the derivative in this basis as</p>

\[df = \sum_i \frac{\partial f}{\partial x_i} e_i^*
.\]]]></content><author><name></name></author><summary type="html"><![CDATA[I’d like to share three examples where I was pleasantly surprised by the interplay of derivatives and linearity.]]></summary></entry><entry><title type="html">Three Proofs of The Infinitude of the Primes</title><link href="https://fwhitton.github.io/2025/11/04/Three-Proofs-of-The-Infinitude-of-the-Primes.html" rel="alternate" type="text/html" title="Three Proofs of The Infinitude of the Primes" /><published>2025-11-04T00:00:00+00:00</published><updated>2025-11-04T00:00:00+00:00</updated><id>https://fwhitton.github.io/2025/11/04/Three%20Proofs%20of%20The%20Infinitude%20of%20the%20Primes</id><content type="html" xml:base="https://fwhitton.github.io/2025/11/04/Three-Proofs-of-The-Infinitude-of-the-Primes.html"><![CDATA[<p>A friend recently asked me “Have you seen the topological proof that there are infinitely many primes?” and I’m possibly in sparse company being excited by this sentence. It reminded me that I’d seen another insanely overpowered proof that there are infinitely many primes a while ago and so I’d like to present both of these along with Euclid’s megaclassic proof.</p>

<p>Paul Erdős, the most published mathematician of all time, though agnostic, referred to god as the Supreme Fascist and believed that he held a book of the perfect proof of every theorem in maths. He would exclaim “This one’s from The Book” when he saw a particularly elegant proof and the first of our proofs is undoubtedly one of these.</p>

<p>Suppose, for contradiction, that there are a finite number of primes. I’m going to consider the resulting number when I multiply all these finitely many primes together and add 1. This new number is not divisible by any of the primes. Indeed it leaves remainder 1 when divided by any prime, and so its only factors can be itself and 1, meaning I’ve generated a new prime. This contradicts the assumption that I could collect the finitely many primes. This proof is certainly from the book. But why stop there?</p>

<p>Goldilocks stumbled across that proof and decided it didn’t require enough machinery. She tried the next one out for size.</p>

<p>The Riemann zeta function is a bit of a holy grail in mathematics, its zeros having a million dollar bounty, but we can still handle it with elementary methods. The harmonic series (the subject of the sequel to the ant on the rope post) and the Basel problem are both examples of the Riemann zeta function:</p>

\[1 + \frac12 + \frac13 + \cdots = \infty\]

\[\frac1{1^2} + \frac1{2^2} + \frac1{3^2} + \cdots = \frac{\pi^2}{6}\]

<p>We can generalise the exponent in the sum and define the so-called Riemann zeta function:</p>

\[\zeta(s) = \sum_{n=1}^\infty \frac{1}{n^s} = \frac{1}{1^s} + \frac1{2^s} + \frac{1}{3^s}\]

<p>There is an intimate link between this sum and the prime numbers. Consider the following method, analogous to the sieve of Eratosthenes. Multiply the sum by $1/2^s$ so that every denominator picks up a factor of $2$:</p>

\[\frac{1}{2^s} \zeta(s) = \frac{1}{2^s} + \frac{1}{4^s} + \frac{1}{6^s}\]

<p>If we subtract this from the original sum then we remove all the even terms so we find</p>

\[\Big(1-\frac{1}{2^s}\Big)\zeta(s) = \frac{1}{1^s}+\frac{1}{3^s}+\frac{1}{5^s}+\cdots\]

<p>Now we do the same multiplying by $1/3^s$:</p>

\[\frac{1}{3^s}\Big(1-\frac{1}{2^s}\Big)\zeta(s) = \frac{1}{3^2}+\frac{1}{9^s}+\frac{1}{15^s}+\cdots\]

<p>And subtracting this removes all denominators with a factor of 3:</p>

\[\Big(1-\frac{1}{3^s}\Big)\Big(1-\frac{1}{2^s}\Big)\zeta(s) = \frac{1}{1^s}+\frac{1}{5^s}+\frac{1}{7^s}+\cdots\]

<p>If we proceed with each prime then we remove every term in the sum except for 1</p>

\[\Big(1-\frac{1}{3^s}\Big)\Big(1-\frac{1}{2^s}\Big)\cdots\zeta(s) = 1\]

<p>Dividing and using some compact notation gives the prime product formula for the Riemann zeta function:</p>

\[\zeta(s) = \prod_{p \text{ prime}}\frac{1}{1-\frac{1}{p^s}}\]

<p>This is in fact more detail than we needed but I wanted to keep $s$ general to show why we might care about the Riemann Zeta function. If we evaluate at $s=1$ then we get the harmonic series which blows up to infinity:</p>

\[\zeta(1) = 1 + \frac{1}{2} + \frac13 + \cdots = \infty = \prod_{p \text{ prime}}\frac{1}{1-\frac{1}{p}}\]

<p>But if the right hand side were a finite product it would have a finite value which would be a contradiction, hence there are infinitely many primes.</p>

<p>Goldilocks felt this was overkill. She tried out the following proof, hoping to strike a nice middle ground. We can define a topology on the integers whereby the open sets are generated by arithmetic sequences:</p>

\[S(a,b) = \{a+bn : n \in \mathbb{Z}\}\]

<p>We can show that in this topology all open sets are closed. If I remove an arithmetic sequence from the integers then I can split what remains into shifted arithmetic sequences with the same common difference:</p>

\[\mathbb{Z} \setminus S(a,b) = \bigcup_{m = 1}^{b-1} S(a+m,b)\]

<p>Taking complements shows that all open sets are also closed. Now we consider the following equation which says that every integer has a prime factor except for 1 and -1:</p>

\[\bigcup_{p\text{ prime}} S(0,p) = \mathbb{Z}\setminus\{1,-1\}\]

<p>If there were finitely many primes then the left-hand side would be closed as a finite union of closed sets, however that would mean ${1,-1}$ was an open set which it is not. Therefore there cannot be finitely many primes. Goldilocks thought this proof was just right.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[A friend recently asked me “Have you seen the topological proof that there are infinitely many primes?” and I’m possibly in sparse company being excited by this sentence. It reminded me that I’d seen another insanely overpowered proof that there are infinitely many primes a while ago and so I’d like to present both of these along with Euclid’s megaclassic proof.]]></summary></entry><entry><title type="html">Why is it called Spectral Theory?</title><link href="https://fwhitton.github.io/2025/10/03/Why-is-it-called-Spectral-Theory.html" rel="alternate" type="text/html" title="Why is it called Spectral Theory?" /><published>2025-10-03T00:00:00+00:00</published><updated>2025-10-03T00:00:00+00:00</updated><id>https://fwhitton.github.io/2025/10/03/Why%20is%20it%20called%20Spectral%20Theory</id><content type="html" xml:base="https://fwhitton.github.io/2025/10/03/Why-is-it-called-Spectral-Theory.html"><![CDATA[<p>When I meet other PhD students and the unavoidable question ‘What area of research are you in?’ is asked, my answer varies between ‘Analysis’, ‘Partial differential equations’, ‘Laplacian eigenvalues’ and ‘Spectral theory’. For now I’m sticking with the latter. But to someone who has never studied maths (and to many who have), it’s not at all clear from the name what spectral theory entails.</p>

<p>To begin with, what actually is a spectrum? The word comes from the Latin <em>specere</em> meaning to view and so a spectrum is an image. Originally this was the term given to the band of light which has been split by a prism; the term was later extended beyond visible wavelengths to the entire electromagnetic spectrum and later loosened to just mean the entire range, such as the autistic spectrum.</p>

<p>When heated, each element emits specific wavelengths of light. These wavelengths of light are like a fingerprint, uniquely identifying the element (the identification is called spectroscopy). In fact this is how Helium got its name: an unknown spectral line was detected during an eclipse.</p>

<p><img src="/assets/images/spectrum.png" alt="spectrum" width="300" /></p>

<p>Let’s look at the spectrum of the Hydrogen. Hydrogen is a fairly simple quantum system, consisting of an electron orbiting a proton. It was Max Planck who realised that the electron can only orbit at certain distances from the nucleus and so requires ‘packets’ energy (or <em>quanta</em>) to move between levels. Thus when an electron drops down a level it emits a photon with a particular amount of energy and the amount of energy is related (inversely proportionally) to the wavelength of emitted light. The gaps between energy levels are different, explaining why there are different wavelengths in the spectrum.</p>

<p>For a better idea of why the electron can only orbit at certain distances from the orbit, we need to remember that an electron is both a particle and a wave. This wave is wrapped around the nucleus so must oscillate some whole number of times in order to match up. The further away the electron sits, the more oscillations can be fit around its orbit. This can also be thought of as the quantisation of angular momentum.</p>

<p>But I don’t study electrons, I study functional analysis so how are quantum systems related to analysis? In quantum mechanics we treat quantities like energy and momentum no longer as numbers but as operators (in reality this involves putting a hat on a quantity like the position $x$ to make it an operator $\hat{x}$). Specifically, observable quantities are represented by Hermitian, linear operators. For the sake of simplicity we can think of them as matrices and when we make a measurement, for example an energy measurement, we can only get an eigenvalue of the matrix which corresponds to the energy of the system. Now it becomes very important to understand the eigenvalues of operators and especially those which correspond to physical observables.</p>

<p>Returning to the example of light, we can write down concretely the operator corresponding to the energy of an electron orbiting a proton and we can find its eigenvalues. Not every value can be an eigenvalue: the spectral theorem states that the spectrum of a (self-adjoint, compact, linear) operator is discrete so contains a countable sequence of values and QM tells us that the differences between them are the energies of photons which are emitted when electrons move between energy levels.</p>

<p>While the name only refers to light, the applications of spectral theory are much broader. Often we can cast a partial differential equation, for example the time independent Schrodinger equation, the heat equation or the wave equation, as an eigenvalue problem and employ the tools of spectral theory to synthesise the problem.</p>

<p>Aside 1: while writing this I realised that not a single common quantity has an operator which begins with the same letter: energy gets H, position gets x, momentum gets p and angular momentum gets L.</p>

<p>Aside 2, for those inclined:  spectral theory in finite dimensional vector spaces is a little dull. We form the characteristic polynomial for a matrix and by the fundamental theorem of algebra we are guaranteed n roots, counted with multiplicity. Things get far more interesting in the infinite dimensional case: lets examine the equation $(T- \lambda I)x = 0$ a little more closely. In finite dimensions we have a theorem about when this equation has a non-trivial solution: precisely when the map $T-\lambda I$ has determinant 0. But in infinite dimensions we have no such criteria as to when the map $T-\lambda I$ is not invertible: not being bijective entails failing to be injective or surjective. In finite dimensions these concepts are equivalent but no longer. As a result we define firstly the resolvent set:</p>

\[\rho(T) = \{ \lambda \in \mathbb{C} : T - \lambda I\text{ is bijective}\}\]

<p>and the complement of the resolvent set in the complex numbers is the spectrum. Specifically if the map $T-\lambda I$ is not injective then there is a non-zero $x$ such that $(T-\lambda I)x = 0$, precisely the statement that $x$ is an eigenvector. The spectrum contains eigenvalues but also other points which only appear in infinite dimensional spaces, called the residual and continuous spectra. Further reading is left for the curious reader.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[When I meet other PhD students and the unavoidable question ‘What area of research are you in?’ is asked, my answer varies between ‘Analysis’, ‘Partial differential equations’, ‘Laplacian eigenvalues’ and ‘Spectral theory’. For now I’m sticking with the latter. But to someone who has never studied maths (and to many who have), it’s not at all clear from the name what spectral theory entails.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://fwhitton.github.io/assets/images/spectrum.png" /><media:content medium="image" url="https://fwhitton.github.io/assets/images/spectrum.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Misuses of Probability in Legal Cases</title><link href="https://fwhitton.github.io/2025/07/07/Misuses-of-Probability-in-Legal-Cases.html" rel="alternate" type="text/html" title="Misuses of Probability in Legal Cases" /><published>2025-07-07T00:00:00+00:00</published><updated>2025-07-07T00:00:00+00:00</updated><id>https://fwhitton.github.io/2025/07/07/Misuses%20of%20Probability%20in%20Legal%20Cases</id><content type="html" xml:base="https://fwhitton.github.io/2025/07/07/Misuses-of-Probability-in-Legal-Cases.html"><![CDATA[<h1 id="oj-simpson">O.J. Simpson</h1>
<p>In 1995 O.J. Simpson was acquitted of the murder of his ex-wife Nicole Brown and her friend Ronald Goldman. During the trial, it was accepted that Simpson had been violent towards Brown when they were married. The defence argued that only 1 in 2500 women who experience spousal abuse are murdered by their partner and so the probability Simpson murdered Brown was low. However, this is a gross misuse of conditional probability.</p>

<p>For concreteness, imagine 100,000 women who are victims of domestic violence. Before Brown was killed, it is true that the probability she would be killed by Simpson was 40/100,000 = 1/2500. However the Bayesian framework tells us that once we learn of her murder, we must update our probability: no longer is she one of 100,000 victims of domestic abuse but she is now one of the 45 women who are victims of domestic abuse and have been murdered. Of those 45 women, 40 are killed by their partner and so the correct probability is 40/45, not the proposed 40/100,000.</p>

<p><img src="/assets/images/OJ.png" alt="probabilities" width="200" /></p>

<h1 id="sally-clark">Sally Clark</h1>

<p>Sally Clark, a British solicitor, was accused in 1998 of murdering both her children at 11 weeks and 8 weeks old respectively. The prosecution asserted that the probability of 2 children suffering from Sudden Infant Death Syndrome (SIDS) was 1 in 73 million, a figure they found by taking the underlying population rate and squaring it. The tacit assumption here was that the events were independent. As all A level students know, and many of us intuitively understand, if two events are independent then the probability of them both occurring is the product of their individual probabilities. In this case this was a baseless assumption given there is a genetic predisposition to SIDS.</p>

<p>Clark was convicted but the ruling was later overturned when it was revealed that the prosecution forensic pathologist had withheld exculpatory evidence. The case caused hundreds of similar cases to be re-examined and as a result two other women had their convictions overturned.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[O.J. Simpson In 1995 O.J. Simpson was acquitted of the murder of his ex-wife Nicole Brown and her friend Ronald Goldman. During the trial, it was accepted that Simpson had been violent towards Brown when they were married. The defence argued that only 1 in 2500 women who experience spousal abuse are murdered by their partner and so the probability Simpson murdered Brown was low. However, this is a gross misuse of conditional probability.]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://fwhitton.github.io/assets/images/OJ.png" /><media:content medium="image" url="https://fwhitton.github.io/assets/images/OJ.png" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">Topology I: Snake on a Donut</title><link href="https://fwhitton.github.io/2025/03/21/Topology-I-Snake-on-a-Donut.html" rel="alternate" type="text/html" title="Topology I: Snake on a Donut" /><published>2025-03-21T00:00:00+00:00</published><updated>2025-03-21T00:00:00+00:00</updated><id>https://fwhitton.github.io/2025/03/21/Topology%20I:%20Snake%20on%20a%20Donut</id><content type="html" xml:base="https://fwhitton.github.io/2025/03/21/Topology-I-Snake-on-a-Donut.html"><![CDATA[<p>I’m of the age where my first phone housed only one game, snake. Snake is played in a rectangular world: if you try to escape out of one edge you are teleported to the opposite edge. It seems that modern iterations of the game have hardened the boundaries of the square, subverting my entire post but cast your mind back to when snake looked like this:</p>

<p><img src="/assets/images/phone.jpg" alt="phone" width="200" /></p>

<p>In some sense we can think about one edge being the <em>same edge</em> as the opposite edge. In 2 dimensions the only way to visualise this is with the snake crossing one edge to come back out the other side but thankfully we have access to 3 dimensions. I can glue one pair of edges together to form a cylinder and then glue the circular ends of the cylinder together to form a doughnut shape, called a <em>torus</em>.</p>

<p><img src="/assets/images/torus.gif" alt="torus" width="200" /></p>

<p>And so <a href="https://tennessine.co.uk/snake-on-a-torus/">this game</a> which allows you to play snake on a torus and claims to be a fun spin off is in fact identical to the original game.</p>

<p><img src="/assets/images/torussnake.png" alt="snakeonadonut" width="200" /></p>

<p>Importantly, the square was 2 dimensional and so is the torus. When I talk about the torus I really mean the surface of the hollow doughnut, not the inside. Think of an inflatable ring for swimming rather than a bagel.</p>

<p>Having seen that a torus is a rectangle with its edges identified you can hopefully appreciate that its relatively easy to find the frequencies that can emanate from a torus-shaped drum - just find the frequencies that can exist on a rectangular drum and impose periodic boundary conditions.</p>

<p>Topology is an area of maths often referred to as rubber-sheet geometry. In geometry we can define quadrilaterals as a class of shapes without caring about their area, side lengths, or angles: only that they have 4 edges. Topology further relaxes the constraints required for two shapes to belong to the same class. In topology we say that two shapes are the same (homeomorphic) if they can be continuously defomed into one another, without any cutting or gluing. For an amazing introduction to topology I direct you to Vsauce’s <a href="https://www.youtube.com/watch?v=egEraZP9yXQ">‘How many holes does a human have’</a>.</p>

<p><img src="/assets/images/cow.gif" alt="cow" width="200" /></p>

<p>Quite quickly it becomes clear that most shapes we distinguish geometrically (cubes, stellated polyhedra, cows) are all topologically homemorphic to the sphere. Topology is the search for quantities which remain unchanged by continuous deformations (topological invariants). We can use these invariants to determine whether two shapes are homeomorphic or not without finding an explicit transformation between them or, even more difficult, showing that no such transformation exists.</p>

<p>It is a powerful result (the Classification theorem) that every (orientable, compact, connected, boundary-less) surface can be classified simply by the number of holes it has (its genus) and so the torus is the ‘simplest’ shape which isn’t homeomorphic to a sphere - it has just 1 hole. After a donut we have a pair of handcuffs and a fidget spinner.</p>

<p><img src="/assets/images/genus2.png" alt="genus2" width="200" /><img src="/assets/images/genus3.png" alt="genus3" width="200" /></p>

<p>One fundamental difference between the sphere and the torus is that the latter is not simply connected. If I take a loop on the surface of a sphere, I can shrink it (staying on the surface) to a point on the sphere. Pretty quickly I can image a loop on the surface of a torus which can’t be shrunk to a point on the surface: it “gets caught on the hole”.</p>

<p><img src="/assets/images/simplyconnected.png" alt="sphere" width="200" />
<img src="/assets/images/notsimplyconnected.png" alt="torus" width="200" /></p>

<p>Our construction of the torus involving gluing the edges of a square together can be phrased a little more algebraically. We can define an equivalence relation on $\mathbb{R}$ by identify points with the same decimal part, or that differ by an integer. Then every equivalence class has a representative in the interval $[0,1)$, where $1$ and $0$ are identified, so the quotient of $\mathbb{R}$ by $\mathbb{Z}$ is isomorphic to the circle. What about points in the Euclidean plane? Then I can define the same equivalence relation: that a pair of points are equivalent if they differ additively by an element of $\mathbb{Z}^2$ so that all my equivalence classes have a representative in the unit square where I now identify the edges, forming a torus as I described before. In this case I would write something like $\mathbb{T}^2 \cong \mathbb{R}^2/\mathbb{Z}^2 \cong S^1 \times S^1$: a point on the torus can be defined by two angles. This gives us a way to easily define higher dimensional analogues of the torus, as well as classifying any torus as $\mathbb{R}^2$ modulo some lattice.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[I’m of the age where my first phone housed only one game, snake. Snake is played in a rectangular world: if you try to escape out of one edge you are teleported to the opposite edge. It seems that modern iterations of the game have hardened the boundaries of the square, subverting my entire post but cast your mind back to when snake looked like this:]]></summary><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://fwhitton.github.io/assets/images/phone.jpg" /><media:content medium="image" url="https://fwhitton.github.io/assets/images/phone.jpg" xmlns:media="http://search.yahoo.com/mrss/" /></entry><entry><title type="html">PDEs: Explain it like I’m 5</title><link href="https://fwhitton.github.io/2025/03/14/PDEs-Explain-it-like-I'm-5.html" rel="alternate" type="text/html" title="PDEs: Explain it like I’m 5" /><published>2025-03-14T00:00:00+00:00</published><updated>2025-03-14T00:00:00+00:00</updated><id>https://fwhitton.github.io/2025/03/14/PDEs:%20Explain%20it%20like%20I&apos;m%205</id><content type="html" xml:base="https://fwhitton.github.io/2025/03/14/PDEs-Explain-it-like-I&apos;m-5.html"><![CDATA[<p>This post is for Mum who asked for an <em>r/explainlikeim5</em> style post on what I study. My PhD is very closely related to my Masters project but I want to talk about the broader field of which this is a part.</p>

<p>There are quantities which depend on one thing: the easiest example is a population depending on time. A differential equation is a relationship between something’s growth rate and its size. In a population that has some reproduction rate, the sentence ‘the larger the population, the faster it grows’ encodes a differential equation.  Another example is radioactive decay: if I have a block of uranium then after some amount of time, half of it will have decayed. Then after another half-life, another half will decay. This is the same as the population example, but now ‘the larger the size, the faster it decays’. These are the two simplest differential equations we can describe, both written as $y’ = ky$ with $k$ positive in the first case and negative in the second.</p>

<p>There are myriad other examples where we measure something depending on one thing, usually time. For example, a pendulum swings and the angle it makes with the vertical depends on time. Or there’s a rocket flying away from Earth which burns fuel to propel itself and we can talk about its acceleration changing as its mass decreases. Another example is if I punch a hole in the bottom of a vat and in I pour in squash at a fixed rate at the top: what is the concentration of the squash as time evolves?</p>

<p>In all of these examples the quantity we’re measuring (population, distance, concentration, angle, mass) depends on only one number (in every case, time). For this reason they are all examples of ordinary differential equations. But these are all quite simple systems and in general <em>things depend on more than one thing</em>. A relationship between a quantity and it’s dependence on multiple different things is called a <em>partial differential equation</em>. Not because it’s any easier to solve, that’s some unfortunate nomenclature, but because the derivatives are only partial, i.e., they only take into account change with respect to one variable. My best example of this is the height of a string or the temperature along a rod. Both of these numbers depend on both my position along the rod/string and the time that I’m there.</p>

<p>The beauty of PDEs is the breadth of situations they encapsulate. The physical scale is astounding: Schrödinger’s equation describes the time evolution of quantum states of subatomic particles. Einstein’s equations describe the relationship between energy, mass and the curvature of spacetime on a cosmological scale. The Navier-Stokes equations (which I’ve now written 2 posts on) can be adapted both for the swimming of microorganisms or the flow of plasma comprising stars. PDEs range from the concrete, such as the Black-Scholes equation which describes the price evolution of financial derivatives, to the abstract, such as the Euler-Lagrange equations which state that every physical path is a minimizer of some action. There is a unifying aspect too: the same equation describes the diffusion of a pollutant in a body of water and the diffusion of heat throughout a body. The same equation describes incompressible, irrotational fluid flow, electromagnetic field configurations and the stable configurations of an elastic membrane. Heat and wave evolutions are unified through the Helmholtz equation.</p>

<p>But it is not the applications that interest me: mathematically, these are interesting objects to study in their own right. They are devilishly difficult to solve in generality (see the Navier-Stokes post) but we can still say so much about the solutions without knowing what they are.</p>]]></content><author><name></name></author><summary type="html"><![CDATA[This post is for Mum who asked for an r/explainlikeim5 style post on what I study. My PhD is very closely related to my Masters project but I want to talk about the broader field of which this is a part.]]></summary></entry></feed>