Sperner's lemma in English

[Show JSON for post-processed kaikki.org data shown on this page ▼] [Hide JSON for post-processed kaikki.org data shown on this page ▲]

{
  "etymology_text": "The initial result of this kind was proved by Emanuel Sperner.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Sperner's lemma",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "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": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A combinatorial analog of the Brouwer fixed-point theorem, stating that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors."
      ],
      "id": "en-Sperner's_lemma-en-name-Vp0lakKk",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "combinatorial",
          "combinatorial"
        ],
        [
          "analog",
          "analog"
        ],
        [
          "Brouwer fixed-point theorem",
          "Brouwer fixed-point theorem"
        ],
        [
          "Sperner coloring",
          "Sperner coloring"
        ],
        [
          "triangulation",
          "triangulation"
        ],
        [
          "simplex",
          "simplex"
        ],
        [
          "cell",
          "cell"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A combinatorial analog of the Brouwer fixed-point theorem, stating that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Emanuel Sperner",
        "Sperner's lemma"
      ]
    }
  ],
  "word": "Sperner's lemma"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "etymology_text": "The initial result of this kind was proved by Emanuel Sperner.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Sperner's lemma",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "en:Mathematics"
      ],
      "glosses": [
        "A combinatorial analog of the Brouwer fixed-point theorem, stating that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "combinatorial",
          "combinatorial"
        ],
        [
          "analog",
          "analog"
        ],
        [
          "Brouwer fixed-point theorem",
          "Brouwer fixed-point theorem"
        ],
        [
          "Sperner coloring",
          "Sperner coloring"
        ],
        [
          "triangulation",
          "triangulation"
        ],
        [
          "simplex",
          "simplex"
        ],
        [
          "cell",
          "cell"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A combinatorial analog of the Brouwer fixed-point theorem, stating that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Emanuel Sperner",
        "Sperner's lemma"
      ]
    }
  ],
  "word": "Sperner's lemma"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-20 from the enwiktionary dump dated 2024-05-02 using wiktextract (1d5a7d1 and 304864d). 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.

"Sperner's lemma" meaning in English

Proper name