\documentclass[12pt,twoside,leqno,a4paper]{article} \usepackage[T1]{fontenc} \usepackage{microtype} \usepackage{amsmath,amsthm,amssymb,mathtools,mathrsfs} \usepackage[a4paper,textwidth=13.5cm,textheight=23cm,centering]{geometry} \usepackage{enumitem} \usepackage{needspace} \usepackage{xcolor} \definecolor{paperlink}{RGB}{0,0,114} \usepackage{hyperref} \hypersetup{colorlinks=true,linktoc=all,linkcolor=paperlink, citecolor=paperlink,urlcolor=paperlink,pdfstartview=Fit} \hypersetup{pdftitle={Relative P-Ideals of Hypergraphs and Ultrafilter Spectra}, pdfauthor={Zhenyu Sun}, pdfsubject={Set theory and hypergraph ideals}, pdfkeywords={hypergraph ideal, ultrafilter, P-point, Q-point, Louveau ideal, Stone duality, reaping number}} \pagestyle{myheadings} \markboth{Z. Sun}{Hypergraph ideals and ultrafilter spectra} \frenchspacing \linespread{1.2} \setlength{\parindent}{16pt} \setlength{\parskip}{0pt} \setlength{\emergencystretch}{1em} \setcounter{tocdepth}{1} \setlist[enumerate]{label=\textup{(\roman*)},leftmargin=2.1em,itemsep=3pt,topsep=5pt} \allowdisplaybreaks[2] \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{maintheorem}{Theorem} \renewcommand{\themaintheorem}{\Alph{maintheorem}} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{question}[theorem]{Question} \newtheorem{example}[theorem]{Example} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \numberwithin{equation}{section} \newcommand{\om}{\omega} \newcommand{\Fin}{\mathrm{Fin}} \newcommand{\st}{\subseteq^*} \newcommand{\R}{[\om]^\om} \newcommand{\V}{\mathcal V} \newcommand{\Lcal}{\mathcal L} \newcommand{\Gfc}{\mathcal G_{\mathrm{fc}}} \newcommand{\Id}{\operatorname{Id}} \newcommand{\Star}{\operatorname{Star}} \newcommand{\Ult}{\operatorname{Ult}} \newcommand{\Ext}{\operatorname{Ext}} \newcommand{\non}{\operatorname{non}} \newcommand{\cov}{\operatorname{cov}} \newcommand{\cof}{\operatorname{cof}} \newcommand{\tr}{\operatorname{tr}} \newcommand{\pc}{\pi\chi} \newcommand{\pcs}{\pi\chi_\sigma} \newcommand{\wh}[1]{\widehat{#1}} \newcommand{\restr}{\mathbin{\upharpoonright}} \newcommand{\succT}{\operatorname{succ}} \newcommand{\stem}{\operatorname{stem}} \newcommand{\Fray}{\mathscr F_{\mathrm{fin}}} \newcommand{\Frays}{\mathscr F_{\mathrm{fin}}^\sigma} \newcommand{\Icap}{\mathscr I} \newcommand{\louv}{\ell^0} \newcommand{\set}[1]{\{#1\}} \title{Relative $P$-Ideals of Hypergraphs and Ultrafilter Spectra} \author{Zhenyu Sun\\[3pt] \normalsize School of Mathematics and Statistics\\ \normalsize Northeastern University at Qinhuangdao, China\\ \normalsize\href{mailto:sunzhenyu@neuq.edu.cn}{sunzhenyu@neuq.edu.cn}} \date{} \begin{document} \maketitle \begin{abstract} We study ideals of hypergraphs of finite uniformity under countable upper bounds modulo finite vertex covers. The canonical ideal generated by a free filter and finite weak colorings has this relative $P$-property exactly when the filter is the intersection of finitely many $P$-points. The classification is preserved by adjoining hypergraphs that are locally finite after a finite vertex deletion. The corresponding extension of a trace ideal induces capture ideals on increasing sequences. These are $\sigma$-ideals exactly for $P$-filters, and their uniformities are $\max\{\pi\chi(\mathcal F),\mathfrak d\}$. For an ultrafilter $\mathcal U$, the arity-two capture ideal equals the Louveau ideal exactly when $\mathcal U$ is a $P$-point. Successive capture ideals decrease with the arity, and equality characterizes $Q$-points. Every strict inclusion is witnessed by a closed set. Thus a non-$Q$ $P$-point yields a decreasing sequence of $\sigma$-ideals, distinguished by closed sets, with equal uniformities. We also establish invariance under locally finite witness enlargements and analyze Stone kernels and countable block products. Consistently, nested ray-positive $P$-sets have the same singleton endpoint spectrum and different ray transversal numbers. \end{abstract} \begingroup\small \noindent\textit{2020 Mathematics Subject Classification.} Primary 03E17; Secondary 03E05, 03E15, 05C65, 06E15, 54D80. \smallskip \noindent\textit{Keywords.} Hypergraph ideal, ultrafilter, $P$-point, $Q$-point, Louveau ideal, Stone duality, reaping number. \endgroup \clearpage \tableofcontents \clearpage \section{Introduction} For an ideal of hypergraphs, the existence of countable upper bounds depends on the allowed differences between a hypergraph and its bound. We consider differences covered by finitely many vertices. Such differences meet any locally finite hypergraph in finitely many edges. An increasing path avoiding a relative upper bound therefore avoids each hypergraph it bounds. This connects the relative $P$-property of hypergraph ideals with countable closure of ideals on increasing sequences. Fix an integer $k\ge2$ and write $E_k=[\om]^k$. A hypergraph is a subset of $E_k$. Write $A\st B$ when $A\setminus B$ is finite. Let $\V_k$ consist of hypergraphs with a finite vertex cover, let $\Gfc^{(k)}$ consist of hypergraphs with a finite weak coloring, and let $\Lcal_k$ consist of hypergraphs that become locally finite after finitely many vertices are deleted. A hypergraph ideal $\mathcal J$ is a \emph{$\V_k$-$P$-ideal} if every sequence $H_n\in\mathcal J$ has an upper bound $H\in\mathcal J$ satisfying $H_n\setminus H\in\V_k$ for all $n$. For $R=\{r_0n$. For background on these cardinals, see \cite{Blass2010}. For a proper ideal $\mathscr I$ on a set $S$, its \emph{uniformity} is \[ \non(\mathscr I)=\min\{|A|:A\subseteq S,\ A\notin\mathscr I\}. \] For a proper filter $\mathscr F$ on $S$, its transversal number is \[ \tr(\mathscr F)=\min\{|A|:A\subseteq S,\ A\cap F\ne\varnothing \text{ for all }F\in\mathscr F\}. \] The complement-dual ideal $\{A\subseteq S:S\setminus A\in\mathscr F\}$ has uniformity $\tr(\mathscr F)$, since $A$ fails to meet a filter member exactly when its complement belongs to the filter. \subsection{Finite vertex covers and local finiteness} Fix $2\le k<\om$. A \emph{$k$-uniform hypergraph} on $\om$ is a subset $H\subseteq E_k=[\om]^k$. Its elements are its hyperedges. A set $B$ is \emph{independent} if $H\cap[B]^k=\varnothing$. A weak coloring is a map $c:\om\to q$ such that no hyperedge is monochromatic. A finite weak coloring partitions the vertex set into finitely many independent sets. We write $\chi(H)$ for the least number of colors and put \[ \Gfc^{(k)}=\{H\subseteq E_k:\chi(H)<\om\}. \] This is an ideal. For a union of two finitely colorable hypergraphs, the ordered pair of their colorings is a finite weak coloring. Throughout, hypergraph coloring has this weak meaning. For $F\subseteq\om$, put \[ \Star_k(F)=\{e\in E_k:e\cap F\ne\varnothing\}. \] The finite-vertex-cover ideal is \[ \V_k=\{H\subseteq E_k:(\exists F\in[\om]^{<\om})\ H\subseteq\Star_k(F)\}. \] It is contained in $\Gfc^{(k)}$. Assign distinct colors to the finitely many covering vertices and one further color to all remaining vertices. For $i\in\om$, define the $i$th row by $H(i)=\{e\in H:\min e=i\}$. \begin{lemma}[Row description]\label{lem:rows} For $H,K\subseteq E_k$, the following are equivalent: \begin{enumerate} \item $H\setminus K\in\V_k$; \item $H(i)\subseteq K(i)$ for all but finitely many $i$; \item for some $N$, every $e\in H$ with $\min e\ge N$ belongs to $K$. \end{enumerate} \end{lemma} \begin{proof} If a finite set $F$ covers $H\setminus K$, no error hyperedge can have minimum larger than every member of $F$. This proves (i)$\Rightarrow$(iii). The equivalence of (ii) and (iii) is immediate. Under (iii), every error hyperedge meets $[0,N)$, proving (i). \end{proof} A hypergraph is \emph{locally finite} if every vertex belongs to finitely many hyperedges. Let $\Lcal_k$ consist of hypergraphs $H$ for which $H\cap[\om\setminus F]^k$ is locally finite for some finite $F$. \begin{lemma}\label{lem:LF-rows} A hypergraph belongs to $\Lcal_k$ exactly when all but finitely many of its rows are finite. Consequently, $\Lcal_k$ is an ideal containing $\V_k$. Every infinite vertex set contains an infinite independent subset for any member of $\Lcal_k$. \end{lemma} \begin{proof} If deleting $F$ gives local finiteness, every row with minimum above $\max F$ is finite. Conversely, suppose all rows with minimum at least $N$ are finite. In the induced hypergraph on $[N,\infty)$, the hyperedges incident with a fixed vertex $v$ lie in the finite union of rows indexed by $N,\ldots,v$, so there are finitely many of them. The ideal assertions follow from this row description. For the final assertion, first delete the finite exceptional vertices. Given finitely many already selected vertices, their incident hyperedges involve only finitely many vertices. Choose the next vertex in the prescribed infinite set outside that finite union and above the previous choice. No hyperedge can be completed by a later choice. The resulting infinite set is independent. \end{proof} After identifying each row with $\om$, the ideal $\Lcal_k$ becomes $\Fin\otimes\Fin=\{A\subseteq\om\times\om: \{n:A_n\text{ is infinite}\}\text{ is finite}\}$. Our upper bounds use the error ideal $\V_k$, whose members have finitely many nonempty rows. Write $\mathcal M_k$ for the nondecreasing functions $f\in\om^\om$ with $f(i)\ge i+k$, and set \begin{equation}\label{eq:bounded-hypergraph} B_f^{(k)}=\{e\in E_k:\max e\le f(\min e)\}. \end{equation} \begin{lemma}[Bounded-row hypergraphs]\label{lem:Bf} For every $H\in\Lcal_k$ there is $f\in\mathcal M_k$ such that $H\setminus B_f^{(k)}\in\V_k$. Moreover, \[ B_f^{(k)}\setminus B_g^{(k)}\in\V_k \quad\Longleftrightarrow\quad f\le^*g \qquad(f,g\in\mathcal M_k). \] \end{lemma} \begin{proof} Above the finitely many exceptional rows, take the maximum of all vertices in each finite row and then a nondecreasing majorant. This gives the first assertion by Lemma~\ref{lem:rows}. If $f\le^*g$, row inclusion holds eventually. If $f(i)>g(i)$, the set \[ \{i,i+1,\ldots,i+k-2,g(i)+1\} \] is a $k$-element hyperedge in the $i$th row of the difference. Infinitely many such indices preclude a finite vertex cover, again by Lemma~\ref{lem:rows}. \end{proof} \subsection{Witnesses and absolute avoidance} We regard $\R$ as the space of its increasing enumerations, with the subspace topology inherited from $\om^\om$. The first finitely many entries specify a clopen cylinder. For each $R=\{r_0h(n)$ for infinitely many $n$, choose corresponding ray edges in $G_n$ with minimum at least $h(n)$. Since $h(n)\to\infty$, infinitely many distinct edges are obtained, all belonging to $H_h$. This proves \eqref{eq:row-avoidance}. Finally, if $G_n\setminus H\in\V_k$, Lemma~\ref{lem:rows} gives a threshold $a_n$ above which every row of $G_n$ is contained in $H$. Choose a strictly increasing $h$ with $h(n)\geq a_n$. Then $H_h\subseteq H$. \end{proof} \begin{lemma}[Locally finite pseudounions]\label{lem:LF-P} The ideal $\Lcal_k$ is a $\V_k$-$P$-ideal. More precisely, for any sequence $H_n\in\Lcal_k$ there is a locally finite $H$ with $H_n\setminus H\in\V_k$ for every $n$. \end{lemma} \begin{proof} Choose $a_n$ such that the $i$th row of $H_n$ is finite whenever $i\ge a_n$. Take a strictly increasing function $h$ with $h(n)\ge a_n$, and define \begin{equation}\label{eq:row-tail-LF} H=\bigcup_{n<\om}\{e\in H_n:\min e\ge h(n)\}. \end{equation} For fixed $i$, only finitely many $n$ satisfy $h(n)\le i$. For each of these $n$, the row $H_n(i)$ is finite. Hence every row of $H$ is finite, which implies local finiteness by the proof of Lemma~\ref{lem:LF-rows}. Moreover, $H_n\setminus H$ is covered by $[0,h(n))$. \end{proof} The ideal $\Lcal_k$ fails the ordinary $P$-ideal property modulo finite sets of hyperedges. Each full row belongs to $\Lcal_k$, whereas an upper bound modulo finite hyperedges of all full rows would have infinitely many infinite rows. \section{Canonical ideals generated by filters}\label{sec:canonical} The trace ideal records the sets in a free filter as independent vertex sets. Adjoining the finite-chromatic ideal imposes an additional requirement on countable upper bounds. We characterize this requirement by finite partitions and then by the ultrafilters extending the filter. \subsection{Trace ideals and canonical filters} An ideal on $E_k$ is downward closed and closed under finite unions. All hypergraph ideals considered below contain $\V_k$. Properness means $E_k\notin\mathcal J$. We write \[ \mathcal I+\mathcal J =\{H\subseteq E_k:(\exists I\in\mathcal I)(\exists J\in\mathcal J) \ H\subseteq I\cup J\}. \] The sum is the ideal generated by $\mathcal I\cup\mathcal J$. \begin{definition} For a free filter $\mathcal F$, its trace ideal is \[ T_k(\mathcal F)= \{H\subseteq E_k:(\exists X\in\mathcal F)\ H\cap[X]^k\in\V_k\}. \] For a proper ideal $\mathcal J$ containing $\V_k$, its canonical filter is \[ \mathcal F_{\mathcal J} =\{X\subseteq\om:A_X^{(k)}\in\mathcal J\}, \qquad A_X^{(k)}=E_k\setminus[X]^k. \] \end{definition} \begin{proposition}[Trace ideals]\label{prop:trace} Let $\mathcal F$ be a free filter. Then $T_k(\mathcal F)$ is a proper $W$-ray-proper ideal for every $W$ satisfying \eqref{eq:W}, and \[ T_k(\mathcal F)=\{H:(\exists X\in\mathcal F)\ H\subseteq A_X^{(k)}\}, \qquad \mathcal F_{T_k(\mathcal F)}=\mathcal F. \] Furthermore, \begin{enumerate} \item $T_k(\mathcal F)$ is a $\V_k$-$P$-ideal if and only if $\mathcal F$ is a $P$-filter; \item $\Gfc^{(k)}\subseteq T_k(\mathcal F)$ if and only if $\mathcal F$ is an ultrafilter. \end{enumerate} \end{proposition} \begin{proof} Suppose $H\cap[X]^k$ is covered by a finite set $F$. Then $Y=X\setminus F\in\mathcal F$ and $H\cap[Y]^k=\varnothing$, so $H\subseteq A_Y^{(k)}$. The reverse inclusion is immediate. The identity \begin{equation}\label{eq:AX-intersection} A_{X\cap Y}^{(k)}=A_X^{(k)}\cup A_Y^{(k)} \end{equation} shows that $T_k(\mathcal F)$ is an ideal. An infinite subset of $Y$ is independent for $H$, proving properness and $W$-ray-properness. If $A_Z^{(k)}\subseteq A_Y^{(k)}$ for some infinite $Y\in\mathcal F$, then $Y\subseteq Z$. A point of $Y\setminus Z$, together with $k-1$ other points of $Y$, would contradict the inclusion. Thus the canonical filter is exactly $\mathcal F$. Assume $\mathcal F$ is a $P$-filter and $H_n\subseteq A_{X_n}^{(k)}$ with $X_n\in\mathcal F$. Choose $X\in\mathcal F$ with $X\st X_n$ for all $n$. Then \[ H_n\setminus A_X^{(k)} \subseteq A_{X_n}^{(k)}\cap[X]^k \subseteq\Star_k(X\setminus X_n)\in\V_k. \] Conversely, let $X_n\in\mathcal F$ and take a common relative upper bound $H\in T_k(\mathcal F)$ for the $A_{X_n}^{(k)}$. Choose $Y\in\mathcal F$ with $H\cap[Y]^k=\varnothing$. For a finite cover $F_n$ of $A_{X_n}^{(k)}\setminus H$, an infinite $Y\setminus X_n$ would contain $k$ points outside $F_n$. Their hyperedge belongs to the difference and misses its cover. Hence $Y\st X_n$ for all $n$. If $\mathcal F$ is an ultrafilter, it contains one cell of every finite coloring, so it contains an independent set for every member of $\Gfc^{(k)}$. Conversely, if every $\Delta_kX$ belongs to the trace ideal, there is $Y\in\mathcal F$ with $\Delta_kX\cap[Y]^k=\varnothing$. Since $Y$ is infinite, it is contained in $X$ or in $X^c$. Thus $\mathcal F$ decides every subset of $\om$ and is an ultrafilter. \end{proof} \begin{lemma}[Canonical filter]\label{lem:canonical-filter} If $\mathcal J$ is a proper ideal containing $\V_k$, then $\mathcal F_{\mathcal J}$ is a free filter. If in addition $\Gfc^{(k)}\subseteq\mathcal J$ and $\mathcal J$ is a $\V_k$-$P$-ideal, then $\mathcal F_{\mathcal J}$ is a $P$-filter. \end{lemma} \begin{proof} We have $A_\om^{(k)}=\varnothing$. If a finite $X$ belonged to the canonical filter, both $A_X^{(k)}$ and $[X]^k$ would belong to $\mathcal J$, contradicting properness. Equation~\eqref{eq:AX-intersection} gives finite intersection closure. If $X\st Y$, then \[ A_Y^{(k)}\setminus A_X^{(k)}\subseteq\Star_k(X\setminus Y), \] which proves upward closure modulo finite and includes all cofinite sets. For the $P$-property, replace a given sequence by its successive finite intersections and write it as $X_0\supseteq X_1\supseteq\cdots$. Choose $H\in\mathcal J$ and finite $F_n$ such that \[ A_{X_n}^{(k)}\setminus H\subseteq\Star_k(F_n). \] For a vertex $v$, define its exit level \[ a(v)=\min\{n:v\notin X_n\}\in\om\cup\{\infty\}, \] where the minimum of the empty set is $\infty$, and put \begin{equation}\label{eq:exit-set} Y=\{v:a(v)=\infty\} \cup\bigcup_{n<\om}\{v\in F_n:a(v)\ge n\}. \end{equation} If $v\in Y\setminus X_m$, its exit level is at most $m$, and therefore it belongs to some $F_n$ with $n\le m$. Hence \[ Y\setminus X_m\subseteq\bigcup_{n\le m}F_n, \qquad Y\st X_m. \] We claim $[Y^c]^k\subseteq H$. Otherwise take $e\in[Y^c]^k\setminus H$ and let $n=\min\{a(v):v\in e\}$. All exit levels are finite, and $e\in A_{X_n}^{(k)}\setminus H$. Some $w\in e\cap F_n$ then satisfies $a(w)\ge n$, so \eqref{eq:exit-set} puts $w$ in $Y$, a contradiction. Finally, \[ A_Y^{(k)}=[Y^c]^k\cup\Delta_kY\in\mathcal J. \] Thus $Y\in\mathcal F_{\mathcal J}$, and properness ensures that $Y$ is infinite. \end{proof} \begin{proposition}[Infinite complete subhypergraphs]\label{prop:tree-clique} Suppose $\mathcal J\supseteq\Gfc^{(k)}$ is a $\V_k$-$P$-ideal. Every infinite $X\subseteq\om$ contains an infinite $B$ with $[B]^k\in\mathcal J$. In particular, $\Gfc^{(k)}$ is not a $\V_k$-$P$-ideal. \end{proposition} \begin{proof} Let $T=\{s\in\om^{<\om}:|s|\ge1\}$ and choose distinct labels $x_s\in X$. For $n<\om$, let $G_n$ consist of the hyperedges \[ \{x_{s_0},\ldots,x_{s_{k-1}}\}, \qquad s_0\subsetneq\cdots\subsetneq s_{k-1},\quad |s_0|=n+1. \] Color the labels at level $n+1$ with one color and all other vertices with another. Each edge of $G_n$ has exactly one vertex of the first color, so $G_n\in\Gfc^{(k)}$. Choose $H\in\mathcal J$ and finite $F_n$ covering $G_n\setminus H$. Select a branch $s_0\subsetneq s_1\subsetneq\cdots$, with $|s_n|=n+1$, so that $x_{s_n}\notin\bigcup_{j\le n}F_j$. At the first step there are infinitely many roots; at each later step there are infinitely many immediate successors. Thus every choice avoids the finite forbidden set. If $n_0<\cdotsf(r_n)$. If $r_n$ is the first element of $R$ at least $m$, then \[ t_R(m)=r_{n+k-1}>f(r_n)\ge f(m) \] for all sufficiently large $m$. Thus $\{t_R:R\in\mathcal A\}$ is a dominating family, and $|\mathcal A|\ge\mathfrak d$. For the upper bound in \eqref{eq:single-cardinal}, choose a $\pi$-base $\mathcal B$ of size $\pc(\mathcal F)$ and a dominating family $\mathcal D$ of size $\mathfrak d$, consisting of increasing functions $h$ with $h(i)>i$. Let $e_B:\om\to B$ be the increasing enumeration. For each pair $(B,h)$, define \[ i_0=0,\quad i_{n+1}=h(i_n),\qquad R_{B,h}=\{e_B(i_n):n<\om\}. \] Fix $G\in\mathcal J_{\mathcal F,k}$, and choose $X\in\mathcal F$ with $G\cap[X]^k\in\Lcal_k$. Select $B\in\mathcal B$ with $B\st X$. The pullback of $G\cap[B]^k$ under $e_B$ has finite rows above some index. Choose $g(i)$ strictly greater than every index occurring in its $i$th row for all sufficiently large $i$. Take $h\in\mathcal D$ with $g\le^*h$. For sufficiently large $n$, the next selected index $i_{n+1}$ exceeds every vertex index in the row with minimum $i_n$. Consequently the tail of $R_{B,h}$ is independent for $G$. Hyperedges of $W(R_{B,h})$ using earlier vertices form a finite set by local finiteness. Thus $R_{B,h}\in D_G^W$. The resulting family has size at most $\pc(\mathcal F)\cdot\mathfrak d=\max\{\pc(\mathcal F),\mathfrak d\}$. For \eqref{eq:countable-cardinal}, use a $\pi_\sigma$-base $\mathcal B$. Given $G_n\in\mathcal J_{\mathcal F,k}$, choose $X_n\in\mathcal F$ with $G_n\cap[X_n]^k\in\Lcal_k$, and one $B\in\mathcal B$ with $B\st X_n$ for every $n$. Pull back all the induced hypergraphs on $B$. Lemma~\ref{lem:LF-P} gives a locally finite relative upper bound $L$ for them. Choose $g$ bounding the rows of $L$, then $h\in\mathcal D$ as above. The resulting ray avoids $L$. Each difference between a pullback and $L$ has a finite vertex cover, so this one ray avoids all the $G_n$. The lower bound by $\pcs(\mathcal F)$ uses a countable sequence of endpoint hypergraphs, and the lower bound by $\mathfrak d$ already follows from the one-hypergraph case. Finally use \eqref{eq:pi-P}. \end{proof} \begin{theorem}[Small locally finite perturbations]\label{thm:small-extension} Suppose $\mathcal F$ is a free $P$-filter and $\mathcal H\subseteq\Lcal_k$ has size less than $\mathfrak b$. There is a locally finite hypergraph $L$ such that, for every $W$ satisfying \eqref{eq:W}, the ideal \[ \mathcal K=\Id\bigl(T_k(\mathcal F)\cup\{L\}\bigr) \] contains $T_k(\mathcal F)\cup\mathcal H$, is $W$-ray-proper and a $\V_k$-$P$-ideal, and satisfies \[ \nu_W(\mathcal K)=\nu_{W,\om}(\mathcal K)=\pc(\mathcal F). \] For any $\pi$-base $\mathcal B$, infinite subsets $B'\subseteq B$, one for each $B\in\mathcal B$, can be chosen so that $\{B':B\in\mathcal B\}$ avoids every member of $\mathcal K$. \end{theorem} \begin{proof} For $H\in\mathcal H$, choose $f_H\in\mathcal M_k$ from Lemma~\ref{lem:Bf}. Since $|\mathcal H|<\mathfrak b$, there is $f\in\mathcal M_k$ eventually dominating all $f_H$. Set $L=B_f^{(k)}$. Then $H\setminus L\in\V_k\subseteq T_k(\mathcal F)$, so $\mathcal K$ contains $\mathcal H$. In the countable case one can equivalently use the explicit row-tail bound \eqref{eq:row-tail-LF}. For each $B\in\mathcal B$, take an infinite $L$-independent $B'\subseteq B$. If $G\subseteq A_X^{(k)}\cup L$ with $X\in\mathcal F$, choose $B\st X$. Then $B'\st X$, and $W(B')$ meets $A_X^{(k)}$ only finitely while missing $L$. Thus the refined family avoids $G$. For a sequence $G_n\subseteq K_n\cup L$ with $K_n\in T_k(\mathcal F)$, choose a relative upper bound $K\in T_k(\mathcal F)$ by Proposition~\ref{prop:trace}. Then $K\cup L$ bounds the sequence in $\mathcal K$. Properness follows from the avoiding family. The lower bound $\pc(\mathcal F)$ follows from the endpoint hypergraphs. A family avoiding every single member of a relative $P$-ideal also avoids every countable sequence, by applying it to a common relative upper bound. \end{proof} Starting with a $\pi$-base of minimum size in Theorem~\ref{thm:small-extension} gives an avoiding family of size $\pc(\mathcal F)$. Adjoining fewer than $\mathfrak b$ members of $\Lcal_k$ therefore preserves this value. Adjoining all of $\Lcal_k$ gives the value $\max\{\pc(\mathcal F),\mathfrak d\}$ by Theorem~\ref{thm:cardinals}. \section{The Louveau ideal and the arity hierarchy}\label{sec:louveau} We now specialize the filter to a free ultrafilter $\mathcal U$. The $P$-point property determines countable closure of the capture ideals. The $Q$-point property determines whether their dependence on the arity is strict. \subsection{Absorption of locally finite hypergraphs} An independent set belonging to $\mathcal U$ places a hypergraph in $T_k(\mathcal U)$. The $Q$-point property provides such sets for every locally finite hypergraph by selecting well-separated vertices. \begin{theorem}[$Q$-points and local finiteness]\label{thm:Q-absorption} For a free ultrafilter $\mathcal U$ and $k\geq2$, the following are equivalent: \begin{enumerate} \item $\mathcal U$ is a $Q$-point; \item $\Lcal_k\subseteq T_k(\mathcal U)$; \item $\mathcal J_{\mathcal U,k}=T_k(\mathcal U)$. \end{enumerate} \end{theorem} \begin{proof} The equivalence of (ii) and (iii) follows from the definition of the ideal sum. Assume (ii), and let $\om=\dot\bigcup_n C_n$ be a partition into finite sets. The hypergraph \[ H=\bigcup_n[C_n]^k \] is locally finite. Choose $X\in\mathcal U$ and a finite vertex cover $F$ of $H\cap[X]^k$. Then \[ |(X\setminus F)\cap C_n|\leq k-1\qquad(n<\om). \] Partition $X\setminus F$ into $k-1$ sets, each meeting every $C_n$ in at most one point. Since their union belongs to $\mathcal U$, one of these sets belongs to $\mathcal U$. Thus $\mathcal U$ is a $Q$-point. Conversely, assume (i) and let $H\in\Lcal_k$. Remove a finite vertex set $F$ so that the remaining hypergraph is locally finite. Its \emph{two-shadow} is the graph joining two vertices whenever they occur together in some hyperedge. Each vertex belongs to finitely many hyperedges, each of finite size, so the two-shadow is locally finite. Choose $0=a_0\max F$ and, recursively, with every neighbor of a vertex below $a_{n+1}$ lying below $a_{n+2}$. Local finiteness makes each choice possible. Put $I_n=[a_n,a_{n+1})$. An edge of the two-shadow joins vertices in the same interval or in adjacent intervals. The $Q$-point property gives $X\in\mathcal U$ with $|X\cap I_n|\leq1$ for all $n$. Exactly one of the unions of the even and the odd intervals belongs to $\mathcal U$. Intersect $X$ with that union and remove the finite exceptional vertices, obtaining $Y\in\mathcal U$. No edge of the two-shadow has both endpoints in $Y$. Therefore $H\cap[Y]^k=\varnothing$, and $H\in T_k(\mathcal U)$. \end{proof} Petrenko and Protasov give a related characterization of $Q$-points by thin sets in locally finite metric spaces \cite[Remark~6.2]{PP2015}. \subsection{A successor-set basis for the Louveau ideal} Let $\om^{\uparrow<\om}$ be the set of finite strictly increasing sequences of natural numbers. We identify a member of $\R$ with its increasing enumeration. If $s$ is a nonempty finite sequence, $\max s$ denotes its last entry; set $\max\varnothing=-1$. For $i>\max s$, write $s^\frown i$ for the sequence obtained by appending $i$. A \emph{$\mathcal U$-Laver tree} is a nonempty tree $T\subseteq\om^{\uparrow<\om}$, closed under initial segments, with a stem $s_T\in T$ such that every node of $T$ is comparable with $s_T$ under extension, and \[ \succT_T(t)=\{i>\max t:t^\frown i\in T\}\in\mathcal U \qquad(t\in T,\ s_T\subseteq t). \] Its branch set $[T]$ consists of the infinite increasing sequences all of whose initial segments belong to $T$. A subtree in this definition is again a $\mathcal U$-Laver tree, whose stem extends or equals the original stem. \begin{definition} The \emph{Louveau ideal} $\louv_{\mathcal U}$ consists of all $A\subseteq\R$ such that every $\mathcal U$-Laver tree $T$ has a $\mathcal U$-Laver subtree $S\subseteq T$ with $[S]\cap A=\varnothing$. \end{definition} We use the increasing-sequence presentation of the Louveau ideal from \cite[Section~3, p.~2653]{BS1999}, following Louveau's construction \cite{Louveau1976}. Successor sets give an explicit basis for this ideal. For a family $\mathbf B=(B_s:s\in\om^{\uparrow<\om})$ with $B_s\in\mathcal U$, define \begin{equation}\label{eq:successor-null} N(\mathbf B)= \{R:\text{for infinitely many }n,\ r_n\notin B_{R\restr n}\}. \end{equation} We may always replace $B_s$ by $B_s\setminus[0,\max s]$. \begin{lemma}[Successor-set basis]\label{lem:louveau-basis} The sets $N(\mathbf B)$ form a cofinal family in $\louv_{\mathcal U}$ under inclusion. In particular, $\louv_{\mathcal U}$ is a proper $\sigma$-ideal. \end{lemma} \begin{proof} Given $T$ and $\mathbf B$, retain the stem of $T$ and restrict the successor set at each later node $s$ to $\succT_T(s)\cap B_s$. These intersections belong to $\mathcal U$. Every branch of the resulting subtree obeys $B_s$ at all stages beyond its stem, so it misses $N(\mathbf B)$. Thus every set in \eqref{eq:successor-null} belongs to $\louv_{\mathcal U}$. Conversely, let $A\in\louv_{\mathcal U}$. Call a finite increasing sequence $s$ \emph{good} if there is a $\mathcal U$-Laver tree with stem $s$ whose branch set misses $A$. Put $G_s=\{i>\max s:s^\frown i\text{ is good}\}$. If $G_s\in\mathcal U$, the corresponding trees can be joined at $s$ to form such a tree with stem $s$. Hence $s$ is good. If some $s$ were not good, then $\{i>\max s:i\notin G_s\}\in\mathcal U$. Repeating this observation at every nongood node produces a $\mathcal U$-Laver tree with stem $s$ all of whose nodes above the stem are nongood. The definition of $\louv_{\mathcal U}$ gives a subtree with branch set disjoint from $A$. Its stem is then a good node of the constructed tree, a contradiction. Thus every $s$ is good. For each $s$, choose a witnessing tree $T_s$ with stem $s$. For a finite increasing sequence $t$, let \[ B_t=(\max t,\infty)\cap \bigcap\{\succT_{T_s}(t):s\subseteq t,\ t\in T_s\}. \] There are only finitely many initial segments $s$ of $t$, and the displayed intersection includes $s=t$. Each factor belongs to $\mathcal U$, so $B_t\in\mathcal U$. If $R$ eventually obeys these successor sets, choose $N$ after its last violation and put $s=R\restr N$. An induction shows that $R\restr n\in T_s$ for every $n\geq N$: at such a node, the definition of $B_{R\restr n}$ includes its successor set in $T_s$. Hence $R\in[T_s]$, and $R\notin A$. This proves $A\subseteq N(\mathbf B)$. For countable closure, suppose $A_j\subseteq N(\mathbf B^{\,j})$. At a node $s$, put \[ C_s=\bigcap_{j\leq|s|}B_s^{\,j}\in\mathcal U. \] A branch eventually obeying $\mathbf C$ eventually obeys each $\mathbf B^{\,j}$. Therefore $\bigcup_jA_j\subseteq N(\mathbf C)$. The whole space is not null, since every $\mathcal U$-Laver tree has an infinite branch. A singleton $\{R\}$ is contained in $N(\mathbf B)$ by setting $B_{R\restr n}=\om\setminus\{r_n\}$ and choosing arbitrary members of $\mathcal U$ at the remaining nodes. Downward closure is immediate. \end{proof} The cofinal basis in Lemma~\ref{lem:louveau-basis} is the one used by Brendle and Shelah in their calculation of the cardinal characteristics of $\louv_{\mathcal U}$ \cite[proof of Theorem~2, p.~2654]{BS1999}. \subsection{The graph representation of the Louveau ideal} For a $P$-point, one set $X\in\mathcal U$ is almost contained in every successor set of a given basis element. A function $f$ bounds the finite exceptions at nodes with bounded maximum. For rays eventually contained in $X$, the graph bound $r_{n+1}>f(r_n)$ then ensures eventual obedience to all successor conditions along the ray. \begin{theorem}[The Louveau representation]\label{thm:louveau-identification} For every free ultrafilter $\mathcal U$, \[ \Icap_2(\mathcal U)\subseteq\louv_{\mathcal U}. \] Moreover, \begin{equation}\label{eq:louveau-identification} \Icap_2(\mathcal U)=\louv_{\mathcal U} \quad\Longleftrightarrow\quad \mathcal U\text{ is a }P\text{-point}. \end{equation} \end{theorem} \begin{proof} Fix $X\in\mathcal U$ and $f\in\mathcal M_2$. In any $\mathcal U$-Laver tree, restrict each successor set above a node $s$ to $X\cap(f(\max s),\infty)$, using $X$ at the empty node. Every branch of the resulting tree is eventually contained in $X$ and eventually satisfies $r_{n+1}>f(r_n)$. Thus $N_{X,f}^{(2)}\in\louv_{\mathcal U}$. The basis theorem for $\Icap_2(\mathcal U)$ gives the inclusion. Suppose now that $\mathcal U$ is a $P$-point, and let $A\in\louv_{\mathcal U}$. By Lemma~\ref{lem:louveau-basis}, choose $B_s\in\mathcal U$ with $A\subseteq N(\mathbf B)$. There are countably many finite increasing sequences, so take $X\in\mathcal U$ such that $X\st B_s$ for every $s$. For each $m$, only finitely many increasing sequences have maximum at most $m$. Choose a nondecreasing $f\in\mathcal M_2$ satisfying \begin{equation}\label{eq:louveau-threshold} f(m)>\max\left(\bigcup_{\max s\leq m}(X\setminus B_s)\right) \qquad(m<\om), \end{equation} with the maximum of the empty set interpreted as $-1$. If $R\notin N_{X,f}^{(2)}$, then eventually $r_n\in X$ and $r_{n+1}>f(r_n)$. Apply \eqref{eq:louveau-threshold} to $s=R\restr(n+1)$, whose maximum is $r_n$. It follows that $r_{n+1}\in B_s$ for all sufficiently large $n$. Hence $R\notin N(\mathbf B)$, and therefore $R\notin A$. We have shown $A\subseteq N_{X,f}^{(2)}$, so $A\in\Icap_2(\mathcal U)$. Conversely, equality with $\louv_{\mathcal U}$ makes $\Icap_2(\mathcal U)$ a $\sigma$-ideal. By Theorem~\ref{thm:basis}, this implies that $\mathcal U$ is a $P$-point. \end{proof} For comparison, Brendle and Shelah proved \begin{equation}\label{eq:BS-uniformity} \non(\louv_{\mathcal U}) =\max\{\pcs(\mathcal U),\mathfrak d\} \end{equation} for every free ultrafilter \cite[Theorem~2(c), p.~2654]{BS1999}. For $P$-points they obtained the formula with $\pc(\mathcal U)$ \cite[Corollary~3.2(c), p.~2656]{BS1999}. Theorems~\ref{thm:cardinals} and \ref{thm:louveau-identification} supply a hypergraph representation and a direct row-bound proof of that formula in the $P$-point case. Higher arities distinguish ideals even when their uniformities agree. \subsection{Strict dependence on the arity} Increasing the arity makes the condition $r_{n+k-1}\le f(r_n)$ stronger. To prove strict inclusion when $\mathcal U$ is not a $Q$-point, we select successive groups of exactly $k$ vertices from finite partition cells. Every $(k+1)$-element hyperedge then meets at least two groups, which the local-finiteness construction keeps independent of one another. \begin{theorem}[Arity classification]\label{thm:arity} For every free ultrafilter $\mathcal U$ and every $k\geq2$, \begin{equation}\label{eq:arity-inclusion} \Icap_{k+1}(\mathcal U)\subseteq\Icap_k(\mathcal U). \end{equation} Equality holds in \eqref{eq:arity-inclusion} if and only if $\mathcal U$ is a $Q$-point. If $\mathcal U$ is not a $Q$-point, there is a closed set $\mathcal A_k\subseteq\R$ such that \[ \mathcal A_k\in\Icap_k(\mathcal U) \setminus\Icap_{k+1}(\mathcal U). \] \end{theorem} \begin{proof} Take $X\in\mathcal U$ and $f\in\mathcal M_{k+1}$. The implication \[ r_{n+k}\leq f(r_n)\quad\Longrightarrow\quad r_{n+k-1}\leq f(r_n) \] shows that $N_{X,f}^{(k+1)}\subseteq N_{X,f}^{(k)}$. This proves the inclusion of the ideals. If $\mathcal U$ is a $Q$-point, Theorem~\ref{thm:Q-absorption} gives $\mathcal J_{\mathcal U,k}=T_k(\mathcal U)$ for every $k$. Every member of $T_k(\mathcal U)$ is contained in $A_X^{(k)}$ for some $X\in\mathcal U$. Consequently \begin{equation}\label{eq:Q-capture} \Icap_k(\mathcal U) =\{\mathcal A:(\exists X\in\mathcal U)(\forall R\in\mathcal A) \ R\not\st X\}, \end{equation} which does not depend on $k$. Suppose that $\mathcal U$ is not a $Q$-point. Fix a partition $\om=\dot\bigcup_m C_m$ into finite sets having no selector in $\mathcal U$. For every $X\in\mathcal U$ and every positive integer $j$, there are infinitely many $m$ with \begin{equation}\label{eq:large-blocks} |X\cap C_m|\geq j. \end{equation} Indeed, if $j=1$, the assertion follows because a finite union of finite blocks is finite. For $j\geq2$, failure of \eqref{eq:large-blocks} would, after deleting finitely many blocks, bound all intersection sizes by $j-1$. Partitioning the remaining $\mathcal U$-set into $j-1$ selectors would put one selector in $\mathcal U$, a contradiction. Fix $k\geq2$, and put $H_k=\bigcup_m[C_m]^k$. Define \begin{equation}\label{eq:closed-separator} \begin{split} \mathcal A_k=\{R=\{r_n:n<\om\}:\ & (\forall j<\om)(\exists m<\om)\\ &\{r_{kj},\ldots,r_{kj+k-1}\}\subseteq C_m\}. \end{split} \end{equation} For a fixed $j$, the condition in \eqref{eq:closed-separator} depends only on the first $k(j+1)$ entries of $R$. It therefore defines a clopen subset of $\R$. Their countable intersection $\mathcal A_k$ is closed in $\R$. Every $R\in\mathcal A_k$ has infinitely many consecutive $k$-windows in $H_k$, namely those starting at the indices $kj$. Thus \[ \mathcal A_k\subseteq\Gamma_k(H_k)\in\Icap_k(\mathcal U). \] We prove that $\mathcal A_k\notin\Icap_{k+1}(\mathcal U)$. Let $H\in\mathcal J_{\mathcal U,k+1}$. Choose $X\in\mathcal U$ such that $H\cap[X]^{k+1}$ is locally finite after a finite vertex deletion, and make that deletion from $X$. We recursively select $k$-element sets \[ b_i\subseteq X\cap C_{m_i},\qquad \max b_i<\min b_{i+1}, \] so that no new vertex belongs to an $H$-hyperedge meeting a previously chosen vertex. At a given stage the chosen vertex set is finite. Its incident hyperedges in $H\cap[X]^{k+1}$, and all vertices of those hyperedges, form a finite set. Exclude this set, all vertices below the previous maximum, and the previously used blocks. Only finitely many blocks are affected. Equation~\eqref{eq:large-blocks} supplies a remaining block containing at least $k$ points of $X$, from which to select the next $b_i$. Let $R=\bigcup_i b_i$. Since each $b_i$ has exactly $k$ elements and precedes $b_{i+1}$, it occupies the positions $ki,\ldots,ki+k-1$ in the increasing enumeration of $R$. Each $b_i$ lies in one block $C_{m_i}$, so $R\in\mathcal A_k$. Every $(k+1)$-element subset of $R$ meets at least two of the clusters $b_i$. If it were an $H$-hyperedge, a vertex in its latest cluster would belong to an $H$-hyperedge meeting an earlier chosen vertex, contrary to the construction. Thus \[ [R]^{k+1}\cap H=\varnothing. \] In particular, $R\notin\Gamma_{k+1}(H)$. Since $H$ was arbitrary, no single member of $\mathcal J_{\mathcal U,k+1}$ captures $\mathcal A_k$. The closed set $\mathcal A_k$ therefore witnesses strict inclusion in \eqref{eq:arity-inclusion}. \end{proof} \begin{corollary}\label{cor:strict-sigma-chain} If $\mathcal U$ is a $P$-point which is not a $Q$-point, then \[ \louv_{\mathcal U}=\Icap_2(\mathcal U) \supsetneq\Icap_3(\mathcal U) \supsetneq\Icap_4(\mathcal U)\supsetneq\cdots \] is a strictly decreasing sequence of proper $\sigma$-ideals, with each strict inclusion witnessed by a closed subset of $\R$. Every term has a cofinal family of $G_\delta$ sets and uniformity $\max\{\pc(\mathcal U),\mathfrak d\}$. \end{corollary} \begin{proof} Apply Theorems~\ref{thm:basis}, \ref{thm:cardinals}, \ref{thm:louveau-identification}, and \ref{thm:arity}. \end{proof} \begin{corollary}\label{cor:higher-louveau} For every free ultrafilter $\mathcal U$ and every $k\geq3$, \[ \Icap_k(\mathcal U)=\louv_{\mathcal U} \quad\Longleftrightarrow\quad \mathcal U\text{ is both a }P\text{-point and a }Q\text{-point}. \] \end{corollary} \begin{proof} Equality with the Louveau ideal implies that $\Icap_k(\mathcal U)$ is a $\sigma$-ideal, so Theorem~\ref{thm:basis} makes $\mathcal U$ a $P$-point. If it were not a $Q$-point, Theorem~\ref{thm:arity} would give $\Icap_k(\mathcal U)\subsetneq\Icap_2(\mathcal U)=\louv_{\mathcal U}$. Conversely, a $P$-point which is a $Q$-point satisfies the required equality by \eqref{eq:Q-capture} and Theorem~\ref{thm:louveau-identification}. \end{proof} \section{Stone duality and endpoint spectra}\label{sec:stone} The quotient by finite vertex covers translates relative pseudounions into countable neighborhood properties. We develop this correspondence for all finite arities. Throughout this section, the canonical witnesses are $P_R^{(k)}$. \subsection{The quotient space and its endpoint maps} Let \[ \mathbb B_k=\mathcal P(E_k)/\V_k, \qquad X_k=\Ult(\mathbb B_k). \] Here $\Ult(\mathbb B_k)$ is the Stone space of Boolean ultrafilters on $\mathbb B_k$. For $H\subseteq E_k$, its basic clopen set is \[ \wh H=\{p\in X_k:[H]_{\V_k}\in p\}. \] Equivalently, points of $X_k$ are ultrafilters on $E_k$ which are disjoint from $\V_k$, and we write $H\in p$ in this representation. The ultrafilter extension argument shows that these clopen sets separate points and that every cover by basic clopen sets has a finite subcover. Thus $X_k$ is compact, Hausdorff, and zero-dimensional. We use the usual Stone correspondence between Boolean algebras and their clopen algebras; see \cite{Koppelberg1989}. The passage to capture sets can identify distinct Boolean classes. For $k=2$, let $M=\{\{2n,2n+1\}:n<\om\}$. Then $M\notin\V_2$, but \[ \Gamma_2(E_2)=\Gamma_2(E_2\setminus M)=\R. \] Indeed, two consecutive edges of an increasing ray cannot both belong to the matching $M$, so every ray has infinitely many edges in $E_2\setminus M$. For later use, Boolean order gives \begin{equation}\label{eq:stone-order} H\setminus K\in\V_k \quad\Longleftrightarrow\quad \wh H\subseteq\wh K. \end{equation} To see the reverse implication directly, if $H\setminus K\notin\V_k$, its nonzero class extends to an ultrafilter, giving a point in $\wh H\setminus\wh K$. For $e=\{i_0<\cdots