Definition:Proper Subset
Definition
If a set $S$ is a subset of another set $T$, that is, $S \subseteq T$, and also:
- $S \ne T$
- $S \ne \O$
then $S$ is referred to as a proper subset of $T$.
The set $T$ properly contains, or strictly contains, the set $S$.
If $S \subseteq T$ and $S \ne T$, then the notation $S \subsetneqq T$ is used.
If we wish to refer to a set which we specifically require not to be empty, we can denote it like this:
- $\O \subsetneqq S$
and one which we want to specify as possibly being empty, we write:
- $\O \subseteq S$
Thus for $S$ to be a proper subset of $T$, we can write it as $\O \subsetneqq S \subsetneqq T$.
Proper Superset
If $S$ is a proper subset of $T$, then $T$ is a proper superset of $S$.
This can be expressed by the notation $T \supsetneqq S$.
This can be interpreted as $T$ properly contains $S$.
Improper Subset
$S$ is an improper subset of $T$ if and only if $S$ is a subset of $T$ but specifically not a proper subset of $T$.
That is, either:
- $S = T$
or:
- $S = \O$
Also known as
$S \subsetneqq T$ can also be read as:
- $S$ is properly included in $T$, or $T$ properly includes $S$
- $S$ is strictly included in $T$, or $T$ strictly includes $S$
The following usage can also be seen for $S \subsetneqq T$:
- $S$ is properly contained in $T$, or $T$ properly contains $S$
- $S$ is strictly contained in $T$, or $T$ strictly contains $S$
However, beware of the usage of contains: $S$ contains $T$ can also be interpreted as $S$ is an element of $T$.
Hence the use of contains is not supported on $\mathsf{Pr} \infty \mathsf{fWiki}$.
Notation
Notation in the literature for the concept of a subset can be confusing.
On $\mathsf{Pr} \infty \mathsf{fWiki}$, the convention is as follows:
- $\subseteq$ is used for the general subset
- $\subsetneq$ or $\subsetneqq$ is used for the concept of a proper subset.
The notation $\subset$ is deprecated on $\mathsf{Pr} \infty \mathsf{fWiki}$, on the grounds that it can mean either.
Also defined as
Some authors do not require that $S \ne \O$ for $S$ to be a proper subset of $T$.
Sources
- 1951: Nathan Jacobson: Lectures in Abstract Algebra: Volume $\text { I }$: Basic Concepts ... (previous) ... (next): Introduction $\S 1$: Operations on Sets
- 1955: John L. Kelley: General Topology ... (previous) ... (next): Chapter $0$: Subsets and Complements; Union and Intersection
- 1960: Paul R. Halmos: Naive Set Theory ... (previous) ... (next): $\S 1$: The Axiom of Extension
- 1961: John G. Hocking and Gail S. Young: Topology ... (previous) ... (next): A Note on Set-Theoretic Concepts
- 1963: George F. Simmons: Introduction to Topology and Modern Analysis ... (previous) ... (next): $\S 1$: Sets and Set Inclusion
- 1964: Steven A. Gaal: Point Set Topology ... (previous) ... (next): Introduction to Set Theory: $1$. Elementary Operations on Sets
- 1964: W.E. Deskins: Abstract Algebra ... (previous) ... (next): $\S 1.1$: Definition $1.1$
- 1964: William K. Smith: Limits and Continuity ... (previous) ... (next): $\S 2.1$: Sets
- 1965: A.M. Arthurs: Probability Theory ... (previous) ... (next): Chapter $1$: Set Theory: $1.2$: Sets and subsets
- 1965: J.A. Green: Sets and Groups ... (previous) ... (next): $\S 1.2$. Subsets
- 1965: Seth Warner: Modern Algebra ... (previous) ... (next): Chapter $\text {III}$: The Natural Numbers: $\S 17$: Finite Sets
- 1966: Richard A. Dean: Elements of Abstract Algebra ... (previous) ... (next): $\S 0.2$. Sets
- 1967: George McCarty: Topology: An Introduction with Application to Topological Groups ... (previous) ... (next): Introduction: Set-Theoretic Notation
- 1968: A.N. Kolmogorov and S.V. Fomin: Introductory Real Analysis ... (previous) ... (next): $1$ Set Theory: $1$. Sets and Functions: $1.1$: Basic definitions
- 1968: Ian D. Macdonald: The Theory of Groups ... (previous) ... (next): Appendix: Elementary set and number theory
- 1971: Allan Clark: Elements of Abstract Algebra ... (previous) ... (next): Chapter $1$: The Notation and Terminology of Set Theory: $\S 3$
- 1971: Robert H. Kasriel: Undergraduate Topology ... (previous) ... (next): $\S 1.3$: Subsets: Definition $3.2$
- 1971: Patrick J. Murphy and Albert F. Kempf: The New Mathematics Made Simple (2nd ed.) ... (previous) ... (next): Chapter $1$: Sets: Subsets
- 1971: Gaisi Takeuti and Wilson M. Zaring: Introduction to Axiomatic Set Theory: $\S 5.9$
- 1972: A.G. Howson: A Handbook of Terms used in Algebra and Analysis ... (previous) ... (next): $\S 2$: Sets and functions: Sets
- 1975: T.S. Blyth: Set Theory and Abstract Algebra ... (previous) ... (next): $\S 1$. Sets; inclusion; intersection; union; complementation; number systems
- 1975: Bert Mendelson: Introduction to Topology (3rd ed.) ... (previous) ... (next): Chapter $1$: Theory of Sets: $\S 2$: Sets and Subsets
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): Appendix $\text{A}.1$: Sets and Subsets
- 1978: John S. Rose: A Course on Group Theory ... (previous) ... (next): $0$: Some Conventions and some Basic Facts
- 1978: Thomas A. Whitelaw: An Introduction to Abstract Algebra ... (previous) ... (next): $\S 6$: Subsets
- 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation ... (previous) ... (next): Chapter $1$: Preliminaries: $1.4$ Set Notation
- 1981: G. de Barra: Measure Theory and Integration ... (previous) ... (next): Chapter $1$: Preliminaries: $1.1$ Set Theory
- 1981: Murray R. Spiegel: Theory and Problems of Complex Variables (SI ed.) ... (previous) ... (next): $1$: Complex Numbers: Point Sets: $14.$
- 1982: P.M. Cohn: Algebra Volume 1 (2nd ed.) ... (previous) ... (next): Chapter $1$: Sets and mappings: $\S 1.2$: Sets
- 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): inclusion
- 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): proper: 1.
- 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): subset or subclass
- 1993: Keith Devlin: The Joy of Sets: Fundamentals of Contemporary Set Theory (2nd ed.) ... (previous) ... (next): $\S 1$: Naive Set Theory: $\S 1.1$: What is a Set?
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): proper inclusion
- 1999: András Hajnal and Peter Hamburger: Set Theory ... (previous) ... (next): $1$. Notation, Conventions: $5$
- 2000: James R. Munkres: Topology (2nd ed.) ... (previous) ... (next): $1$: Set Theory and Logic: $\S 1$: Fundamental Concepts
- 2002: Thomas Jech: Set Theory (3rd ed.) ... (previous) ... (next): Chapter $1$: Power Set
- 2008: Paul Halmos and Steven Givant: Introduction to Boolean Algebras ... (previous) ... (next): Appendix $\text{A}$: Set Theory: Sets and Subsets
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): proper inclusion
- 2010: Raymond M. Smullyan and Melvin Fitting: Set Theory and the Continuum Problem (revised ed.) ... (previous) ... (next): Chapter $3$: The Natural Numbers: $\S 4$ A double induction principle and its applications
- 2012: M. Ben-Ari: Mathematical Logic for Computer Science (3rd ed.) ... (previous) ... (next): Appendix $\text{A}.2$: Definition $\text{A}.3$