SearcharxivSearch

arXiv subjects

Justin Tatch Moore

Publications and source records attributed to Justin Tatch Moore.

At least 19 recordsLinked to original sources

Merging $\lim^1 \mathbf{A} \ne 0$ with other nonvanishing constructions

We develop methods for forcing $\lim^1 \mathbf{A} \ne 0$, where $\mathbf{A}$ is a particular inverse system of abelian groups introduced by Marde\v{s}i\'c and Prasolov in their computation of certain strong homology groups. These methods allow us to extend previous nonvanishing results of Casarosa and Lambie-Hanson for $\lim^k \mathbf{A}$ for $k \geq 2$. Specifically we show that, for a given $n$, it is relatively consistent with ZFC that $\mathfrak{b} = \mathfrak{d} = \omega_n$ and $\lim^k \mathbf{A} \ne 0$ whenever $1 \leq k \leq n$ (previously established with $2 \leq k \leq n$). We also show it is relatively consistent with ZFC that $\mathfrak{b} = \mathfrak{d} = \omega_{\omega+2}$ and $\lim^k \mathbf{A} \ne 0$ for all $k \geq 1$ (previously established with $k \geq 2$). We also adapt proofs of Kamo to show that $\lim^1 \mathbf{A} = 0$ holds in many finite support iterated forcing extensions.

math.LO

A virtual five element basis for the uncountable linear orders

We prove that for every Aronzsajn line A and every Countryman line C, there is a proper forcing extension in which A contains an isomorphic copy of either C or its converse C*. As a corollary, we obtain answers to several related questions asked by the second author in the literature: if there is an inaccessible cardinal, then there is a proper forcing extension in which the uncountable linear orders have a five element basis; BPFA implies the existence of a five element basis for the uncountable linear orders; BPFA is equiconsistent with the conjunction of BPFA and Aronszajn tree saturation. These results are derived from new preservation results concerning subtrees of Aronszajn trees, proper forcings, and countable support iterations, generalizing work of Miyamoto, Abraham, and Shelah.

math.LO

On minimal non-$σ$-scattered linear orders

The purpose of this article is to give new constructions of linear orders which are minimal with respect to being non-$σ$-scattered. Specifically, we will show that Jensen's principle $\diamondsuit$ implies that there is a minimal Countryman line, answering a question of Baumgartner. We also produce the first consistent examples of minimal non-$σ$-scattered linear orders of cardinality greater than $\aleph_1$, as given a successor cardinal $κ^+$, we obtain such linear orderings of cardinality $κ^+$ with the additional property that their square is the union of $κ$-many chains. We give two constructions: directly building such examples using forcing, and also deriving their existence from combinatorial principles. The latter approach shows that such minimal non-$σ$-scattered linear orders of cardinality $κ^+$ exist for every cardinal $κ$ in Gödel's constructible universe, and also (using work of Rinot) that examples must exist at successors of singular strong limit cardinals in the absence of inner models satisfying the existence of a measurable cardinal $μ$ of Mitchell order $μ^{++}$.

math.LO

A descriptive approach to higher derived limits

We present a new aspect of the study of higher derived limits. More precisely, we introduce a complexity measure for the elements of higher derived limits over the directed set $Ω$ of functions from $\mathbb{N}$ to $\mathbb{N}$ and prove that cocycles of this complexity are images of cochains of the roughly the same complexity. In the course of this work, we isolate a partition principle for powers of directed sets and show that whenever this principle holds, the corresponding derived limit $\mathrm{lim}^n$ is additive; vanishing results for this limit are the typical corollary. The formulation of this partition hypothesis synthesizes and clarifies several recent advances in this area.

math.LO

A piecewise linear homeomorphism of the circle which is periodic under renormalization

We demonstrate the existence of a piecewise linear homeomorphism $f$ of $\mathbb{R}/\mathbb{Z}$ which maps rationals to rationals, whose slopes are powers of $\frac{2}{3}$, and whose rotation number is $\sqrt{2}-1$. This is achieved by showing that a renormalization procedure becomes periodic when applied to $f$. Our construction gives a negative answer to a question of D. Calegari. When combined with work of the 2nd and 3rd authors, our result also shows that $F_{\frac{2}{3}}$ does not embed into $F$, where $F_{\frac{2}{3}}$ is the subgroup of the Stein-Thompson group $F_{2,3}$ consisting of those elements whose slopes are powers of $\frac{2}{3}$. Finally, we produce some evidence suggesting a positive answer to a variation of Calegari's question and record a number of computational observations.

math.GR

On the additivity of strong homology for locally compact separable metric spaces

