ConceptMathematics
Cartesian product
A product of two sets formed by taking all ordered pairs of elements from each set.
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
5Each in their own terms, from the easiest level.
Vicky Neale
The set of all ordered pairs where is from set and is from set .James Munro
Given sets A and B, the Cartesian product is the set of all ordered pairs where and .Bartosz Milewski
The set of all ordered pairs formed by taking an element from each of two sets.Casey Rodriguez
The Cartesian product of two sets A and B is the set of all ordered pairs of elements from those sets.Francis Su
The product of two sets A and B is the set of ordered pairs where and .
Lectures that assume it
16The first 12 are shown.
- Algebra of Sets, De Morgan's Laws, Truth Tables & Cardinality
- Generating Functions & Roots of Unity Filter in Combinatorics
- Introduction, Finite Automata, Regular Expressions
- Relations and Equivalence Relations
- Compactness and the Heine-Borel Theorem
- Deterministic Communication Complexity
- The Binomial Theorem, Combinatorial Identities & Set Notation
- Complex Numbers
- Category Theory: Monoid in the Category of Endofunctors
- A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies
- Category Theory 7.1: Functoriality and Bifunctors
- An Introduction to Open 3-Manifolds (Part 1)
Connections
31The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures24
- Binomial Theorem and Sets
- Cantor's Remarkable Theorem and the Rationals' Lack of the Least Upper Bound Property
- Function Objects and Exponentials in Category Theory
- Category Theory: Functions and Epimorphisms
- Natural Numbers, Well-Ordering & Mathematical Induction
- Constructing the Rational Numbers
Show 18 moreShow fewer
- Category Theory 4.2: Products
- Formal Logical Notation, Quantifiers & Constructing Mathematical Proofs
- Algebra of Sets, De Morgan's Laws, Truth Tables & Cardinality
- Generating Functions & Roots of Unity Filter in Combinatorics
- Introduction, Finite Automata, Regular Expressions
- Relations and Equivalence Relations
- Compactness and the Heine-Borel Theorem
- Deterministic Communication Complexity
- The Binomial Theorem, Combinatorial Identities & Set Notation
- Complex Numbers
- Category Theory: Monoid in the Category of Endofunctors
- A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies
- Category Theory 7.1: Functoriality and Bifunctors
- An Introduction to Open 3-Manifolds (Part 1)
- Join Algorithms
- More on Generating Functions
- A Crash Course in Category Theory
- What Does String Topology Know About the Manifold It Lives On?