While this submission is a draft, it cannot be used by other submissions.

Fixed points through a monotone retraction

Lax369799.FixedPointRetraction · concepts/Lax369799/FixedPointRetraction.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    1 concept; 7 descendants hidden
    100%
    Proven claimThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Mathlib.Order.FixedPoints
    2
    3/-!
    4---
    5title: Fixed points through a monotone retraction
    6type: theorem
    7---
    8If every value of a monotone operator lies in the image of a monotone
    9section, projection to that image preserves its least and greatest fixed
    10points. This removes auxiliary coordinates whose values are determined
    11by the retained coordinates.
    12-/
    13namespace Lax369799.FixedPointRetraction
    14variable {α β : Type} [CompleteLattice α] [CompleteLattice β]
    15
    16def reduced (F : α →o α) (p : α →o β) (l : β →o α) : β →o β := p.comp (F.comp l)
    17
    18axiom 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
    22axiom 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
    26end Lax369799.FixedPointRetraction
    27
    Show ProofShow Proof
    Builds on

    none

    Used by
    From Mathlib

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…