Uniformization (set theory)

In set theory, the axiom of uniformization, a weak form of the axiom of choice, states that if $R$ is a subset of $X\times Y$, where $X$ and $Y$ are Polish spaces, then there is a subset $f$ of $R$ that is a partial function from $X$ to $Y$, and whose domain equals

$\{x\in X|\exists y\in Y(x,y)\in R\}\,$

Such a function is called a uniformizing function for $R$, or a uniformization of $R$.

File:Unif.png

Uniformization of relation R by function f

To see the relationship with the axiom of choice, observe that $R$ can be thought of as associating, to each element of $X$, a subset of $Y$. A uniformization of $R$ then picks exactly one element from each such subset, whenever the subset is nonempty.

A pointclass ${\boldsymbol {\Gamma }}$ is said to have the uniformization property if every relation $R$ in ${\boldsymbol {\Gamma }}$ can be uniformized by a partial function in ${\boldsymbol {\Gamma }}$. The uniformization property is implied by the scale property, at least for adequate pointclasses.

It follows from ZFC alone that ${\boldsymbol {\Pi }}_{1}^{1}$ and ${\boldsymbol {\Sigma }}_{2}^{1}$ have the uniformization property. It follows from the existence of sufficient large cardinals that

• ${\boldsymbol {\Pi }}_{2n+1}^{1}$ and ${\boldsymbol {\Sigma }}_{2n+2}^{1}$ have the uniformization property for every natural number $n$.
• Therefore, the collection of projective sets has the uniformization property
• Every relation in L(R) can be uniformized, but not necessarily by a function in L(R). In fact, L(R) does not have the uniformization property (equivalently, L(R) does not satisfy the axiom of uniformization).

References

• . ISBN 0-444-70199-0. {{cite book}}: Missing or empty |title= (help); Unknown parameter |Author= ignored (|author= suggested) (help); Unknown parameter |Publisher= ignored (|publisher= suggested) (help); Unknown parameter |Title= ignored (|title= suggested) (help); Unknown parameter |Year= ignored (|year= suggested) (help)