Back to the index. Or to the chambers
This article has 11 links. View as Cloud or List.
| 1 | Category |
| 1 | Partial Order |
| 1 | Opposite |
| 1 | Collection |
| 1 | Empty Set |
| 1 | Set |
| 2 | Zorns Lemma |
| 2 | Quasi Order |
| 2 | Sheaf |
| 2 | Site |
| 2 | Structure Preserving Mappings |
Loading ...
Planetmath Browser (2008—2009)
BSD licence | A django site
All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.
→ The original article on PlanetMath.org
Other Formats: LaTeX
Superset
Given two sets
and
,
is a superset of
if every element in
is also in
. We denote this relation as
. This is equivalent to saying that
is a subset
of
, that is
.
Similar rules to those that hold for
also hold for
.
If
and
, then
.
Every set is a superset of itself, and every set is a superset of the empty set.
We say
is a proper superset of
if
and
. This relation is sometimes denoted by
,
but
is often used to mean the more general superset relation,
so it should be made explicit when “proper superset” is intended,
possibly by using
or
(or
or
).
One will occasionally see a collection
of subsets of some set
made into a partial order
“by containment”. Depending on context this can mean defining a partial order where
means
, or it can mean defining the opposite
partial order:
means
. This is frequently used when applying Zorn's lemma.
One will also occasionally see a collection
of subsets of some set
made into a category, usually by defining a single abstract morphism
whenever
(this being a special case of the general method of treating pre-orders
as categories). This allows a concise definition of presheaves
and sheaves, and it is generalized when defining a site.