Skip to content
The Lumenary

Practice · First-year graduate

Descriptive set theory

Descriptive set theory

Warm-upHuman

Where does Q\Q sit in the Borel hierarchy of R\R?

Choose one

Descriptive set theory

CoreHuman

Which of these spaces (with their usual topologies) are Polish? Choose all that apply.

Choose all that apply

Descriptive set theory

CoreHuman

Which kind of subset of R2\R^2 can have a projection onto the xx-axis that is not Borel?

Choose one

Descriptive set theory

CoreHuman

In the proof that an uncountable analytic set A=f[N]A = f[\mathcal N] contains a perfect set, why do we first remove the open set UU (the union of the NsN_s with f[Ns]f[N_s] countable)?

Choose one

Descriptive set theory

CoreHuman

Let X={0}∪{1n:n≥1}∪{1m+1n:m,n≥1}X = \{0\} \cup \{\tfrac1n : n \ge 1\} \cup \{\tfrac1m + \tfrac1n : m, n \ge 1\}, a closed subset of R\R. The derived set X′X' removes the isolated points. How many times must the derivative be applied before the empty set is reached (the Cantor–Bendixson rank of XX)?

Descriptive set theory

StretchHuman

Mazurkiewicz (1936) studied D={f∈C[0,1]:f is differentiable at every point}D = \{f \in C[0, 1] : f \text{ is differentiable at every point}\}, where C[0,1]C[0, 1] has the sup norm. Which statement is correct?

Choose one

Descriptive set theory

CoreFormal

Which Lean statement formalises (one direction of) Suslin's theorem in a Hausdorff space with Borel σ-algebra?

Choose one

Descriptive set theory

CoreFormal

The Lean proof of rat_not_isGδ applies Dense.inter_of_Gδ to two sets. What does it conclude, and why is that a contradiction?

Choose one

Descriptive set theory

StretchComputational

A tree on {0,1}\{0, 1\} is given by a predicate tree(s) on binary strings. Write split_height(tree, n): the height of the largest full binary tree whose branching nodes are branching nodes of the tree, within depth nn. Recursively, at a node tt of length nn the height is 00; otherwise it is the maximum of the children's heights and, if both children are in the tree, 1+min⁡1 + \min of their heights.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.