Fixed points through a monotone retraction
Lax369799.FixedPointRetraction · concepts/Lax369799/FixedPointRetraction.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
If every value of a monotone operator lies in the image of a monotone section, projection to that image preserves its least and greatest fixed points. This removes auxiliary coordinates whose values are determined by the retained coordinates.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Mathlib.Order.FixedPoints |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Fixed points through a monotone retraction |
| 6 | type: theorem |
| 7 | --- |
| 8 | If every value of a monotone operator lies in the image of a monotone |
| 9 | section, projection to that image preserves its least and greatest fixed |
| 10 | points. This removes auxiliary coordinates whose values are determined |
| 11 | by the retained coordinates. |
| 12 | -/ |
| 13 | namespace Lax369799.FixedPointRetraction |
| 14 | variable {α β : Type} [CompleteLattice α] [CompleteLattice β] |
| 15 | |
| 16 | def reduced (F : α →o α) (p : α →o β) (l : β →o α) : β →o β := p.comp (F.comp l) |
| 17 | |
| 18 | axiom least (F : α →o α) (p : α →o β) (l : β →o α) |
| 19 | (hp : ∀ x, p (l x) = x) (hF : ∀ x, l (p (F x)) = F x) : |
| 20 | p F.lfp = (reduced F p l).lfp |
| 21 | |
| 22 | axiom greatest (F : α →o α) (p : α →o β) (l : β →o α) |
| 23 | (hp : ∀ x, p (l x) = x) (hF : ∀ x, l (p (F x)) = F x) : |
| 24 | p F.gfp = (reduced F p l).gfp |
| 25 | |
| 26 | end Lax369799.FixedPointRetraction |
| 27 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments