Matet–Mathias Forcing

• Matet–Mathias forcing is a method built from finite and infinite block sequences in FIN using a nonempty family H to enforce block-order relationships.
• It employs pure decision and an h-Laver property within Matet–adequate families to enable fusion arguments and ensure cardinal preservation.
• The forcing is applied in countable-support iterations to generate exactly two Q-points while eliminating other candidate ultrafilters via local combinatorial lemmas.

Searching arXiv for the cited paper and closely related items. arXiv_search query: "(Halbeisen et al., 20 Jul 2025)" Matet–Mathias forcing is the forcing notion $\mathbb{P}_{MM}(\mathcal{H})$ built from finite and infinite block-sequences in $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$ relative to a nonempty family $\mathcal{H}\subseteq FIN^{[\infty]}$. In the setting isolated in Section 3 of "There may be exactly $n$ $Q$-points" (Halbeisen et al., 20 Jul 2025), conditions are pairs $\langle a,X\rangle$ consisting of a finite stem $a$ and an infinite remainder $X\in\mathcal{H}$ with the stem lying strictly below the remainder in the block-order. The forcing is used there in a restricted form, namely over Matet–adequate families, to obtain a length-$\omega_2$ countable support iteration that yields exactly two $Q$-points up to isomorphism in the final extension (Halbeisen et al., 20 Jul 2025).

1. Block-sequences and the definition of $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$0

The ambient combinatorial space is the Milliken–Taylor space of finite “blocks.” One sets

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$1

and defines the block-order $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$2 on $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$3 by

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$4

A finite block-sequence is any $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$5, including the empty sequence $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$6, and an infinite block-sequence is any $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$7. The notation $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$8 denotes the usual initial-segment relation on block-sequences, and $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$9 denotes concatenation when $\mathcal{H}\subseteq FIN^{[\infty]}$0 component-wise in the block-order (Halbeisen et al., 20 Jul 2025).

Fix a nonempty family $\mathcal{H}\subseteq FIN^{[\infty]}$1. The Matet–Mathias forcing relative to $\mathcal{H}\subseteq FIN^{[\infty]}$2, denoted $\mathcal{H}\subseteq FIN^{[\infty]}$3, consists of all pairs

$\mathcal{H}\subseteq FIN^{[\infty]}$4

such that $\mathcal{H}\subseteq FIN^{[\infty]}$5, $\mathcal{H}\subseteq FIN^{[\infty]}$6, and $\mathcal{H}\subseteq FIN^{[\infty]}$7. Here $\mathcal{H}\subseteq FIN^{[\infty]}$8 means that every block in the finite sequence $\mathcal{H}\subseteq FIN^{[\infty]}$9 sits below the first block of $n$0 in the $n$1 order (Halbeisen et al., 20 Jul 2025).

The order is defined by end-extension of the stem together with condensation of the remainder:

$n$2

iff

1. $n$3,
2. $n$4 is a finite block-sequence lying inside $n$5, and
3. $n$6 in the usual Milliken condensation order.

Equivalently, if one writes $n$7, then one requires $n$8, $n$9, and also $Q$0 (Halbeisen et al., 20 Jul 2025). In the unrestricted case $Q$1, the notation is simply $Q$2.

This presentation makes the forcing bifurcated: a finite approximation is carried by the stem, while the infinite block-sequence controls admissible future extensions. A plausible implication is that much of the forcing’s behavior is determined not merely by the combinatorics of $Q$3 but by the closure and Ramsey properties of the chosen family $Q$4.

2. Matet–adequate families

Eisworth isolated the axioms on $Q$5 under which the forcing acquires its principal regularity features. Such a family is called Matet–adequate if it satisfies four requirements (Halbeisen et al., 20 Jul 2025).

Property	Requirement
finite-change	If $Q$6 and $Q$7 differs from $Q$8 in only finitely many blocks, then $Q$9
upwards $\langle a,X\rangle$0	If $\langle a,X\rangle$1 and $\langle a,X\rangle$2, then $\langle a,X\rangle$3
diagonal intersection	Every descending sequence $\langle a,X\rangle$4 in $\langle a,X\rangle$5 has $\langle a,X\rangle$6 with $\langle a,X\rangle$7 for all $\langle a,X\rangle$8
homogeneity	For every $\langle a,X\rangle$9 and every $a$0-coloring $a$1, there exists $a$2 with $a$3 and $a$4 constant

