- Series
- CDSNS Colloquium
- Time
- Friday, November 19, 2021 - 1:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005; streaming via Zoom available
- Speaker
- J.D. Mireles James – Florida Atlantic University – jmirelesjames@fau.edu – http://cosweb1.fau.edu/~jmirelesjames/
- Organizer
- Alex Blumenthal

**Please Note:** Talk will be held in-person in Skiles 005 and streamed synchronously.
Zoom link-- https://us06web.zoom.us/j/83392531099?pwd=UHh2MDFMcGErbzFtMHBZTmNZQXM0dz09

My goal is to present a computer assisted proof of a non-trivial theorem in nonlinear dynamics, in full detail. My (quite biased) definition of non-trivial is that there should be some infinite dimensional complications. However, since I want to go through all the details, I need these complications to be as simple as possible. So, I'll consider the Henon map, and prove that some 1 dimensional stable and unstable manifolds attached to a hyperbolic fixed point intersect transversally. By Smale's theorem, this implies the existence of chaotic motions. Recall that one can prove the existence chaotic dynamics for the Henon map more or less by hand using topological methods. Yet transverse intersection of the manifolds is a stronger statement, and moreover the method I'll discuss generalizes to much more sophisticated examples where pen-and-paper fail.

The idea of the proof is to develop a high order polynomial expansion of the stable/unstable manifolds of the fixed point, to prove an a-posteriori theorem about the convergence and truncation error bounds for this expansion, and to check the hypotheses of this theorem using the computer. All of this relies on the parameterization method of Cabre, Fontich, and de la Llave, and on finite numerical calculations using interval arithmetic to manage the inevitable roundoff errors. Once global enough representations of the local invariant manifolds are obtained and equipped with mathematically rigorous error bounds, it is a finite dimensional problem to establish that the manifolds intersect transversally.