Search arXiv⌕ Search

arXiv · 2409.09699

On maximal order type of the lexicographic product

Abstract

In the previously submitted version of this paper, available here for the record, we stated the following : "We give a self-contained proof of Isa Vialard's formula for $o(P\cdot Q)$ where $P$ and $Q$ are wpos. The proof introduces the notion of a cut of partial order, which might be of independent interest." In fact, the argument presented in the paper is wrong and Vialard formula has no known proof. I will try to prove the formula $o(P\cdot Q)=o(P)\cdot o(Q)$ from the [DzSS] paper because I believe that Altman's purported counter-example mentioned in the preprint is incorrect. This statement is written by Mirna Džamonja without consultation with Isa Vialard, who may hold different views. Mirna Džamonja has withdrawn her authorship from the conditionally accepted version of this note (IGPL) on January 20, 2025

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mirna Džamonja, Isa Vialard. 2025-01-25. On maximal order type of the lexicographic product. https://arxiv.org/abs/2409.09699

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Forcing with Symmetric Systems of Models of Two Types

The purpose of this paper is to present a general method for forcing on $ω_2$ and $ω_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing with finite symmetric systems of elementary submodels, and improves earlier versions of this forcing by including models of two types. We will present several applications of the pure side condition forcing and variants thereof, by adding a Kurepa tree on $ω_2$, a club subset of $ω_2$ that avoids infinite sets from the ground model, a function bounding every canonical function below $ω_3$ on a club, and a simplified $(ω_2,1)$-morass.

math.LO↗

On some NIP Fragments of Fields

In this document we study sets of NIP formulas in some theories of fields and valued fields, with a special focus on the sets of quantifier-free and existential formulas. First, we give a new proof of the fact that Separably Closed Valued Fields of any characteristic and any imperfection degree are NIP, and use this result to fill some gaps of a proof of the so-called NIP Transfer Theorem for henselian valued fields of equal characteristic. Second, we prove a variant of a theorem of Johnson: every positive characteristic valued field whose existential formulas are NIP is henselian, and generalize this result for finer sets of existential formulas, like positive existential with a given number of quantifiers, in type-definable fields. Finally, we set the ground for the finer question of transfer of NIP formulas of valued fields with bounded quantifier rank. Namely, we prove that for any henselian equicharacteristic valued field, any formula of quantifier rank at most $n\geq 1$ is NIP if and only if the same is true for the residue field and the value group, provided that the valued field is separably defectless Kaplansky and conditional on a multi-variable generalization of a well known statement about indiscernible sequences of singletons in ac-valued fields.

math.LO↗

Combinatorics of Schur ultrafilters

In this paper, we provide a combinatorial characterization of the elements of Schur ultrafilters on countable commutative groups. Using this characterization, we construct a Schur ultrafilter on $\mathbb Z$ that is not infinitary Schur. Moreover, assuming the Continuum Hypothesis, we establish the existence of Schur P-points in $β(\mathbb Z)$. On the other hand, it is consistent with ZFC that there exist P-points in $β(\mathbb Z)$, but none of them are Schur. Also, we extend the result of Fernández-Bretón, Navarro-Castillo, and Soria-Rojas by showing that no Schur ultrafilter on $\mathbb Z$ is a Q-point.

math.LO↗