Here $a$5 means $a$6. The adequacy axioms therefore combine finite robustness, eventual upward closure, countable diagonal closure, and a Ramsey-type homogeneity principle (Halbeisen et al., 20 Jul 2025).

Lemma 2.3, attributed to Eisworth and Mildenberger, strengthens this package in two ways. First, for each $a$7 and any $a$8-coloring $a$9, there is $X\in\mathcal{H}$0, $X\in\mathcal{H}$1, on which $X\in\mathcal{H}$2 is constant. Second, diagonal intersections may be chosen so that every block of the diagonal lies “far enough down” in each $X\in\mathcal{H}$3 (Halbeisen et al., 20 Jul 2025). This suggests that Matet–adequacy is designed to support fusion arguments requiring both finite-dimensional Ramsey canonization and quantitative control over where diagonal blocks occur.

Two typical examples are recorded. The first is the full space $X\in\mathcal{H}$4, which yields the unrestricted forcing $X\in\mathcal{H}$5. The second is the family

$X\in\mathcal{H}$6

defined from a pair of Ramsey ultrafilters $X\in\mathcal{H}$7 by requiring infinite block-sequences to admit condensations hitting given sets in $X\in\mathcal{H}$8 on minima and $X\in\mathcal{H}$9 on maxima; Mildenberger shows that this family is Matet–adequate (Halbeisen et al., 20 Jul 2025).

3. Pure decision, the $\omega_2$0-Laver property, and preservation

When $\omega_2$1 is Matet–adequate, $\omega_2$2 satisfies a pure decision theorem. Theorem 3.1, due to Calderón–Di Prisco–Mijares, states that for every condition $\omega_2$3 and every sentence $\omega_2$4 in the forcing language, there is an extension $\omega_2$5 which decides $\omega_2$6 (Halbeisen et al., 20 Jul 2025).

A second structural fact is a Laver-type bounding property. Let

$\omega_2$7

where $\omega_2$8 is the “top” block-sequence $\omega_2$9. If $Q$0 is Matet–adequate and

$Q$1

then there are an extension $Q$2 and a ground-model function $Q$3 with $Q$4 such that

$Q$5

This is Lemma 3.2, the $Q$6-Laver property (Halbeisen et al., 20 Jul 2025).

The proof sketch in the source is explicitly fusion-based. Pure decision first produces one value of $Q$7 on a decidable condition; then one enumerates all finite stems of length $Q$8, decides $Q$9 on each, thins out by homogeneity to make the choice independent of the stem, and continues inductively. A final diagonal intersection in $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$00 unifies the fusion into one condition (Halbeisen et al., 20 Jul 2025).

From pure decision together with this Laver-type fusion, properness and preservation of $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$01 follow “in the usual way,” and preservation of $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$02 in the iteration follows by standard CH-arguments (Halbeisen et al., 20 Jul 2025). In this presentation, the forcing’s preservation theory is not stated abstractly but emerges from the interaction of decidability, homogeneity, and diagonal closure inside Matet–adequate families.

4. The length-$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$03 countable-support iteration

The paper uses Matet–Mathias forcing restricted to a Matet–adequate family to produce exactly two $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$04-points. The iteration begins in a ground model $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$05 with two nonisomorphic Ramsey ultrafilters $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$06 (Halbeisen et al., 20 Jul 2025).

By induction on $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$07, one defines a countable-support iteration

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$08

where

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$09

At successor stage $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$10, one forces with $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$11 over $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$12, thereby adjoining a generic infinite block-sequence

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$13

Its two projections

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$14

form pseudo-intersections of the ultrafilters $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$15 and $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$16, respectively. Under $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$17 these are then extended to new Ramsey ultrafilters

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$18

(Halbeisen et al., 20 Jul 2025).

At limits of countable cofinality, one diagonal-intersects the prior ultrafilters. At limits of uncountable cofinality, no new reals are added, so the union of the towers remains Ramsey (Halbeisen et al., 20 Jul 2025). By standard facts about iterations of proper pure-decision forcings with fusion,

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$19

