In mathematics, a Grothendieck universe is a set U with the following properties:
If x is an element of U and if y is an element of x, then y is also an element of U. (U is a transitive set.)
If x and y are both elements of U, then is an element of U.
If x is an element of U, then P(x), the power set of x, is also an element of U.
If is a family of elements of U, and if I is an element of U, then the union is an element of U.
A Grothendieck universe is meant to provide a set in which all of mathematics can be performed. (In fact, uncountable Grothendieck universes provide models of set theory with the natural ∈-relation, natural powerset operation etc.). Elements of a Grothendieck universe are sometimes called small sets. The idea of universes is due to Alexander Grothendieck, who used them as a way of avoiding proper classes in algebraic geometry.
The existence of a nontrivial Grothendieck universe goes beyond the usual axioms of Zermelo–Fraenkel set theory; in particular it would imply the existence of strongly inaccessible cardinals.
Tarski–Grothendieck set theory is an axiomatic treatment of set theory, used in some automatic proof systems, in which every set belongs to a Grothendieck universe.
The concept of a Grothendieck universe can also be defined in a topos.
As an example, we will prove an easy proposition.
Proposition. If and , then .
Proof. because . because , so .
It is similarly easy to prove that any Grothendieck universe U contains:
All singletons of each of its elements,
All products of all families of elements of U indexed by an element of U,
All disjoint unions of all families of elements of U indexed by an element of U,
All intersections of all families of elements of U indexed by an element of U,
All functions between any two elements of U, and
All subsets of U whose cardinal is an element of U.
In particular, it follows from the last axiom that if U is non-empty, it must contain all of its finite subsets and a subset of each finite cardinality.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In set theory, a branch of mathematics, a set is called transitive if either of the following equivalent conditions hold: whenever , and , then . whenever , and is not an urelement, then is a subset of . Similarly, a class is transitive if every element of is a subset of . Using the definition of ordinal numbers suggested by John von Neumann, ordinal numbers are defined as hereditarily transitive sets: an ordinal number is a transitive set whose members are also transitive (and thus ordinals).
In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted by V, is the class of hereditary well-founded sets. This collection, which is formalized by Zermelo–Fraenkel set theory (ZFC), is often used to provide an interpretation or motivation of the axioms of ZFC. The concept is named after John von Neumann, although it was first published by Ernst Zermelo in 1930. The rank of a well-founded set is defined inductively as the smallest ordinal number greater than the ranks of all members of the set.
In mathematics, and particularly in set theory, , type theory, and the foundations of mathematics, a universe is a collection that contains all the entities one wishes to consider in a given situation. In set theory, universes are often classes that contain (as elements) all sets for which one hopes to prove a particular theorem. These classes can serve as inner models for various axiomatic systems such as ZFC or Morse–Kelley set theory. Universes are of critical importance to formalizing concepts in inside set-theoretical foundations.
K-Theory was originally defined by Grothendieck as a contravariant functor from a subcategory of schemes to abelian groups, known today as K0. The same kind of construction was then applied to other fields of mathematics, like spaces and (not necessarily c ...