Fred Galvin

This biography of a living person relies on a single source. You can help by adding reliable sources to this article. Contentious material about living people that is unsourced or poorly sourced must be removed immediately. (April 2024) (Learn how and when to remove this message)

Frederick William Galvin is a mathematician, currently a professor at the University of Kansas. His research interests include set theory and combinatorics.

His notable combinatorial work includes the proof of the Dinitz conjecture. In set theory, he proved with András Hajnal that if ℵ_ω1 is a strong limit cardinal, then

${\displaystyle 2^{\aleph _{\omega _{1}}}<\aleph _{(2^{\aleph _{1}})^{+}}}$

holds. The research on extending this result led Saharon Shelah to the invention of PCF theory. Galvin gave an elementary proof of the Baumgartner–Hajnal theorem ${\displaystyle \omega _{1}\to (\alpha )_{k}^{2}}$ (${\displaystyle \alpha <\omega _{1},k<\omega }$). The original proof by Baumgartner and Hajnal used forcing and absoluteness. Galvin and Shelah also proved the square bracket partition relations ${\displaystyle \aleph _{1}\not \to [\aleph _{1}]_{4}^{2}}$ and ${\displaystyle 2^{\aleph _{0}}\not \to [2^{\aleph _{0}}]_{\aleph _{0}}^{2}}$. Galvin also proved the partition relation ${\displaystyle \eta \to [\eta ]_{3}^{2}}$ where η denotes the order type of the set of rational numbers. Galvin and Karel Prikry proved that every Borel set is Ramsey. Galvin and Komjáth showed that the axiom of choice is equivalent to the statement that every graph has a chromatic number.

Galvin received his Ph.D. in 1967 from the University of Minnesota.^[1]

He invented Doublemove Chess in 1957, and Push Chess in 1967.