Teichmüller–Tukey lemma

In mathematics, the Teichmüller–Tukey lemma (sometimes named just Tukey's lemma), named after John Tukey and Oswald Teichmüller, is a lemma that states that every nonempty collection of finite character has a maximal element with respect to inclusion. Over Zermelo–Fraenkel set theory, the Teichmüller–Tukey lemma is equivalent to the axiom of choice, and therefore to the well-ordering theorem, Zorn's lemma, and the Hausdorff maximal principle.[1]

Definitions

A family of sets is of finite character provided it has the following properties:

  1. For each , every finite subset of belongs to .
  2. If every finite subset of a given set belongs to , then belongs to .

Statement of the lemma

Let be a set and let . If is of finite character and , then there is a maximal (according to the inclusion relation) such that .[2]

Applications

In linear algebra, the lemma may be used to show the existence of a basis. Let V be a vector space. Consider the collection of linearly independent sets of vectors. This is a collection of finite character. Thus, a maximal set exists, which must then span V and be a basis for V.

Notes

  1. Jech, Thomas J. (2008) [1973]. The Axiom of Choice. Dover Publications. ISBN 978-0-486-46624-8.
  2. Kunen, Kenneth (2009). The Foundations of Mathematics. College Publications. ISBN 978-1-904987-14-7.
gollark: #a has <#457999277311131649>, various other channels via ABR-EB, DNS input, and the ffbm webhook I think.
gollark: There is also a DNS bridge going to <#457999277311131649>.
gollark: You're still banned.
gollark: <@!293066066605768714> I implemented the thing.
gollark: Yes, all are to.

References

  • Brillinger, David R. "John Wilder Tukey"
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.