{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $f : L \\rightarrow P$ be a monotone function from a complete lattice to a poset. Then the following are equivalent:\n\n1. f preserves all meets,\n1. f has a left adjoint.\n\nAnd similarly: f preserves all join if and only if f has an right adjoint.\n",
  "commit": "1696dfa6ac9eeb239262bb8121a4817855ba7e8d",
  "front": {
    "inventory": [
      "TGNT6XGD2V"
    ],
    "kind": "statement",
    "name": "Adjoint functor theorem for posets",
    "role": "theorem",
    "sources": [
      {
        "locator": "Galois connection, section Connection to category theory \u003e Adjoint functor theorem for posets",
        "mention": "wikipedia://en/156411#8339",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:156411@r1364444923"
      }
    ],
    "tag": "NY3RGGYNNB"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/NY3RGGYNNB/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/NY3RGGYNNB.md",
  "msc": null,
  "name": "Adjoint functor theorem for posets",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/NY3/NY3RGGYNNB.md",
  "status": null,
  "tag": "NY3RGGYNNB",
  "uri": "m2://NY3RGGYNNB",
  "url": "https://math2.tamnd.com/wiki/adjoint-functor-theorem-for-posets/",
  "writing": {
    "tag": "NY3RGGYNNB",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}