Set Theory (Pure Basics)
by kamatadu, May 21, 2022, 6:16 PM
Definitions that I felt might be important
.
DEFINITION 1:
Now here are a few basic lemmas that help us make the definitions more firm
.
LEMMA 1:
Now for the part of Theorems of Algebra of Sets
.
LAWS OF ALGEBRA OF SETS:
REMARK 1:
REMARK 2:
Note: The last
points of REMARK 1 and all of REMARK 2 are especially powerful for proving the basic Theorems and Lemmas of Set Theory using Set Algebra
.
LEMMA 2:
Now moving onto the "final" section, VENN DIAGRAMS 1
.
VENN DIAGRAMS 1:
Here are some problems to wrap up this post
.
PROBLEMS 1:
WOOF!!
. That's all for this post
. See you again in the new post again!
Tysm for reading this post
. Oh and btw, for the people who know me from a few months back, if u even for once thought what is this dude doing, why is he doing all these things instead of MO. Unfortunately in not that much into MO as before as I stopped doing geo (the only thing I can :")) SAR plix halp this nub :"), u ORSMAX plix gib teeps :"), plix halp this NUMBAX.
ORSMAX SAR.

DEFINITION 1:
Definition 1 wrote:
Intervals:
is an Open-Interval,
is a Closed-Interval,
and
are both Half-Closed-Intervals/Half-Open-Intervals.
![\begin{align*}
x \in (a, b) \implies a < x < b \text{ and } x \in \mathbb{R}\\
x \in [a, b] \implies a \le x \le b \text{ and } x \in \mathbb{R}\\
x \in [a, b) \implies a \le x < b \text{ and } x \in \mathbb{R}\\
x \in (a, b] \implies a < x \le b \text{ and } x \in \mathbb{R}.
\end{align*}](//latex.artofproblemsolving.com/a/a/1/aa14572f4ce0f8ade9081ee440a491dbe9776c2e.png)
Example:
and
.
Null Set: A null set is a set
which has no elements in it.
Example:
.
Subset:
implies that each element of
is contained in
, i.e., if
, then
.
Example: For,
and
,
.
Equal Sets:
, if and only if the both the contents of the two sets are exactly the same, i.e,
if and only if every element of
is present in
and every element of
is present in
. In other words,
if and only if
and
.
Example: For,
and
,
.
Proper Subset:
, implies that
, but
, i.e,
is a subset of
but there exists at least one element in
that does not exist in
.
Example: For,
and
,
because
and
, but
.
Universal Set:
is the set of which all the sets in the current context are a subset of.
Example: For,
,
can be the set of integer.
Power Set: The Power Set of a given set
is the set of all its subsets. It is denoted by
. In other words,
.
Example: For,
,
.
Union of Sets:
is the set of all elements which either belong to
or to
or to both
and
. In other words
.
Example: For,
and
,
.
Intersection of Sets:
is the set of all elements which are common to
and
, i.e., it is the set of all elements that belong to both
and
. In other words
.
Example: For,
and
,
.
Disjoint Sets:
and
are disjoint if they have no elements in common. In other words,
and
are disjoint if
.
Example: For,
and
,
and
are disjoint.
Difference of Sets:
is the set of all elements which belong to
but do not belong to
. In other words,
.
Example: For,
and
,
.
Complement of a Set:
w.r.t its Universal Set
is the set of all elements which belong to
but do not belong to
. In other words
.
Example: For
and
,
.
Again,
represents an empty set, not just an element
!

![$[a, b]$](http://latex.artofproblemsolving.com/d/a/2/da2e551d2ca2155b8d8f4935d2e9757722c9bab6.png)

![$(a, b]$](http://latex.artofproblemsolving.com/8/a/6/8a6799ad7af20c84732b10d1f27910c31031b729.png)
![\begin{align*}
x \in (a, b) \implies a < x < b \text{ and } x \in \mathbb{R}\\
x \in [a, b] \implies a \le x \le b \text{ and } x \in \mathbb{R}\\
x \in [a, b) \implies a \le x < b \text{ and } x \in \mathbb{R}\\
x \in (a, b] \implies a < x \le b \text{ and } x \in \mathbb{R}.
\end{align*}](http://latex.artofproblemsolving.com/a/a/1/aa14572f4ce0f8ade9081ee440a491dbe9776c2e.png)
Example:


Null Set: A null set is a set

Example:

Subset:





Example: For,



Equal Sets:









Example: For,



Proper Subset:







Example: For,






Universal Set:

Example: For,


Power Set: The Power Set of a given set



Example: For,


Union of Sets:






Example: For,



Intersection of Sets:






Example: For,



Disjoint Sets:





Example: For,




Difference of Sets:




Example: For,



Complement of a Set:





Example: For






Now here are a few basic lemmas that help us make the definitions more firm

LEMMA 1:
Lemma 1 wrote:
Lemma 1.1:
for any set
.
Proof 1.1
Lemma 1.2:
for any set
.
Proof 1.2
Lemma 1.3: If
and
, then
.
Proof 1.3
and
.
Thus every element of
is in
.
Lemma 1.4:
and
if and only if
.
Proof 1.4
.
.
So every element of
is in
and every element of
is also in
which implies that
. The other direction is trivial.
Lemma 1.5: If
is a finite set and contains
elements, then
has
elements.
Proof 1.5


Proof 1.1
FTSOC, assume there exists some element
, for which
. This is a clear contradiction because
has no elements in it.



Lemma 1.2:


Proof 1.2
FTSOC, assume there exists some element
, for which
. This is again a clear contradiction.


Lemma 1.3: If



Proof 1.3


Thus every element of


Lemma 1.4:



Proof 1.4


So every element of





Lemma 1.5: If




Proof 1.5
Clearly,
is a subset of
.
No. of subsets of
containing
element =
,
No. of subsets of
containing
elements =
,
No. of subsets of
containing
elements =
, and so on upto
No. of subsets of
containing
element =
.
So, number of elements in



No. of subsets of



No. of subsets of



No. of subsets of



No. of subsets of



So, number of elements in

Now for the part of Theorems of Algebra of Sets

LAWS OF ALGEBRA OF SETS:
Laws of Algebra of Sets wrote:
Idempotent Laws: For any set
, we have:
Commutative Laws: For any two sets
and
, we have:
Associative Laws: For any three sets
,
and
, we have:
Distributive Laws: For any three sets
,
and
, we have:
De Morgan's Laws: For any two sets
and
, we have:
Identity Laws: Let
be the universal set,
the null set and
be any subset of
, then we have:
Complement Laws: Let
be the universal set,
the null set and
be any subset of
, then we have:

.
Commutative Laws: For any two sets


.
Associative Laws: For any three sets



.
Distributive Laws: For any three sets



.
De Morgan's Laws: For any two sets


.
Identity Laws: Let




.
Complement Laws: Let




.
REMARK 1:
Remark 1 wrote:
For any set
and
with their Universal Set
and
the null set, we have:




.
REMARK 2:
Remark 2 wrote:
For any set
and
, we have:




Note: The last


LEMMA 2:
Lemma 2 wrote:
Lemma 2.1: If
and
are two finite sets, then:

Proof 2.1
Lemma 2.2: If
,
and
are three finite sets, then:

Proof 2.2



Proof 2.1
Check the section of VENN DIAGRAMS 1.
Lemma 2.2: If




Proof 2.2

Now moving onto the "final" section, VENN DIAGRAMS 1

VENN DIAGRAMS 1:
Venn Diagrams 1 wrote:
For this section, I personally think that it is enough to look at the proof of Lemma 2.1 from the previous section
.
Lemma 2.1: If
and
are two finite sets, then:

Proof: Proof without words
.

Lemma 2.1: If



Proof: Proof without words

![[asy]
/* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; usepackage("amsmath"); size(10cm);
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */
pen dotstyle = black; /* point style */
real xmin = -8.84931052871598, xmax = 10.28357511267173, ymin = -8.483714463249195, ymax = 7.762516858738674; /* image dimensions */
pen ffxfqq = rgb(1,0.4980392156862745,0);
/* draw figures */
label("$A$",(-2.319135208610332,4.5),SE*labelscalefactor);
label("$B$",(1.905236966121085,4.5),SE*labelscalefactor);
label("$(A - B)$",(-5.681031397667418,-4.558568650894596),SE*labelscalefactor);
label("$(A \cap B)$",(-0.6645894401738601,-4.558568650894596),SE*labelscalefactor);
label("$(B - A)$",(4.791891285520887,-4.558568650894596),SE*labelscalefactor);
draw((-3.382425404859156,3.33)--(-0.6175745951408441,3.33), linewidth(0.8) + red);
draw((-0.8157585123728212,2.252)--(-4.815758512372821,2.252), linewidth(0.8) + red);
draw((-1.409064974446806,1.174)--(-5.409064974446807,1.174), linewidth(0.8) + red);
draw((-1.6042730196254558,0.096)--(-5.604273019625456,0.096), linewidth(0.8) + red);
draw((-1.4692471805854364,-0.982)--(-5.469247180585436,-0.982), linewidth(0.8) + red);
draw((-0.9591214912537801,-2.06)--(-4.95912149125378,-2.06), linewidth(0.8) + red);
draw((-0.22434350168733627,-3.138)--(-3.7756564983126637,-3.138), linewidth(0.8) + red);
draw((1.078,1.8777422613340735)--(1.078,3.4856729622843283), linewidth(0.8) + blue);
draw((1.078,-1.8777422613340735)--(1.078,-3.4856729622843283), linewidth(0.8) + blue);
draw((2.156,-3.6021748985855755)--(2.156,3.6021748985855755), linewidth(0.8) + blue);
draw((3.234,3.3878081409666634)--(3.234,-3.3878081409666634), linewidth(0.8) + blue);
draw((4.312,-2.766704899334223)--(4.312,2.766704899334223), linewidth(0.8) + blue);
draw((5.39,1.227965797569294)--(5.39,-1.227965797569294), linewidth(0.8) + blue);
draw((-1.5139335065203243,-0.8076331541942665)--(0.383651522548005,-2.7052181832625957), linewidth(0.8) + ffxfqq);
draw((1.0790218218431569,-1.8760662623195508)--(-1.524522220238197,0.7274777797618031), linewidth(0.8) + ffxfqq);
draw((1.5178550056523814,-0.7903772258905785)--(-1.1051012831051938,1.832579062866997), linewidth(0.8) + ffxfqq);
draw((1.5331687887385796,0.7188312112614201)--(-0.4203943135343359,2.6723943135343355), linewidth(0.8) + ffxfqq);
draw((-4.984,-4.282)--(-3.51,-2.258), linewidth(0.8),EndArrow(6));
draw((-0.013332063236100034,-4.294545389973884)--(0.01,-2.434), linewidth(0.8),EndArrow(6));
draw((5.4,-4.26)--(3.662,-2.214), linewidth(0.8),EndArrow(6));
draw(circle((-2,0), 3.6055512754639896), linewidth(0.8));
draw(circle((2,0), 3.6055512754639896), linewidth(0.8));
/* dots and labels */
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);
/* end of picture */
[/asy]](http://latex.artofproblemsolving.com/b/0/d/b0d1ffcee938129ff41ad8cbf0ee35448ed60766.png)
Here are some problems to wrap up this post

PROBLEMS 1:
Problems 1 wrote:
Problem 1.1: Determine whether the following are true or not:
Soln 1
Problem 1.2: For any three sets
,
and
, using Set Algebra, prove that:
Hint 1
Problem 1.3: For any two sets
and
, prove that
if and only if
.
Hint 1
.
Hint 3
if
then
if
then
.
Problem 1.4: For any two sets
and
, prove that:
Hint 1
.
Problem 1.5: For any two sets
and
, prove that:
Problem 1.6: For any two sets
and
, using Set Algebra, prove that:
Problem 1.7: For any three sets
,
and
, using Set Algebra, prove that:
Problem 1.8: In an examination,
of the candidates have passed in English,
have passed in Literature, while
have passed in both the subjects. Find the total number of candidates if
of them have failed in both the subjects.
Hint 1
Problem 1.9: In a survey concerning the smoking habits of consumers it was found that
smoke cigarette
,
smoke
,
smoke
,
smoke
and
,
smoke
and
,
smoke
and
,
smoke all the three brands. What percentage:
Hint 1
Problem 1.10: A factory inspector examined the defects in hardness, finishing and dimensions of an item. After examining
items he gave the following report:
All three defects -
, defect in hardness and finishing -
, defect in dimensions and finishing
, defect in dimensions and hardness -
. Defect in finishing
, in hardness -
and in dimensions -
. The inspector was fined why?
Hint 1
- For
and
, is
- For
and
, is
- For
and
, is
- For
and
, is
- For
and
, is
Soln 1
Yes!
Soln 2
No!
Soln 3
No!
Soln 4
No!
Soln 5
Yes!
Problem 1.2: For any three sets



.
Hint 1
Try to use
.

Problem 1.3: For any two sets




Hint 1
Try to use
if and only if
and
.
Hint 2









Problem 1.4: For any two sets


.
Hint 1

Problem 1.5: For any two sets



Problem 1.6: For any two sets


.
Problem 1.7: For any three sets



.
Problem 1.8: In an examination,




Hint 1
Try to use Lemma 2.1.
Problem 1.9: In a survey concerning the smoking habits of consumers it was found that
















- do not smoke
- smoke only
brand
- smoke exactly two brands of cigarettes?
Hint 1
Try to use Lemma 2.2.
Problem 1.10: A factory inspector examined the defects in hardness, finishing and dimensions of an item. After examining

All three defects -







Hint 1
Try to use Lemma 2.2.
Hint 2
Try to calculate no. of items which have defect in hardness alone.
WOOF!!










This post has been edited 49 times. Last edited by kamatadu, Jun 27, 2022, 6:45 PM
Reason: asdf
Reason: asdf