"Galois connection" meaning in English

See Galois connection in All languages combined, or Wiktionary

Noun

Forms: Galois connections [plural]
Etymology: From Galois (attributive form of Galois theory) + connection; ultimately after French mathematician Évariste Galois. Coined by Norwegian mathematician Øystein Ore in 1944, Galois connexions, Transactions of the American Mathematical Society, 55, pages 493-513. Etymology templates: {{m|en|Galois}} Galois, {{m|en|Galois theory}} Galois theory, {{m|en|connection}} connection Head templates: {{en-noun}} Galois connection (plural Galois connections)
  1. (category theory, order theory) A type of correspondence between partially ordered sets (posets), also applicable to preordered sets. Wikipedia link: Galois connection, Transactions of the American Mathematical Society, Évariste Galois, Øystein Ore Categories (topical): Category theory Synonyms: Galois connexion Hypernyms: adjunction Hyponyms: isotone Galois connection, monotone Galois connection, antitone Galois connection

Inflected forms

Download JSON data for Galois connection meaning in English (4.1kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Galois"
      },
      "expansion": "Galois",
      "name": "m"
    },
    {
      "args": {
        "1": "en",
        "2": "Galois theory"
      },
      "expansion": "Galois theory",
      "name": "m"
    },
    {
      "args": {
        "1": "en",
        "2": "connection"
      },
      "expansion": "connection",
      "name": "m"
    }
  ],
  "etymology_text": "From Galois (attributive form of Galois theory) + connection; ultimately after French mathematician Évariste Galois. Coined by Norwegian mathematician Øystein Ore in 1944, Galois connexions, Transactions of the American Mathematical Society, 55, pages 493-513.",
  "forms": [
    {
      "form": "Galois connections",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Galois connection (plural Galois connections)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Category theory",
          "orig": "en:Category theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "1986, Horst Herrlich, Miroslav Hušek, Galois Connections, Austin Melton, Mathematical Foundation of Programming Semantics: International Conference, Proceedings, Springer, Lecture Notes in Computer Science: 239, page 122,\nDefine maps G:A→B and F:B→A by G(a)=y!∈!Y|∀x!∈!axρy and F(b)=x!∈!X|∀y!∈!bxρy. Then (F,G) is called a Galois connection of the first kind."
        },
        {
          "ref": "2001, J. Michael Dunn, Gary M. Hardegree, Algebraic Methods in Philosophical Logic, Oxford University Press, page 398",
          "text": "Finally, we discuss Galois connections. It is interesting to note that these definitions can be found in Birkhoff (1940, 1948, 1967) under the heading of \"polarities,\" and Everett (1944) showed that all Galois connections defined on power sets can be obtained from polarities.",
          "type": "quotation"
        },
        {
          "ref": "2006, Radim Bělohlávek, Taťána Funioková, Vilém Vychodil, “Galois connections with Truth Stressers: Foundations for Formal Concept Analysis of Object-Attribute Data with Fuzzy Attributes”, in Bernd Reusch, editor, Computational Intelligence, Theory and Applications: International Conference, Proceedings, Springer,, page 205",
          "text": "Galois connections appear in several areas of mathematics and computer science, and their applications. A Galois connection between sets X and Y is a pair #x5C;left#x5C;langle#x5C;uparrow,#x5C;downarrow#x5C;right#x5C;rangle of mappings #x5C;uparrow assigning subcollections of Y to subcollections of X, and #x5C;downarrow assigning subcollections of X to subcollections of Y.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A type of correspondence between partially ordered sets (posets), also applicable to preordered sets."
      ],
      "hypernyms": [
        {
          "word": "adjunction"
        }
      ],
      "hyponyms": [
        {
          "word": "isotone Galois connection"
        },
        {
          "word": "monotone Galois connection"
        },
        {
          "word": "antitone Galois connection"
        }
      ],
      "id": "en-Galois_connection-en-noun-J9pfk4K9",
      "links": [
        [
          "category theory",
          "category theory"
        ],
        [
          "correspondence",
          "correspondence"
        ],
        [
          "partially ordered set",
          "partially ordered set"
        ],
        [
          "poset",
          "poset"
        ],
        [
          "preordered set",
          "preordered set"
        ]
      ],
      "raw_glosses": [
        "(category theory, order theory) A type of correspondence between partially ordered sets (posets), also applicable to preordered sets."
      ],
      "synonyms": [
        {
          "word": "Galois connexion"
        }
      ],
      "topics": [
        "category-theory",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "order-theory",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Galois connection",
        "Transactions of the American Mathematical Society",
        "Évariste Galois",
        "Øystein Ore"
      ]
    }
  ],
  "word": "Galois connection"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Galois"
      },
      "expansion": "Galois",
      "name": "m"
    },
    {
      "args": {
        "1": "en",
        "2": "Galois theory"
      },
      "expansion": "Galois theory",
      "name": "m"
    },
    {
      "args": {
        "1": "en",
        "2": "connection"
      },
      "expansion": "connection",
      "name": "m"
    }
  ],
  "etymology_text": "From Galois (attributive form of Galois theory) + connection; ultimately after French mathematician Évariste Galois. Coined by Norwegian mathematician Øystein Ore in 1944, Galois connexions, Transactions of the American Mathematical Society, 55, pages 493-513.",
  "forms": [
    {
      "form": "Galois connections",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Galois connection (plural Galois connections)",
      "name": "en-noun"
    }
  ],
  "hypernyms": [
    {
      "word": "adjunction"
    }
  ],
  "hyponyms": [
    {
      "word": "isotone Galois connection"
    },
    {
      "word": "monotone Galois connection"
    },
    {
      "word": "antitone Galois connection"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English terms with quotations",
        "en:Category theory"
      ],
      "examples": [
        {
          "text": "1986, Horst Herrlich, Miroslav Hušek, Galois Connections, Austin Melton, Mathematical Foundation of Programming Semantics: International Conference, Proceedings, Springer, Lecture Notes in Computer Science: 239, page 122,\nDefine maps G:A→B and F:B→A by G(a)=y!∈!Y|∀x!∈!axρy and F(b)=x!∈!X|∀y!∈!bxρy. Then (F,G) is called a Galois connection of the first kind."
        },
        {
          "ref": "2001, J. Michael Dunn, Gary M. Hardegree, Algebraic Methods in Philosophical Logic, Oxford University Press, page 398",
          "text": "Finally, we discuss Galois connections. It is interesting to note that these definitions can be found in Birkhoff (1940, 1948, 1967) under the heading of \"polarities,\" and Everett (1944) showed that all Galois connections defined on power sets can be obtained from polarities.",
          "type": "quotation"
        },
        {
          "ref": "2006, Radim Bělohlávek, Taťána Funioková, Vilém Vychodil, “Galois connections with Truth Stressers: Foundations for Formal Concept Analysis of Object-Attribute Data with Fuzzy Attributes”, in Bernd Reusch, editor, Computational Intelligence, Theory and Applications: International Conference, Proceedings, Springer,, page 205",
          "text": "Galois connections appear in several areas of mathematics and computer science, and their applications. A Galois connection between sets X and Y is a pair #x5C;left#x5C;langle#x5C;uparrow,#x5C;downarrow#x5C;right#x5C;rangle of mappings #x5C;uparrow assigning subcollections of Y to subcollections of X, and #x5C;downarrow assigning subcollections of X to subcollections of Y.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A type of correspondence between partially ordered sets (posets), also applicable to preordered sets."
      ],
      "links": [
        [
          "category theory",
          "category theory"
        ],
        [
          "correspondence",
          "correspondence"
        ],
        [
          "partially ordered set",
          "partially ordered set"
        ],
        [
          "poset",
          "poset"
        ],
        [
          "preordered set",
          "preordered set"
        ]
      ],
      "raw_glosses": [
        "(category theory, order theory) A type of correspondence between partially ordered sets (posets), also applicable to preordered sets."
      ],
      "topics": [
        "category-theory",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "order-theory",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Galois connection",
        "Transactions of the American Mathematical Society",
        "Évariste Galois",
        "Øystein Ore"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "Galois connexion"
    }
  ],
  "word": "Galois connection"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.