I have heard mathematical proofs often require cleverly linking two areas of maths which initially seem disconnected. Could anyone provide an example of this, as I feel at my level of study, many proofs are simple extensions to previous topics?
Many thanks.
This is how Fermat's Last Theorem was ultimately proven. FLT is a three-step version of this, connecting number theory, projective geometry, and complex analysis.
The equation $a^n+b^n=c^n$ is a number theoretic statement, and it can be connected to projective geometry using something called the Frey curve. The Frey curve is a type of elliptic curve whose properties depend on the existence of rational solutions to the equation $a^n+b^n=c^n$. Specifically, if that equation has rational solutions then the solution could be used to construct an elliptic curve that is not modular.
The Modularity theorem (formerly known as the Taniyama–Shimura–Weil conjecture) says that elliptic curves (projective geometry) and modular forms (complex analysis) are more or less the same thing. Unsurprisingly, all modular forms are modular.
Together, these two statements mean that we have the chain implication
$$\exists a,b,c\in\mathbb{N}\;a^n+b^n=c^n \Rightarrow \exists\text{ a non-modular eliptic curve }\Rightarrow\text{ the Modularity theorem is false}$$
What Andrew Wiles actually proved to finish the proof of FLT is the Modularity theorem. Taking the contrapositive of this chain implication tells us that FLT is true.
Other examples that are the topic of ongoing research include the Langlands Program (connecting Galois Theory and automorphic forms) and Geometric Complexity Theory (connecting computational complexity theory and algebraic geometry). It's not a full fledged program (yet?) but this recent paper connects neural networks and something from algebraic geometry known as tropical polynomials. I'm actually currently writing a paper on this very topic.