Searcharxiv⌕ Search

arXiv subjects

David Schrittesser

Publications and source records attributed to David Schrittesser.

30 records · Page 2Linked to original sources

Admissibility is Bayes optimality with infinitesimals

We give an exact characterization of admissibility in statistical decision problems in terms of Bayes optimality in a so-called nonstandard extension of the original decision problem, as introduced by Duanmu and Roy. Unlike the consideration of improper priors or other generalized notions of Bayes optimalitiy, the nonstandard extension is distinguished, in part, by having priors that can assign "infinitesimal" mass in a sense that can be made rigorous using results from nonstandard analysis. With these additional priors, we find that, informally speaking, a decision procedure $δ_0$ is admissible in the original statistical decision problem if and only if, in the nonstandard extension of the problem, the nonstandard extension of $δ_0$ is Bayes optimal among the extensions of standard decision procedures with respect to a nonstandard prior that assigns at least infinitesimal mass to every standard parameter value. We use the above theorem to give further characterizations of admissibility, one related to Blyth's method, one to a condition due to Stein which characterizes admissibility under some regularity assumptions; and finally, a characterization using finitely additive priors in decision problems meeting certain regularity requirements. Our results imply that Blyth's method is a sound and complete method for establishing admissibility. Buoyed by this result, we revisit the univariate two-sample common-mean problem, and show that the Graybill--Deal estimator is admissible among a certain class of unbiased decision procedures.

math.ST↗

Loeb Extension and Loeb Equivalence II

The paper answers two open questions that were raised in by Keisler and Sun. The first question asks, if we have two Loeb equivalent spaces $(Ω, \mathcal F, μ)$ and $(Ω, \mathcal G, ν)$, does there exist an internal probability measure $P$ defined on the internal algebra $\mathcal H$ generated from $\mathcal F\cup \mathcal G$ such that $(Ω, \mathcal H, P)$ is Loeb equivalent to $(Ω, \mathcal F, μ)$? The second open problem asks if the $σ$-product of two $σ$-additive probability spaces is Loeb equivalent to the product of the same two $σ$-additive probability spaces. Continuing work in a previous paper, we give a confirmative answer to the first problem when the underlying internal probability spaces are hyperfinite, a partial answer to the first problem for general internal probability spaces, and settle the second question negatively by giving a counter-example. Finally, we show that the continuity sets in the $σ$-algebra of the $σ$-product space are also in the algebra of the product space.

math.FA↗

Lebesgue's Density Theorem and definable selectors for ideals

We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to these results, we show that there is no reasonably definable selector that chooses representatives for the equivalence relation on the Borel sets of having countable symmetric difference. In other words, there is no notion of density which makes the ideal of countable sets satisfy an analogue to the density theorem. The proofs of the positive results use only elementary combinatorics of trees, while the negative results rely on forcing arguments.

math.LO↗

Maximal discrete sets

We survey results regarding the definability and size of maximal discrete sets in analytic hypergraphs. Our main examples include maximal almost disjoint (or mad) families, $\mathcal I$-mad families, maximal eventually different families, and maximal cofinitary groups. We discuss the non-increasing sequence of cardinal characteristics $\mathfrak a_ξ$, for $ξ<ω_1$ as well as the notions of spectra of characteristics and optimal projective witnesses. We give an account of Zhang's forcing to add generic cofinitary permutations, and of a version of this forcing with built-in coding.

math.LO↗

Loeb Extension and Loeb Equivalence

In Keisler and Sun (2004), the authors raise several open problems on Loeb equivalences between various internal probability spaces. We provide counter-examples for the first two open problems. Moreover, we reduce the third open problem to the following question: Is the internal algebra generated by the union of two Loeb equivalent internal algebras a subset of the Loeb extension of any one of the internal algebra?

math.LO↗

Minimal definable graphs of definable chromatic number at least three

We show that there is a Borel graph on a standard Borel space of Borel chromatic number three that admits a Borel homomorphism to every analytic graph on a standard Borel space of Borel chromatic number at least three. Moreover, we characterize the Borel graphs on standard Borel spaces of vertex-degree at most two with this property, and show that the analogous result for digraphs fails.

math.LO↗

The Ramsey property implies no mad families

We show that if all collections of infinite subsets of $\N$ have the Ramsey property, then there are no infinite maximal almost disjoint (mad) families. This solves a long-standing problem going back to Mathias \cite{mathias}. The proof exploits an idea which has its natural roots in ergodic theory, topological dynamics, and invariant descriptive set theory: We use that a certain function associated to a purported mad family is invariant under the equivalence relation $E_0$, and thus is constant on a "large" set. Furthermore we announce a number of additional results about mad families relative to more complicated Borel ideals.

math.LO↗

Maximal almost disjoint families, determinacy, and forcing

We study the notion of $\mathcal J$-MAD families where $\mathcal J$ is a Borel ideal on $ω$. We show that if $\mathcal J$ is an arbitrary $F_σ$ ideal, or is any finite or countably iterated Fubini product of $F_σ$ ideals, then there are no analytic infinite $\mathcal J$-MAD families, and assuming Projective Determinacy there are no infinite projective $\mathcal J$-MAD families; and under the full Axiom of Determinacy + $V=\mathbf{L}(\mathbb{R})$ there are no infinite $\mathcal J$-mad families. These results apply in particular when $\mathcal J$ is the ideal of finite sets $\mathrm{Fin}$, which corresponds to the classical notion of MAD families. The proofs combine ideas from invariant descriptive set theory and forcing.

math.LO↗

Compactness of maximal eventually different families

We show that there is an effectively closed maximal eventually different family of functions in spaces of the form $\prod_n F(n)$ for $F\colon \mathbb{N} \to \mathbb{N}\cup\{\mathbb{N}\}$ and give an exact criterion for when there exists an effectively compact such family.

math.LO↗