arXiv subjects

Jordan Mitchell Barrett

Publications and source records attributed to Jordan Mitchell Barrett.

8 recordsLinked to original sources

arXiv2021

Reverse mathematics of rings

Using the tools of reverse mathematics in second-order arithmetic, as developed by Friedman, Simpson, and others, we determine the axioms necessary to develop various topics in commutative ring theory. Our main contributions to the field are as follows. We look at fundamental results concerning primary ideals and the radical of an ideal, concepts previously unstudied in reverse mathematics. Then we turn to a fine-grained analysis of four different definitions of Noetherian in the weak base system $\mathsf{RCA}_0 + \mathsf{I}Σ_2$. Finally, we begin a systematic study of various types of integral domains: PIDs, UFDs and Bézout and GCD domains.

math.LO↗

arXiv2021

Cousin's lemma in second-order arithmetic

Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cousin's lemma for various classes of functions, using Friedman and Simpson's reverse mathematics in second-order arithmetic. We prove that, over $\mathsf{RCA}_0$: (i) Cousin's lemma for continuous functions is equivalent to $\mathsf{WKL}_0$; (ii) Cousin's lemma for Baire class 1 functions is equivalent to $\mathsf{ACA}_0$; (iii) Cousin's lemma for Baire class 2 functions, or for Borel functions, are both equivalent to $\mathsf{ATR}_0$ (modulo some induction).

math.LO↗

arXiv2021

Ramsey theory for layered semigroups

We further develop the theory of layered semigroups, as introduced by Farah, Hindman and McLeod, providing a general framework to prove Ramsey statements about such a semigroup $S$. By nonstandard and topological arguments, we show Ramsey statements on $S$ are implied by the existence of "coherent" sequences in $S$. This framework allows us to formalise and prove many results in Ramsey theory, including Gowers' $\mathrm{FIN}_k$ theorem, the Graham-Rothschild theorem, and Hindman's finite sums theorem. Other highlights include: a simple nonstandard proof of the Graham-Rothschild theorem for strong variable words; a nonstandard proof of Bergelson-Blass-Hindman's partition theorem for located variable words, using a result of Carlson, Hindman and Strauss; and a common generalisation of the latter result and Gowers' theorem, which can be proven in our framework.

math.CO↗

arXiv2021

On functor-quotients and their isomorphism theorems

The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more general formulation in the form of $\mathcal{F}$-quotients in a category $\mathbf{C}$, which are relativized to a faithful functor $\mathcal{F}\colon \mathbf{C} \to \mathbf{D}$. The isomorphism theorems of universal algebras generalize to this setting, and we additionally find important links between $\mathcal{F}$-quotients in the concrete category of first-order structures, and quotients defined for model-theoretic equivalence classes. By first working in this categorical setting, some quotient-related results for first-order structures can be naturally obtained. In particular, we are able to prove some isomorphism theorems in the context of model theory directly from their corresponding categorical isomorphism theorems.

math.LO↗

arXiv2021

On Ramsey-minimal infinite graphs

For fixed finite graphs $G$, $H$, a common problem in Ramsey theory is to study graphs $F$ such that $F \to (G,H)$, i.e. every red-blue coloring of the edges of $F$ produces either a red $G$ or a blue $H$. We generalize this study to infinite graphs $G$, $H$; in particular, we want to determine if there is a minimal such $F$. This problem has strong connections to the study of self-embeddable graphs: infinite graphs which properly contain a copy of themselves. We prove some compactness results relating this problem to the finite case, then give some general conditions for a pair $(G,H)$ to have a Ramsey-minimal graph. We use these to prove, for example, that if $G=S_\infty$ is an infinite star and $H=nK_2$, $n \ge 1$ is a matching, then the pair $(S_\infty,nK_2)$ admits no Ramsey-minimal graphs.

math.CO↗

arXiv2021

On Rado conditions for nonlinear Diophantine equations

Building on previous work of Di Nasso and Luperi Baglini, we provide general necessary conditions for a Diophantine equation to be partition regular. These conditions are inspired by Rado's characterization of partition regular linear homogeneous equations. We conjecture that these conditions are also sufficient for partition regularity, at least for equations whose corresponding monovariate polynomial is linear. This would provide a natural generalization of Rado's theorem. We verify that such a conjecture hold for the equations $x^{2}-xy+ax+by+cz=0$ and $x^{2}-y^{2}+ax+by+cz=0$ for $a,b,c\in \mathbb{Z}$ such that $abc=0$ or $% a+b+c=0$. To deal with these equations, we establish new results concerning the partition regularity of polynomial configurations in $\mathbb{Z}$ such as $\left\{ x,x+y,xy+x+y\right\} $, building on the recent result on the partition regularity of $\left\{ x,x+y,xy\right\} $.

math.CO↗

arXiv2020

Elementary topoi

As the prototypical category, $\mathbf{Set}$ has many properties which make it special amongst categories. From the point of view of mathematical logic, one such property is that $\mathbf{Set}$ has enough structure to "properly" formalise logic. However, we could ask what it might mean to formalise logic in another category $\mathbf{C}$. The notion of an (elementary) topos distills the essential features of $\mathbf{Set}$ which allow us to do this. This expository report defines topoi, and describes the development of first-order logic and set theory within a topos.

math.CT↗

arXiv2020

The reverse mathematics of Cousin's lemma

Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cousin's lemma for various classes of functions, using Friedman and Simpson's reverse mathematics in second-order arithmetic. We prove that, over $\mathsf{RCA}_0$: (i) Cousin's lemma for continuous functions is equivalent to the system $\mathsf{WKL}_0$; (ii) Cousin's lemma for Baire 1 functions is at least as strong as $\mathsf{ACA}_0$; (iii) Cousin's lemma for Baire 2 functions is at least as strong as $\mathsf{ATR}_0$.

math.LO↗