## Tagged Questions

0answers
109 views

### From universal measurability to measurability

Let $(\Omega,\Sigma)$ be a measurable space and $K$ be a compact metrizable space endowed with its Borel $\sigma$-algebra $\mathcal{B}(K)$. Let $A\subseteq\Omega\times K$ be …
1answer
325 views

### How long can it take to generate a $\sigma$-algebra?

I want to know if there is a $\sigma$-algebra such that for every countable ordinal $\alpha$ the $\sigma$-algebra can be generated in more than $\alpha$ steps but less than \$\omega …
0answers
100 views

### Restrictions of null/meager ideal

Let I denote the null (resp. meager) ideal on reals. Is it consistent that for any pair of non null (resp. meager) sets A and B, there is a null (resp. meager) preserving bijection …
1answer
75 views

### Borel ideals on $\omega$ are meager?

Let $\mathcal{I}$ be a proper ideal on $\omega$. If $\mathcal{I}$ is Borel as a subset of $2^\omega$, does it follow that $\mathcal{I}$ is meager? Edit: What if $\mathcal{I}$ cont …
2answers
218 views

### Cohen algebra (generalization)

Let Bor($X$) = class of all borel subsets of $X$. Cohen algebra is defined as Bor(X) modulo the ideal of meager sets. The Cohen algebra has a combinatorial : it is the uniqu …
1answer
101 views

### Basis theorem (due to Solovay?)

I'm finishingg up my bibliography and I'm looking for a reference for the statement that, working in $L(\R)$, the $\Delta^2_1$ sets form a basis for the $\Sigma^2_1$ predicates. I …
2answers
408 views

### Image of L^1 under the Fourier Transform

The Fourier Transform $\mathcal{F}:L^1(\mathbb{R})\to C_0(\mathbb{R})$ is an injective, bounded linear map that isn't onto. It is known (if I remember correctly) that the range is …
2answers
124 views

### Obtaining conditional probabilities as pushforwards of [0,1]

It is standard that every Borel probability measure on a polish space $X$ can be obtained as pushforward of the uniform measure $\lambda$ on $[0,1]$ along an almost-everywhere-defi …
0answers
208 views

### Godel on recursion-theoretic hierarchies

At the end of his excellent article, "The Emergence of Descriptive Set Theory" (http://math.bu.edu/people/aki/2.pdf), Kanamori writes: "Another mathematical eternal return: To …
1answer
184 views

### Models of Determinacy

Today we have that $L(\mathbb{R}) \models AD$ (assuming there are $\omega$ many Woodin cardinals and a measurable above them all). I was wondering what other models of $AD$ might l …
1answer
81 views

### Product of Baire sigma-algebras

Suppose that $X$ is a Polish space and $\mathcal{E}$ is the $\sigma$-algebra of subsets of $X$ with the property of Baire. Consider the product $\sigma$-algebra \$\mathcal{E}\otim …
1answer
126 views

### Complexity of winning strategies for open games (for open player)

If $G\subseteq\omega^{<\omega}$ is a computable clopen game, then $G$ has a winning strategy which is hyperarithmetic $(\Delta^1_1)$, by an inductive ranking process. The key ob …
1answer
136 views

### When do substructures have computable copies?

Say that a class $\mathcal{C}$ of countable first-order structures in some finite signature has the effective substructure property if $\mathcal{C}$ is closed under isomorphism and …
1answer
146 views

### Ensuring nonempty lightface Borel sets have elements via theories of second-order arithmetic

This question is an outgrowth of this MathSE question: http://math.stackexchange.com/questions/276068/members-of-lightface-borel-sets. A Borel set $X\subseteq 2^\omega$ is a memb …
0answers
87 views

### Open games formed by pasting together infinitely many clopen games

Throughout, I think of games and their underlying trees as the same: so a "clopen game" and a "well-founded tree" mean the same thing. Fix a sequence of clopen games \$\lbrace T_i: …

15 30 50 per page
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 40, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9058524966239929, "perplexity_flag": "middle"}