From e3ce071f1fe81a13c71eb4516e89c533b4856a6f Mon Sep 17 00:00:00 2001 From: Luc Date: Sat, 2 Dec 2023 13:43:29 +0100 Subject: [PATCH] Updated sets.md --- docs/en/mathematics/set-theory/sets.md | 12 ++++++++---- 1 file changed, 8 insertions(+), 4 deletions(-) diff --git a/docs/en/mathematics/set-theory/sets.md b/docs/en/mathematics/set-theory/sets.md index 559a457..f05f68f 100644 --- a/docs/en/mathematics/set-theory/sets.md +++ b/docs/en/mathematics/set-theory/sets.md @@ -10,18 +10,22 @@ Examples are $\mathbb{N}$, the set of natural numbers. $\mathbb{Z}$, the set of > *Definition*: suppose $A$ and $B$ are sets. Then $A$ is called a subset of $B$, if for every element $a \in A$ there also is $a \in B$. Then $B$ contains $A$ and can be denoted by $A \subseteq B$. -The extra line under the symbol implies properness. A subset $A$ of a set $B$ which is not the empty set $\empty$ nor the full set $B$ is called a proper subset of $B$, denoted by $A \subsetneq B$. For example $\mathbb{N} \subsetneq \mathbb{Z}$. +The extra line under the symbol implies properness. A subset $A$ of a set $B$ which is not the empty set $\varnothing$ nor the full set $B$ is called a proper subset of $B$, denoted by $A \subsetneq B$. For example $\mathbb{N} \subsetneq \mathbb{Z}$.
> *Definition*: if $B$ is a set, then $\wp(B)$ denotes the set of all subsets $A$ of $B$. The set $\wp(B)$ is called the power set of $B$. -Suppose for example that $B = {x,y,z}$, then $\wp(B) = \{\empty,\{x\},\{y\},\{z\},\{x,y\},\{x,z\},\{y,z\},\{x,y,z\}\}$. +Suppose for example that $B = {x,y,z}$, then $\wp(B) = \{\varnothing,\{x\},\{y\},\{z\},\{x,y\},\{x,z\},\{y,z\},\{x,y,z\}\}$.
> *Proposition*: let $B$ be a set with $n$ elements. Then its power set $\wp(B)$ contains $w^n$ elements. -??? note "*Proof*:" +
+Proof: - Let $B$ be set with $n$ elements. A subset $A$ of $B$ is completely determined by its elements. For each element $b \in B$ there are two options, it is in $A$ or it is not. So, there are $2^n$ options and thus $2^n$ different subsets $A$ of $B$. \ No newline at end of file +Let $B$ be set with $n$ elements. A subset $A$ of $B$ is completely determined by its elements. For each element $b \in B$ there are two options, it is in $A$ or it is not. So, there are $2^n$ options and thus $2^n$ different subsets $A$ of $B$. + +
+
\ No newline at end of file