is proper and preserves all cardinals $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$20; moreover, it has the $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$21-chain-condition, with a citation in the source to Abraham’s theorem (Halbeisen et al., 20 Jul 2025).

Within the paper’s broader program, this iteration is presented as an alternative route for the case $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$22: the abstract states that the statement for $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$23 can be obtained by a length-$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$24 countable support iteration of Matet–Mathias forcing restricted to a Matet–adequate family, while the full paper proves consistency of “There are exactly $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$25 $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$26-points up to isomorphism” for any finite $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$27 and describes this restricted iteration specifically for the case of two $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$28-points (Halbeisen et al., 20 Jul 2025).

5. Interaction with $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$29-points

A $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$30-point is defined in the paper as an ultrafilter $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$31 on $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$32 such that for every function $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$33 there is $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$34 on which $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$35 is finite-to-one; equivalently, every countable subset of $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$36 has a pseudo-intersection in $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$37 (Halbeisen et al., 20 Jul 2025). The forcing construction is calibrated so that two particular ultrafilters survive as $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$38-points while all others are ruled out.

Theorem 4.2 states that in $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$39 there are exactly two $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$40-points up to isomorphism, namely

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$41

(Halbeisen et al., 20 Jul 2025).

The proof is by contradiction. If some ultrafilter $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$42 in the extension were a $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$43-point not isomorphic to $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$44 or $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$45, then by standard closure it would already appear in some intermediate model $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$46. The tail of the iteration above $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$47 factors as

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$48

where

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$49

and $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$50 is the remainder, which has the Laver property. The argument then shows, exactly as in Proposition 4.4, that $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$51 destroys the $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$52-point property of any ultrafilter not isomorphic to one of the two diagonally-built Ramsey ultrafilters (Halbeisen et al., 20 Jul 2025).

The significance of this factorization is methodological: the decisive combinatorics are concentrated in one restricted Matet–Mathias stage together with a tail forcing having a Laver-type bounding property. This suggests that the role of $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$53 is not only generative, via the block generic $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$54, but also eliminative, via a structured obstruction to the persistence of extraneous $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$55-points.

6. Local combinatorial lemmas and their role

Three lemmas provide the local mechanism by which the forcing closes off unwanted $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$56-points. They are formulated for $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$57 and are assembled in the proof of the main theorem for $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$58 (Halbeisen et al., 20 Jul 2025).

Lemma 4.6 is a finite-approximation decision statement. Given $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$59 and an $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$60-name $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$61, there is $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$62 in $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$63 such that for every finite block-sequence $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$64, the condition

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$65

decides the intersection $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$66 as some finite set $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$67, and moreover these $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$68 do not “flip” on refinements of the same height (Halbeisen et al., 20 Jul 2025). This is a localized form of pure decision, adapted to finite initial segments of the relevant subset of $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$69.

Lemma 4.7 is an interval-partitioning statement. If

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$70

then one can thin out to force the existence of an interval partition

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$71

such that whenever $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$72 meets $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$73, the generic real $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$74 must meet one of the three adjacent intervals (Halbeisen et al., 20 Jul 2025). The forcing thereby converts cardinality bounds indexed by generic block maxima into a geometric constraint on interval interaction.

Lemma 4.8 is the closing-off lemma. Given any partition $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$75 of $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$76 and a $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$77-point $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$78 not isomorphic to $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$79 or $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$80, then for any $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$81 one can find $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$82 and a set $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$83 such that whenever $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$84 hits $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$85, the set $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$86 avoids all three adjacent intervals

$FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$87

(Halbeisen et al., 20 Jul 2025).

Putting these together exactly as in Proposition 4.4, the paper concludes that in the final extension any candidate ultrafilter $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$88 distinct from the two designated towers is forced not to have the $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$89-point property (Halbeisen et al., 20 Jul 2025). A common misunderstanding would be to view the result as a mere preservation argument for two pre-existing ultrafilters. The local lemmas show that the construction is equally a destruction argument: the restricted Matet–Mathias forcing is used to engineer interval configurations incompatible with the defining pseudo-intersection behavior of other $FIN=[\omega]^{<\omega}\setminus\{\emptyset\}$90-points.