![]() |
![]() |
![]() Order-theoretic fixed point theoremsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Paul Taylor. Zoom details
Abstract Some messy history of messy classical proofs and a simple constructive proof with applications to messy algebra. I will survey the history of classical and constructive fixed point theorems in order theory, demonstrating that most of the attributions are wrong and why not to use transfinite recursion. I will conclude with a constructive theorem that can do everything that the older ones could do, but has a simpler proof and is easier to use. Slides: www.paultaylor.eu/slides/22-LL-Brum.pdf This talk is part of the Lab Lunch series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsType the title of a new list here RSLC PhD/Postdoc Seminars (Chemistry) Filling in the blank – I will be ….... in 2050’Other talksExtending the Lax type operator for finite W-algebras Quantum simulations using ultra cold ytterbium Ultrafast, all-optical, and highly efficient imaging of molecular chirality TBC TBC Geometry of alternating projections in metric spaces with bounded curvature |