ConceptMathematics
Subset
A set is a subset of if every element of is also an element of .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Vicky Neale
Casey Rodriguez
A set A is a subset of B if every element in A is an element in B.Francis Su
A set A is a subset of B if every element in A is also in B.Norvin Richards
A relation where all elements of one set are contained within another set.
Lectures that assume it
44The first 12 are shown.
- Cantor's Theory of Cardinality (Size)
- The Archimedian Property, Density of the Rationals, and Absolute Value
- Graph Theory and Coloring
- Cantor Diagonalization and Metric Spaces
- Algebra of Sets, Truth Tables, and Cardinality
- Functions
- The Fourier Expansion and Basic Formulas
- Algebra of Sets, De Morgan's Laws, Truth Tables & Cardinality
- The Least Upper Bound Property
- Natural Numbers and Induction
- The Characterization of the Real Numbers
- Story Proofs, Axioms of Probability
Connections
58The lectures that define it or assume it, and the concepts next to it.
Concepts8
Show 2 moreShow fewer
Lectures50
- Sets, Set Operations and Mathematical Induction
- Binomial Theorem and Sets
- Natural Numbers, Well-Ordering & Mathematical Induction
- Constructing the Rational Numbers
- Functions, Injections, Surjections, Bijections & Inverses
- Semantics, Part 2
Show 44 moreShow fewer
- Cantor's Theory of Cardinality (Size)
- The Archimedian Property, Density of the Rationals, and Absolute Value
- Graph Theory and Coloring
- Cantor Diagonalization and Metric Spaces
- Algebra of Sets, Truth Tables, and Cardinality
- Functions
- The Fourier Expansion and Basic Formulas
- Algebra of Sets, De Morgan's Laws, Truth Tables & Cardinality
- The Least Upper Bound Property
- Natural Numbers and Induction
- The Characterization of the Real Numbers
- Story Proofs, Axioms of Probability
- Principle of Induction
- Countable and Uncountable Sets
- Complexity: P, NP, NP-completeness, Reductions
- Relations and Equivalence Relations
- Independence
- Limit Points
- Basic Group Theory
- Complexity: Approximation Algorithms
- The Binomial Theorem, Combinatorial Identities & Set Notation
- Cantor's Remarkable Theorem and the Rationals' Lack of the Least Upper Bound Property
- Functions - Limits and Continuity
- Probability and Counting
- Foundations of University Mathematics: From Calculation to Proof
- Construction of the Reals
- Birthday Problem, Properties of Probability
- Hard Lefschetz Theorem and Hodge-Riemann Relations for Combinatorial Geometries
- Compact Sets
- Restrictions and the Goldreich-Levin Theorem
- Pigeonhole Principle
- Even Ordinals and the Kunen Inconsistency
- Inner Simplicity vs. Outer Simplicity
- Real Analysis: Ordinal Numbers and Transfinite Induction
- Hardness vs. Randomness I
- Hardness vs. Randomness II
- Itō Calculus
- Connected Sets, Cantor Sets
- Linear Algebra: Vector Spaces and Operators
- Basics of Communication Complexity
- Stable Estimators for Fast Private Statistics
- The Continuum Hypothesis and Other Set-Theoretic Ideas for Non-Set-Theorists (Part 1)
- Minimal Models and Beta-Categoricity
- Formal Logical Notation, Quantifiers & Constructing Mathematical Proofs