Metraipolis › archive › dc_c0dbd84dd536
Tucker's lemma — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Tucker%27s_lemma
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T20:37:48.100Z
- SHA-256 of the archived text
6eaf32c64c79a893206271eac9975fcdac475937c479727f5380ac025c308fb7- Stable URL of this page
https://metraipolis.com/documento/dc_c0dbd84dd536
How to cite
Tucker's lemma — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Tucker%27s_lemma (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c0dbd84dd536 (Metraipolis archive dc_c0dbd84dd536, sha256 6eaf32c64c79a893206271eac9975fcdac475937c479727f5380ac025c308fb7)
BibTeX
@misc{dcc0dbd84dd536,
title = {Tucker's lemma — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Tucker%27s_lemma},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c0dbd84dd536; sha256 6eaf32c64c79a893206271eac9975fcdac475937c479727f5380ac025c308fb7},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Tucker%27s_lemma. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematics, Tucker's lemma is a combinatorial analog of the Borsuk–Ulam theorem, named after Albert W. Tucker. Let T be a triangulation of the closed n-dimensional ball B n {\displaystyle B_{n}} . Assume T is antipodally symmetric on the boundary sphere S n − 1 {\displaystyle S_{n-1}} . That means that the subset of simplices of T which are in S n − 1 {\displaystyle S_{n-1}} provides a triangulation of S n − 1 {\displaystyle S_{n-1}} where if σ is a simplex then so is −σ. Let L : V ( T ) → { + 1 , − 1 , + 2 , − 2 , . . . , + n , − n } {\displaystyle L:V(T)\to \{+1,-1,+2,-2,...,+n,-n\}} be a labeling of the vertices of T which is an odd function on S n − 1 {\displaystyle S_{n-1}} , i.e., L ( − v ) = − L ( v ) {\displaystyle L(-v)=-L(v)} for every vertex v ∈ S n − 1 {\displaystyle v\in S_{n-1}} . Then Tucker's lemma states that T contains a complementary edge - an edge (a 1-simplex) whose vertices are labelled by the same number but with opposite signs.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Combinatorics»).
Fonte: Wikipedia in inglese, voce «Tucker's lemma» — https://en.wikipedia.org/wiki/Tucker%27s_lemma
Wikidata Q7851042 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7851042
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Tucker%27s_lemma?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369175619, consultata il 2026-10-07T19:47:26.991Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: c77e4563b4182ae1997a00f72e4a1942714eac7cc8feef0811a2d8b2da846f5f