Teichmüller–Tukey lemma
lemma that states that every nonempty collection of finite character has a maximal element with respect to inclusion
Press Enter · cited answer in seconds
0 sources
Teichmüller–Tukey lemma
Summary
Teichmüller–Tukey lemma is a theorem[1]. It draws 11 Wikipedia views per month (theorem category, ranking #268 of 1,306).[2]
Key Facts
- Teichmüller–Tukey lemma's instance of is recorded as theorem[3].
- Teichmüller–Tukey lemma's instance of is recorded as equivalent of the axiom of choice[4].
- Oswald Teichmüller is named after Teichmüller–Tukey lemma[5].
- John Tukey is named after Teichmüller–Tukey lemma[6].
- Teichmüller–Tukey lemma's said to be the same as is recorded as axiom of choice[7].
- Teichmüller–Tukey lemma's Freebase ID is recorded as /m/05p8s2c[8].
- Teichmüller–Tukey lemma's studied by is recorded as order theory[9].
- Teichmüller–Tukey lemma's studied by is recorded as set theory[10].
- Teichmüller–Tukey lemma's maintained by WikiProject is recorded as WikiProject Mathematics[11].
- Teichmüller–Tukey lemma's Microsoft Academic ID is recorded as 41350624[12].
- Teichmüller–Tukey lemma's ProofWiki ID is recorded as Tukey's_Lemma[13].
- Teichmüller–Tukey lemma's Treccani's Enciclopedia della Matematica ID is recorded as lemma-di-tukey[14].
Why It Matters
Teichmüller–Tukey lemma draws 11 Wikipedia views per month (theorem category, ranking #268 of 1,306).[2] It has Wikipedia articles in 9 language editions, a strong signal of global cultural recognition.[15]