Families of sets | Basic concepts in set theory

Disjoint sets

In mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets, while {1, 2, 3} and {3, 4, 5} are not disjoint. A collection of two or more sets is called disjoint if any two distinct sets of the collection are disjoint. (Wikipedia).

Disjoint sets
Video thumbnail

What are Disjoint Sets? | Set Theory

What are disjoint sets? That is the topic of discussion in today's lesson! Two sets, A and B, are disjoint if and only if A intersect B is equal to the empty set. This means that two sets are disjoint if and only if they have no elements in common. This is the same as the two sets being "m

From playlist Set Theory

Video thumbnail

Divisibility Rules

This video covers the divisibility rules for 2,3,4,5,6,8,9,and 10. http://mathispower4u.yolasite.com/

From playlist Factors, Prime Factors, and Least Common Factors

Video thumbnail

Disjoint Sets Examples and Non-Examples | Set Theory

We see several examples and nonexamples of disjoint sets! Recall that two sets are disjoint if they have no common elements, meaning their intersection is empty. Thus, by definition, the empty set is disjoint from every set, including itself. #SetTheory What are Disjoint Sets: https://you

From playlist Set Theory

Video thumbnail

Partitions of a Set | Set Theory

What is a partition of a set? Partitions are very useful in many different areas of mathematics, so it's an important concept to understand. We'll define partitions of sets and give examples in today's lesson! A partition of a set is basically a way of splitting a set completely into disj

From playlist Set Theory

Video thumbnail

Introduction to sets || Set theory Overview - Part 1

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other #sets. The #set with no element is the empty

From playlist Set Theory

Video thumbnail

9.3.1 Sets: Definitions and Notation

9.3.1 Sets: Definitions and Notation

From playlist LAFF - Week 9

Video thumbnail

Distributive Law for Sets A u (B n C) = (A u B) n (A u C) Set Theory Proof

Please subscribe:) https://goo.gl/JQ8Nys Distributive Law for Sets A u (B n C) = (A u B) n (A u C) Set Theory Proof B-Roll - Islandesque by Kevin MacLeod is licensed under a Creative Commons Attribution license (https://creativecommons.org/licenses/by/4.0/) Source: http://incompetech.com

From playlist Functions, Sets, and Relations

Video thumbnail

Proof of the Distributive Law for Sets

Proof of the Distributive Law for Sets

From playlist Set Theory

Video thumbnail

MAST30026 Lecture 7: Constructing topological spaces (Part 2)

I defined the disjoint union of topological spaces, quotient spaces and the pushout. Lecture notes: http://therisingsea.org/notes/mast30026/lecture7.pdf The class webpage: http://therisingsea.org/post/mast30026/ Have questions? I hold free public online office hours for this class, every

From playlist MAST30026 Metric and Hilbert spaces

Video thumbnail

Proof: Menger's Theorem | Graph Theory, Connectivity

We prove Menger's theorem stating that for two nonadjacent vertices u and v, the minimum number of vertices in a u-v separating set is equal to the maximum number of internally disjoint u-v paths. If you want to learn about the theorem, see how it relates to vertex connectivity, and see

From playlist Graph Theory

Video thumbnail

Intro to Menger's Theorem | Graph Theory, Connectivity

Menger's theorem tells us that for any two nonadjacent vertices, u and v, in a graph G, the minimum number of vertices in a u-v separating set is equal to the maximum number of internally disjoint u-v paths in G. The Proof of Menger's Theorem: https://youtu.be/2rbbq-Mk-YE Remember that

From playlist Graph Theory

Video thumbnail

Danny Calegari: Big Mapping Class Groups - lecture 2

Part I - Theory : In the "theory" part of this mini-course, we will present recent objects and phenomena related to the study of big mapping class groups. In particular, we will define two faithful actions of some big mapping class groups. The first is an action by isometries on a Gromov-h

From playlist Topology

Video thumbnail

Lecture 8: Lebesgue Measurable Subsets and Measure

MIT 18.102 Introduction to Functional Analysis, Spring 2021 Instructor: Dr. Casey Rodriguez View the complete course: https://ocw.mit.edu/courses/18-102-introduction-to-functional-analysis-spring-2021/ YouTube Playlist: https://www.youtube.com/watch?v=cqdUuREzGuo&list=PLUl4u3cNGP63micsJp_

From playlist MIT 18.102 Introduction to Functional Analysis, Spring 2021

Video thumbnail

Introduction to sets || Set theory Overview - Part 2

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other #sets. The #set with no element is the empty

From playlist Set Theory

Video thumbnail

L01.5 Simple Properties of Probabilities

MIT RES.6-012 Introduction to Probability, Spring 2018 View the complete course: https://ocw.mit.edu/RES-6-012S18 Instructor: John Tsitsiklis License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu

From playlist MIT RES.6-012 Introduction to Probability, Spring 2018

Video thumbnail

What are Vertex Disjoint Paths? | Graph Theory

What are vertex disjoint paths in graph theory? Sometimes called pairwise vertex disjoint paths, they're exactly what you'd expect. We say two paths are vertex disjoint if they have no common vertices! We go over some examples, talk about internally disjoint paths, maximum numbers of inter

From playlist Graph Theory

Video thumbnail

Benson Farb, Part 3: Reconstruction problems in geometry and topology

29th Workshop in Geometric Topology, Oregon State University, June 30, 2012

From playlist Benson Farb: 29th Workshop in Geometric Topology

Video thumbnail

Proof: Cosets are Disjoint and Equal Size

Explanation for why cosets of a subgroup are either equal or disjoint and why all cosets have the same size. Group Theory playlist: https://www.youtube.com/playlist?list=PLug5ZIRrShJHDvvls4OtoBHi6cNnTZ6a6 0:00 Cosets are disjoint 3:15 Cosets have same size Subscribe to see more new math

From playlist Group Theory

Related pages

Hyperplane separation theorem | Metric space | Separated sets | Closure (topology) | Finite set | Topology | Infinite set | Separoid | Intersection (set theory) | Set packing | Empty set | Helly family | Disjoint union | Neighbourhood (mathematics) | Binary relation | Element (mathematics) | Mathematics | Set (mathematics) | Partition of a set | Union (set theory) | Real number | Family of sets | Positively separated sets | Equivalence relation | Almost disjoint sets | Disjoint-set data structure