## Return to Answer

3 +addendum

Addendum (Adam Bjorndahl):

This construction can be viewed as a generalization of the quantifier duality$$\forall \equiv \lnot \exists \lnot.$$

As above, fix a set $X$. For $F \subseteq 2^{X}$, define the formula $(\text{F}x) \ \phi(x)$ to mean that$$\{x \in X : \phi(x)\} \in F.$$So $(\text{F}x) \ \phi(x)$ might be read "for $F$-many $x$, property $\phi$ holds". Three special cases deserve some attention.

• When $F = \{X\}$, we recover the usual "for all" quantifier. Succinctly, $\forall = \{X\}$.

• Dualizing, we obtain$$\lnot (\text{F}x) \lnot \phi(x) \iff \{x \in X : \lnot \phi(x)\} \notin F;$$thus if $A = \{x \in X : \phi(x)\}$, we have$$\lnot (\text{F}x) \lnot \phi(x) \iff A \in F^{*} \iff (\text{F}^{*}x) \phi(x),$$where $F^{*}$ is the blocker of $F$.

• Finally, if $U \subset 2^{X}$ is an ultrafilter on $X$, then$$\lnot (\text{U}x) \lnot \phi(x) \iff (\text{U}x)\phi(x),$$which exhibits ultrafilters as self-dual quantifiers, a perspective I find appealing.

• 2 fixed typo

A very simple and important notion of duality is the following.

Start with a collection $F$ of subsets of a ground set $X$.

Now, define the blocker $F^*$ of $F$ as follows:

$F^*=${$X \backslash A: A \notin F$}.

In words, we take the complements of all sets not in $F$.

This notion is very important in combinatorial optimization and polyhedral combinatorics. It is also a simple manifestation of Alexabder Alexander duality from algebraic topology.

1 [made Community Wiki]

A very simple and important notion of duality is the following.

Start with a collection $F$ of subsets of a ground set $X$.

Now, define the blocker $F^*$ of $F$ as follows:

$F^*=${$X \backslash A: A \notin F$}.

In words, we take the complements of all sets not in $F$.

This notion is very important in combinatorial optimization and polyhedral combinatorics. It is also a simple manifestation of Alexabder duality from algebraic topology.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 28, "mathjax_display_tex": 5, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8817840814590454, "perplexity_flag": "head"}