Category:Sandwich Principle
Jump to navigation
Jump to search
This category contains pages concerning Sandwich Principle:
Let $A$ be a class.
Let $g: A \to A$ be a mapping on $A$ such that:
- for all $x, y \in A$, either $\map g x \subseteq y$ or $y \subseteq x$.
Then:
- $\forall x, y \in A: x \subseteq y \subseteq \map g x \implies x = y \lor y = \map g x$
That is, there is no element $y$ of $A$ such that:
- $x \subset y \subset \map g x$
where $\subset$ denotes a proper subset.
Subcategories
This category has the following 2 subcategories, out of 2 total.
Pages in category "Sandwich Principle"
The following 11 pages are in this category, out of 11 total.
S
- Sandwich Principle
- Sandwich Principle for G-Towers
- Sandwich Principle for G-Towers/Corollary 1
- Sandwich Principle for G-Towers/Corollary 2
- Sandwich Principle for Minimally Closed Class
- Sandwich Principle for Slowly Progressing Mapping
- Sandwich Principle/Corollary 1
- Sandwich Principle/Corollary 2
- Sandwich Principle/Proof 1
- Sandwich Principle/Proof 2