We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Mardešić and Prasolov showing that the Continuum Hypothesis implies that a countable sum of Hawaiian earrings witnesses the failure of strong homology to possess either of these properties. Our results build directly on work of Lambie-Hanson and the second author which establishes the consistency, relative to a weakly compact cardinal, of $\mathrm{lim}^s \mathbf{A} = 0$ for all $s \geq 1$ for a certain pro-abelian group $\mathbf{A}$; we show that that work's arguments carry implications for the vanishing and additivity of the $\mathrm{lim}^s$ functors over a substantially more general class of pro-abelian groups indexed by $\mathbb{N}^{\mathbb{N}}$.

math.LO

Subgroups of $\mathrm{PL}_+ I$ which do not embed into Thompson's group $F$

We will give a general criterion - the existence of an $F$-obstruction - for showing that a subgroup of $\mathrm{PL}_+ I$ does not embed into Thompson's group $F$. An immediate consequence is that Cleary's "golden ratio" group $F_τ$ does not embed into $F$. Our results also yield a new proof that Stein's groups $F_{p,q}$ do not embed into $F$, a result first established by Lodha using his theory of coherent actions. We develop the basic theory of $F$-obstructions and show that they exhibit certain rigidity phenomena of independent interest. In the course of establishing the main result of the paper, we prove a dichotomy theorem for subgroups of $\mathrm{PL}_+ I$. In addition to playing a central role in our proof, it is strong enough to imply both Rubin's Reconstruction Theorem restricted to the class of subgroups of $\mathrm{PL}_+ I$ and also Brin's Ubiquity Theorem.

math.GR

Complexity among the finitely generated subgroups of Thompson's group

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $ε_0 +1$. All except the maximum element of this family (which is $F$ itself) are elementary amenable groups. In fact we also obtain, for each $α< ε_0$, a finitely generated elementary amenable subgroup of $F$ whose EA-class is $α+ 2$. These groups all have simple, explicit descriptions and can be viewed as a natural continuation of the progression which starts with $\mathbf{Z} + \mathbf{Z}$, $\mathbf{Z} \wr \mathbf{Z}$, and the Brin-Navas group $B$. We also give an example of a pair of finitely generated elementary amenable subgroups of $F$ with the property that neither is embeddable into the other.

math.GR

The method of forcing

The purpose of this article is to give a presentation of the method of forcing aimed at someone with a minimal knowledge of set theory and logic. The emphasis will be on how the method can be used to prove theorems in ZFC.

math.LO

Hindman's Theorem, Ellis's Lemma, and Thompson's group $F$

The purpose of this article is to formulate conjectural generalizations of Hindman's Theorem and Ellis's Lemma for nonassociative binary systems and relate them to the amenability problem for Thompson's group $F$. Partial results are obtained for both conjectures. The paper will also contain some general analysis of the conjectures.

math.CO

Idempotent means on free binary systems do not exist

Free binary systems are shown to not admit idempotent means. This refutes a conjecture of the author. It is also shown that the extension of Hindman's theorem to nonassociative binary systems formulated and conjectured by the author is false.

math.CO

There may be no minimal non $σ$-scattered linear orders

In this paper we demonstrate that it is consistent, relative to the existence of a supercompact cardinal, that there is no linear order which is minimal with respect to being non $σ$-scattered. This shows that a theorem of Laver, which asserts that the class of $σ$-scattered linear orders is well quasi-ordered, is sharp. We also prove that PFA${}^+$ implies that every non $σ$-scattered linear order either contains a real type, an Aronszajn type, or a ladder system indexed by a stationary subset of $ω_1$, equipped with either the lexicographic or reverse lexicographic order. Our work immediately implies that CH is consistent with "no Aronszajn tree has a base of cardinality $\aleph_1$." This gives an affirmative answer to a problem due to Baumgartner.

math.LO

Groups of fast homeomorphisms of the interval and the ping-pong argument

We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of $\mathrm{Homeo}_+(I)$ for which certain finite dynamical data can be used to determine the marked isomorphism type of the groups which they generate. As a corollary, we will obtain a criteria for embedding subgroups of $\mathrm{Homeo}_+(I)$ into Richard Thompson's group $F$. In particular, every member of our class of generating sets generates a group which embeds into $F$ and in particular is not a free product. An analogous abstract theory is also developed for groups of permutations of an infinite set.

math.GR

A finitely presented group of piecewise projective homeomorphisms

In this article we will describe a finitely presented subgroup of Monod's group of piecewise projective homeomorphisms of R. This in particular provides a new example of a finitely presented group which is nonamenable and yet does not contain a nonabelian free subgroup. It is in fact the first such example which is torsion free. We will also develop a means for representing the elements of the group by labeled tree diagrams in a manner which closely parallels Richard Thompson's group F.

math.GR