-
Notifications
You must be signed in to change notification settings - Fork 0
/
part_2.tex
13 lines (10 loc) · 1.79 KB
/
part_2.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
%%%%%%%%%%%%%%%%%%%%%part.tex%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% sample part title
%
% Use this file as a template for your input.
%
%%%%%%%%%%%%%%%%%%%%%%%% Springer %%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Part II: The \pwT}
\noindent Now, we start properly on the promise we set out to make good on from the outset of these notes: an honest proof of the \pwt. The previous part, by no means brief and right to the point, was hopefully either a good refresher or a first introduction to the necessary machinery we are about to put to use to prove this eponymous theorem. As mentioned before, there are two main parts to this proof: parameterization (the \om bit) and the diophantine part (the number theory bit). We now have everything we need to put those together in full gruesome (meant in a good way, of course) detail -- albeit using more modern proofs than originally used by Pila and Wilkie. In particular, we will be providing more detail in the proofs (and full proofs themselves) in the proof of the parameterization result than the diophantine, as it skews more relevant to this course. While no means undetailed, the diophantine discussion will be more so an overview and statement of the important and necessary results and lacks the complete proofs required for proper rigour.
We broadly follow the recent paper of Bhardwaj and van den Dries \cite{bhardwaj_pilawilkie_2022} first but instead elect to take a few shortcuts or liberties when thought to be appropriate. Then, we use the similarly recent new proof (depending on when you're reading this) of the Yomdin-Gromov theorem by Binyamini and Novikov \cite{binyamini_yomdingromov_2021} to get our desired result. From there, \pw itself is far from a stretch (but also far from immediate), and we will soon have built it up in (almost) all its full spectacle.