skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Award ID contains: 1764247

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. null (Ed.)
    Answering a longstanding problem originating in Christensen’s seminal work on Haar null sets [ Math. Scand.   28 (1971), 124–128; Israel J. Math.   13 (1972), 255–260; Topology and Borel Structure. Descriptive Topology and Set Theory with Applications to Functional Analysis and Measure Theory , North-Holland Mathematics Studies, 10 (Notas de Matematica, No. 51). (North-Holland Publishing Co., Amsterdam–London; American Elsevier Publishing Co., Inc., New York, 1974), iii+133 pp], we show that a universally measurable homomorphism between Polish groups is automatically continuous. Using our general analysis of continuity of group homomorphisms, this result is used to calibrate the strength of the existence of a discontinuous homomorphism between Polish groups. In particular, it is shown that, modulo $$\text{ZF}+\text{DC}$$ , the existence of a discontinuous homomorphism between Polish groups implies that the Hamming graph on $$\{0,1\}^{\mathbb{N}}$$ has finite chromatic number. 
    more » « less
  2. null (Ed.)