(This problem appeared in face of me trying to generalize [my theory](http://www.mathematics21.org/algebraic-general-topology.html) of (binary) funcoids to the theory of $n$-ary funcoids (I call them "multifuncoids") for arbitrary $n$.)


Let $I$ is some indexing set.


By filters I will mean (not necessarily proper) filters on some fixed set $U$.


I will call a *multifuncoid* a $I$-ary relation $f$ between subsets of $U$ such that 


1. for
every $k \in I$, subsets $A$ and $B$ of $U$, and family $L = L\_{i \in I \setminus \{ k \}}$ of subsets of $U$ we have
$$ f ( L \cup \{ (k ; A \cup B) \} ) \Leftrightarrow f ( L \cup \{ (k ; A) \} ) \vee f ( L \cup \{ (k ; B) \} ) . $$
2. for every $k \in I$, and family $L = L\_{i \in I}$ we have $L\_k=\emptyset \Rightarrow \neg f (L)$.


Let $a = a\_{i \in I}$ is some family of filters.


I will call *funcoidal product* $\prod a$ of a family $a = a\_{i \in
I}$ of filters an $I$-ary relation between subsets of $U$ such that for every
family $R = R\_{i \in I}$ of sets we have
$$ \left( \prod a \right) R \Leftrightarrow \forall i \in I \forall A \in a\_i
 : A \cap R\_i \neq \emptyset . $$
It simple to show that funcoidal product is a multifuncoid.


**Conjecture**
For every non-empty multifuncoid $f$ there exist a family $a = a\_{i \in I}$
of ultrafilters such that $f \supseteq \prod a$.


If this conjecture is false, under which additional conditions it will be
true? (I know that it is true for finite set $I$, but am interested also in
the infinite case.)


~~Addition:
I think that the following condition may be necessary:
$f(\{(i;A\_i\cup B\_i) | i\in I\}) \Leftrightarrow f(\{(i;A\_i) | i\in I\}) \vee f(\{(i;B\_i) | i\in I\})$ for each families $A=A\_{i\in I}$ and $B=B\_{i\in I}$ of subsets of $U$.~~

Special infinitary relations and ultrafilters
For $a$ an $I$-indexed family of filters and $S$ an $I$-indexed family of subsets of $U$ such that $U\smallsetminus S\_i\notin a\_i$ for every $i\in I$, define the restricted product $\prod^Sa$ by
$$\left(\prod\nolimits^Sa\right)R\Leftrightarrow\left(\prod a\right)R\land\{i\in I:R\_i\ne S\_i\}\text{ is finite.}$$
This is again a nonempty multifuncoid.


Then:


1. Every nonempty multifuncoid $f$ contains a restricted product of ultrafilters. Fix $S$ such that $f(S)$. For every $J\subseteq I$ finite, let $A\_J$ be the set of sequences $a$ of ultrafilters such that $S\_i\in a\_i$ for every $i$, and $f(R)$ holds for every $R$ where $R\_i\in a\_i$ for $i\in J$, and $R\_i=S\_i$ for $i\notin J$. Then $A\_J$ is closed in $(\beta U)^I$, $A\_J\cap A\_{J'}\supseteq A\_{J\cup J'}$, and $A\_J\ne\varnothing$ by the finite case, hence there exists $a\in\bigcap\_JA\_J$ by compactness of $(\beta U)^I$. Then $f\supseteq\prod^Sa$.
2. The restricted product of an infinite family of ultrafilters does not contain any product of a family of ultrafilters (assuming $U$ has more than one element), thus refuting the original wording of your conjecture. Indeed, if $f=\prod^Sa$ and $f(R)$, then $R\_i=S\_i$ for all but finitely many $i$, whereas if $g=\prod b$ is a product of a family of ultrafilters, we can for every $i\in I$ fix $R\_i\in b\_i$ such that $R\_i\ne S\_i$; then $g(R)$, but not $f(R)$, so $g\nsubseteq f$.


Point 1 says that the intuition behind the conjecture is basically sound, but the notion of the product has to be modified to make it really work to take into account that the axioms of multifuncoids only concern local behaviour when a single (or finitely many, by iteration) coordinate is changed, they do not imply anything about what happens when infinitely many coordinates change.


Since the proof above refers to the case of finitely many coordinates in a stronger form than what is claimed to hold in the question, I may as well give a self-contained proof of 1.


As before, fix $S$ such that $f(S)$. By definition, $S\_i\ne\varnothing$ for every $i$. If $a$ is a family of filters such that $S\_i\in a\_i$ for all $i\in I$, consider a modified product
\begin{align}
\left(\prod\nolimits\_ma\right)R&\Leftrightarrow(\forall i\in I)\,R\_i\in a\_i,\\
\left(\prod\nolimits\_m^Sa\right)R&\Leftrightarrow\left(\prod\nolimits\_ma\right)R\land\{i\in I:R\_i\ne S\_i\}\text{ is finite.}
\end{align}`
Note that if all $a\_i$ are ultrafilters, then $\prod\_ma=\prod a$, and $\prod\_m^Sa=\prod^Sa$. It thus suffices to find $a$ such that $\prod\_m^Sa\subseteq f$, and all $a\_i$ are ultrafilters.


Let $P$ be the set of all families $a$ of proper filters such that $S\_i\in a\_i$ for all $i$, and $\prod\_m^Sa\subseteq f$. We define a partial order on $P$ by $a\le b$ iff $a\_i\subseteq b\_i$ for all $i\in I$. It is easy to see from the definition of a multifuncoid that:


(\*) Whenever $f(R)$, $R\_i\subseteq R'\_i$ for every $i$, and $R\_i=R'\_i$ for all but finitely many $i$, then $f(R')$.


It follows that $P$ is nonempty, since $a\in P$, where $a\_i$ is the filter generated by $S\_i$. Since the pointwise union of any chain in $P$ is an element of $P$, Zorn’s lemma implies that there exists a maximal element $a\in P$.


I claim that every $a\_j$ is an ultrafilter. Assume for contradiction that it is not, and let $X\subseteq U$ be such that $X,U\smallsetminus X\notin a\_j$. Define $b$ by $b\_i=a\_i$ for $i\ne j$, and $b\_j$ is the filter generated by $a\_j\cup\{X\}$. Since $a< b$, we have $b\notin P$, thus there exists $R$ such that $\neg f(R)$, $R\_i=S\_i$ for all but finitely many $i$, $R\_i\in a\_i$ for all $i\ne j$, and $X\cap Y\subseteq R\_j$ for some $Y\in a\_j$. Symmetrically, there exists $R'$ and $Y'\in a\_j$ such that $\neg f(R')$, $R'\_i=S\_i$ for all but finitely many $i$, $R'\_i\in a\_i$ for $i\ne j$, and $(U\smallsetminus X)\cap Y'\subseteq R'\_j$. Using (\*) and the closure of $a\_i$ under intersections, we can replace $R\_i$ with $R\_i\cap R'\_i$ for all $i\ne j$, and the same for $R'\_i$. Thus, without loss of generality, $R\_i=R'\_i$ for all $i\ne j$. But then by the definition of a multifuncoid, $\neg f(R'')$, where $R''\_i=R\_i=R'\_i$ for $i\ne j$, and $R''\_j=R\_j\cup R'\_j$. However, $R''\_j\supseteq Y\cap Y'\in a\_j$, hence $R''\in\prod\_m^Sa\subseteq f$, a contradiction.


$%%%%$


