"antichain" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "anti",
        "3": "chain"
      },
      "expansion": "anti- + chain",
      "name": "prefix"
    }
  ],
  "etymology_text": "From anti- + chain.",
  "forms": [
    {
      "form": "antichains",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "antichain (plural antichains)",
      "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 terms prefixed with anti-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Finnish translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Italian translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Spanish translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Set theory",
          "orig": "en:Set theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "derived": [
        {
          "word": "maximal antichain"
        }
      ],
      "examples": [
        {
          "ref": "1997, Winfried Just, Martin Weese, Discovering Modern Set Theory II: Set-Theoretic Tools for Every Mathematician, American Mathematical Society, page 140:",
          "text": "First of all, Zorn's Lemma implies that every uncountable antichain in T is contained in a maximal uncountable antichain. So it suffices to make sure that T has no maximal uncountable antichains.",
          "type": "quote"
        },
        {
          "text": "2013, Vijay K. Garg, Maximal Antichain Lattice Algorithms for Distributed Computations, Proceedings, Davide Frey, Michel Raynal, Saswati Sarkar, Rudrapatna K. Shyamasundar, Prasun Sinha (editors), Distributed Computing and Networking: 14th International Conference, ICDCN, Springer, LNCS 7730, page 245,\nWe first define three different but isomorphic lattices: the lattice of maximal antichain ideals, the lattice of maximal antichains and the lattice of strict ideals."
        },
        {
          "text": "2014, Martin Aigner, Günter M. Ziegler, Proofs from THE BOOK, Springer, 5th Edition, page 199,\nIn 1928 Emanuel Sperner asked and answered the following question: Suppose we are given the set N=1,2,3,…,n. Call a family ℱ of subsets of N, which has partial order ⊆]) an antichain if no set of ℱ contains another set of the family ℱ. What is the size of a largest antichain? Clearly, the family ℱₖ of all k-sets satisfies the antichain property with |ℱₖ|=\\binomnk. Looking at the maximum of the binomial coefficients (see page 14) we conclude that there is an antichain of size \\binomn[n/2]= max ₖ\\binomnk. Sperner's theorem now asserts that there are no larger ones."
        }
      ],
      "glosses": [
        "A subset, A, of a partially ordered set, (P, ≤), such that no two elements of A are comparable with respect to ≤."
      ],
      "id": "en-antichain-en-noun-9QBlfRm7",
      "links": [
        [
          "set theory",
          "set theory"
        ],
        [
          "subset",
          "subset"
        ],
        [
          "partially ordered set",
          "partially ordered set"
        ],
        [
          "element",
          "element"
        ],
        [
          "comparable",
          "comparable"
        ]
      ],
      "raw_glosses": [
        "(set theory, order theory) A subset, A, of a partially ordered set, (P, ≤), such that no two elements of A are comparable with respect to ≤."
      ],
      "topics": [
        "mathematics",
        "order-theory",
        "sciences",
        "set-theory"
      ],
      "translations": [
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "subset of a partially ordered set",
          "word": "antiketju"
        },
        {
          "code": "it",
          "lang": "Italian",
          "sense": "subset of a partially ordered set",
          "tags": [
            "feminine"
          ],
          "word": "anticatena"
        },
        {
          "code": "es",
          "lang": "Spanish",
          "sense": "subset of a partially ordered set",
          "tags": [
            "feminine"
          ],
          "word": "anticadena"
        }
      ],
      "wikipedia": [
        "antichain"
      ]
    }
  ],
  "word": "antichain"
}

{
  "derived": [
    {
      "word": "maximal antichain"
    }
  ],
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "anti",
        "3": "chain"
      },
      "expansion": "anti- + chain",
      "name": "prefix"
    }
  ],
  "etymology_text": "From anti- + chain.",
  "forms": [
    {
      "form": "antichains",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "antichain (plural antichains)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with anti-",
        "English terms with quotations",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Terms with Finnish translations",
        "Terms with Italian translations",
        "Terms with Spanish translations",
        "en:Set theory"
      ],
      "examples": [
        {
          "ref": "1997, Winfried Just, Martin Weese, Discovering Modern Set Theory II: Set-Theoretic Tools for Every Mathematician, American Mathematical Society, page 140:",
          "text": "First of all, Zorn's Lemma implies that every uncountable antichain in T is contained in a maximal uncountable antichain. So it suffices to make sure that T has no maximal uncountable antichains.",
          "type": "quote"
        },
        {
          "text": "2013, Vijay K. Garg, Maximal Antichain Lattice Algorithms for Distributed Computations, Proceedings, Davide Frey, Michel Raynal, Saswati Sarkar, Rudrapatna K. Shyamasundar, Prasun Sinha (editors), Distributed Computing and Networking: 14th International Conference, ICDCN, Springer, LNCS 7730, page 245,\nWe first define three different but isomorphic lattices: the lattice of maximal antichain ideals, the lattice of maximal antichains and the lattice of strict ideals."
        },
        {
          "text": "2014, Martin Aigner, Günter M. Ziegler, Proofs from THE BOOK, Springer, 5th Edition, page 199,\nIn 1928 Emanuel Sperner asked and answered the following question: Suppose we are given the set N=1,2,3,…,n. Call a family ℱ of subsets of N, which has partial order ⊆]) an antichain if no set of ℱ contains another set of the family ℱ. What is the size of a largest antichain? Clearly, the family ℱₖ of all k-sets satisfies the antichain property with |ℱₖ|=\\binomnk. Looking at the maximum of the binomial coefficients (see page 14) we conclude that there is an antichain of size \\binomn[n/2]= max ₖ\\binomnk. Sperner's theorem now asserts that there are no larger ones."
        }
      ],
      "glosses": [
        "A subset, A, of a partially ordered set, (P, ≤), such that no two elements of A are comparable with respect to ≤."
      ],
      "links": [
        [
          "set theory",
          "set theory"
        ],
        [
          "subset",
          "subset"
        ],
        [
          "partially ordered set",
          "partially ordered set"
        ],
        [
          "element",
          "element"
        ],
        [
          "comparable",
          "comparable"
        ]
      ],
      "raw_glosses": [
        "(set theory, order theory) A subset, A, of a partially ordered set, (P, ≤), such that no two elements of A are comparable with respect to ≤."
      ],
      "topics": [
        "mathematics",
        "order-theory",
        "sciences",
        "set-theory"
      ],
      "wikipedia": [
        "antichain"
      ]
    }
  ],
  "translations": [
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "subset of a partially ordered set",
      "word": "antiketju"
    },
    {
      "code": "it",
      "lang": "Italian",
      "sense": "subset of a partially ordered set",
      "tags": [
        "feminine"
      ],
      "word": "anticatena"
    },
    {
      "code": "es",
      "lang": "Spanish",
      "sense": "subset of a partially ordered set",
      "tags": [
        "feminine"
      ],
      "word": "anticadena"
    }
  ],
  "word": "antichain"
}