Processing math: 100%

Grothendieck universe

Collection

definiendum G in it
postulate G … set
forall XG
postulate P(X)G
forall xX
postulate xG
exists PG
postulate P(X)P
forall Y … set
postulate YGY  GYG

Discussion

Formalities

The symbol in the last postulate is an abbreviation. For subsets Y of G, equinumerosity can be defined as the existence of a set of pairs, f={{y,u},{y,u},}, which puts elements yY uniquely in correspondence with uG:

I reverse-engineered this from the metamath page, so it needs to be checked

Y  Gf.x.((xY)!u. {x,u}f)((xGY)(yY). {y,x}f)

The first clause says f corresponds to a function F and moreover implies F(b)YF(F(b))=b. The second says F is surjective into GY.

strangely, to me, the metamath defintion doesn't include transitivity in an obvious way, and I can't see it… I added it here anyway, since it's part of any other definition I've seen.

Reference

Wikipedia: Grothendieck universe, Universe (Mathematics)

They have the corresponding axiom in pure first order logic language and 6 shorter version on metamath.

Metamath: grothprim (long), axgroth5 (the one above)

nLab: Grothendieck universe


Requirements

Link to graph
Log In
Improvements of the human condition