集合の演算の基本
集合の演算の基本
全体集合を\(X\)として、\(X\)の部分集合を\(A,B,C\subseteq X\)とする。
結合法則
交換法則
二重補集合
冪等法則
吸収法則
吸収法則の片方が補集合
分配法則
ド・モルガンの法則
結合法則(一般)
分配法則(一般)
ド・モルガンの法則(一般)
全体集合を\(X\)として、\(X\)の部分集合を\(A,B,C\subseteq X\)とする。
結合法則
(1)
\[ A\cup\left(B\cup C\right)=\left(A\cup B\right)\cup C \](2)
\[ A\cap\left(B\cap C\right)=\left(A\cap B\right)\cap C \]交換法則
(3)
\[ A\cup B=B\cup A \](4)
\[ A\cap B=B\cap A \]二重補集合
(5)
\[ A^{cc}=A \]冪等法則
(6)
\[ A\cup A=A \](7)
\[ A\cap A=A \]吸収法則
(8)
\[ A\cup\left(A\cap B\right)=A \](9)
\[ A\cap\left(A\cup B\right)=A \]吸収法則の片方が補集合
(10)
\[ A\cup\left(A^{c}\cap B\right)=A\cup B \](11)
\[ A\cap\left(A^{c}\cup B\right)=A\cap B \]分配法則
(12)
\[ A\cup\left(B\cap C\right)=\left(A\cup B\right)\cap\left(A\cup C\right) \](13)
\[ A\cap\left(B\cup C\right)=\left(A\cap B\right)\cup\left(A\cap C\right) \]ド・モルガンの法則
(14)
\[ \left(A\cup B\right)^{c}=A^{c}\cap B^{c} \](15)
\[ \left(A\cap B\right)^{c}=A^{c}\cup B^{c} \]結合法則(一般)
(16)
\[ A\cup\left(\bigcup_{\lambda\in\Lambda}B_{\lambda}\right)=\bigcup_{\lambda\in\Lambda}\left(A\cup B_{\lambda}\right) \](17)
\[ A\cap\left(\bigcap_{\lambda\in\Lambda}B_{\lambda}\right)=\bigcap_{\lambda\in\Lambda}\left(A\cap B_{\lambda}\right) \]分配法則(一般)
(18)
\[ A\cup\left(\bigcap_{\lambda\in\Lambda}B_{\lambda}\right)=\bigcap_{\lambda\in\Lambda}\left(A\cup B_{\lambda}\right) \](19)
\[ A\cap\left(\bigcup_{\lambda\in\Lambda}B_{\lambda}\right)=\bigcup_{\lambda\in\Lambda}\left(A\cap B_{\lambda}\right) \]ド・モルガンの法則(一般)
(20)
\[ \left(\bigcup_{\lambda\in\Lambda}A_{\lambda}\right)^{c}=\bigcap_{\lambda\in\Lambda}A_{\lambda}^{c} \](21)
\[ \left(\bigcap_{\lambda\in\Lambda}A_{\lambda}\right)^{c}=\bigcup_{\lambda\in\Lambda}A_{\lambda}^{c} \](1)
\begin{align*} A\cup\left(B\cup C\right) & =A\cup\left\{ x;x\in B\lor x\in C\right\} \\ & =\left\{ x;x\in A\lor\left(x\in B\lor x\in C\right)\right\} \\ & =\left\{ x;\left(x\in A\lor x\in B\right)\lor x\in C\right\} \\ & =\left\{ x;\left(x\in A\lor x\in B\right)\right\} \cup C\\ & =\left(A\cup B\right)\cup C \end{align*}(2)
\begin{align*} A\cap\left(B\cap C\right) & =A\cap\left\{ x;x\in B\land x\in C\right\} \\ & =\left\{ x;x\in A\land\left(x\in B\land x\in C\right)\right\} \\ & =\left\{ x;\left(x\in A\land x\in B\right)\land x\in C\right\} \\ & =\left\{ x;\left(x\in A\land x\in B\right)\right\} \cap C\\ & =\left(A\cap B\right)\cap C \end{align*}(3)
\begin{align*} A\cup B & =\left\{ x;x\in A\lor x\in B\right\} \\ & =\left\{ x;x\in B\lor x\in A\right\} \\ & =B\cup A \end{align*}(4)
\begin{align*} A\cap B & =\left\{ x;x\in A\land x\in B\right\} \\ & =\left\{ x;x\in B\land x\in A\right\} \\ & =B\cap A \end{align*}(5)
\begin{align*} A^{cc} & =X\setminus\left(X\setminus A\right)\\ & =X\setminus\left\{ x;x\in X\nrightarrow x\in A\right\} \\ & =\left\{ x;x\in X\nrightarrow\left(x\in X\nrightarrow x\in A\right)\right\} \\ & =\left\{ x;x\in X\land\left(x\in X\rightarrow x\in A\right)\right\} \\ & =\left\{ x;x\in X\land\left(x\notin X\lor x\in A\right)\right\} \\ & =\left\{ x;\left(x\in X\land x\notin X\right)\lor\left(x\in X\land x\in A\right)\right\} \\ & =\left\{ x;x\in X\land x\in A\right\} \\ & =\left\{ x;x\in A\right\} \\ & =A \end{align*}(6)
\begin{align*} A\cup A & =\left\{ x;x\in A\lor x\in A\right\} \\ & =\left\{ x;x\in A\right\} \\ & =A \end{align*}(7)
\begin{align*} A\cap A & =\left\{ x;x\in A\land x\in A\right\} \\ & =\left\{ x;x\in A\right\} \\ & =A \end{align*}(8)
\begin{align*} A\cup\left(A\cap B\right) & =\left\{ x;x\in A\lor\left(x\in A\land x\in B\right)\right\} \\ & =\left\{ x;x\in A\right\} \\ & =A \end{align*}(9)
\begin{align*} A\cap\left(A\cup B\right) & =\left\{ x;x\in A\land\left(x\in A\lor x\in B\right)\right\} \\ & =\left\{ x;x\in A\right\} \\ & =A \end{align*}(10)
\begin{align*} A\cup\left(A^{c}\cap B\right) & =\left\{ x;x\in A\lor\left(x\notin A\land x\in B\right)\right\} \\ & =\left\{ x;\left(x\in A\lor x\notin A\right)\land\left(x\in A\lor x\in B\right)\right\} \\ & =\left\{ x;x\in A\lor x\in B\right\} \\ & =A\cup B \end{align*}(11)
\begin{align*} A\cap\left(A^{c}\cup B\right) & =\left\{ x;x\in A\land\left(x\notin A\lor x\in B\right)\right\} \\ & =\left\{ x;\left(x\in A\land x\notin A\right)\lor\left(x\in A\land x\in B\right)\right\} \\ & =\left\{ x;x\in A\land x\in B\right\} \\ & =A\cap B \end{align*}(12)
\begin{align*} A\cup\left(B\cap C\right) & =\left\{ x;x\in A\lor\left(x\in B\land x\in C\right)\right\} \\ & =\left\{ x;\left(x\in A\lor x\in B\right)\land\left(x\in A\lor x\in C\right)\right\} \\ & =\left(A\cup B\right)\cap\left(A\cup C\right) \end{align*}(13)
\begin{align*} A\cap\left(B\cup C\right) & =\left\{ x;x\in A\land\left(x\in B\lor x\in C\right)\right\} \\ & =\left\{ x;\left(x\in A\land x\in B\right)\lor\left(x\in A\land x\in C\right)\right\} \\ & =\left(A\cap B\right)\cup\left(A\cap C\right) \end{align*}(14)
\begin{align*} \left(A\cup B\right)^{c} & =X\setminus\left(A\cup B\right)\\ & =\left\{ x;x\in X\nrightarrow\left(x\in A\lor x\in B\right)\right\} \\ & =\left\{ x;x\in X\land\left(x\notin A\land x\notin B\right)\right\} \\ & =\left\{ x;\left(x\in X\land x\notin A\right)\land\left(x\in X\land x\notin B\right)\right\} \\ & =\left\{ x;\left(x\in X\nrightarrow x\in A\right)\land\left(x\in X\nrightarrow x\in B\right)\right\} \\ & =A^{c}\cap B^{c} \end{align*}(15)
\begin{align*} \left(A\cap B\right)^{c} & =\left(\left(A^{c}\cup B^{c}\right)^{c}\right)^{c}\\ & =\left(A^{c}\cup B^{c}\right)^{cc}\\ & =A^{c}\cup B^{c} \end{align*}(16)
\begin{align*} A\cup\left(\bigcup_{\lambda\in\Lambda}B_{\lambda}\right) & =\left\{ x;x\in A\cup\bigcup_{\lambda\in\Lambda}B_{\lambda}\right\} \\ & =\left\{ x;x\in A\lor x\in\bigcup_{\lambda\in\Lambda}B_{\lambda}\right\} \\ & =\left\{ x;x\in A\lor\exists\lambda\in\Lambda,x\in B_{\lambda}\right\} \\ & =\left\{ x;\exists\lambda\in\Lambda,x\in A\lor x\in B_{\lambda}\right\} \\ & =\left\{ x;\exists\lambda\in\Lambda,x\in A\cup B_{\lambda}\right\} \\ & =\left\{ x;x\in\bigcup_{\lambda\in\Lambda}\left(A\cup B_{\lambda}\right)\right\} \\ & =\bigcup_{\lambda\in\Lambda}\left(A\cup B_{\lambda}\right) \end{align*}(17)
\begin{align*} A\cap\left(\bigcap_{\lambda\in\Lambda}B_{\lambda}\right) & =\left\{ x;x\in A\cap\left(\bigcap_{\lambda\in\Lambda}B_{\lambda}\right)\right\} \\ & =\left\{ x;x\in A\land x\in\bigcap_{\lambda\in\Lambda}B_{\lambda}\right\} \\ & =\left\{ x;x\in A\land\forall\lambda\in\Lambda,x\in B_{\lambda}\right\} \\ & =\left\{ x;\forall\lambda\in\Lambda,x\in A\land x\in B_{\lambda}\right\} \\ & =\left\{ x;\forall\lambda\in\Lambda,x\in A\cap B_{\lambda}\right\} \\ & =\left\{ x;x\in\bigcap_{\lambda\in\Lambda}\left(A\cap B_{\lambda}\right)\right\} \\ & =\bigcap_{\lambda\in\Lambda}\left(A\cap B_{\lambda}\right) \end{align*}(18)
\begin{align*} A\cup\left(\bigcap_{\lambda\in\Lambda}B_{\lambda}\right) & =\left\{ x;x\in A\cup\left(\bigcap_{\lambda\in\Lambda}B_{\lambda}\right)\right\} \\ & =\left\{ x;x\in A\lor x\in\bigcap_{\lambda\in\Lambda}B_{\lambda}\right\} \\ & =\left\{ x;x\in A\lor\forall\lambda\in\Lambda,x\in B_{\lambda}\right\} \\ & =\left\{ x;\forall\lambda\in\Lambda,x\in A\lor x\in B_{\lambda}\right\} \\ & =\left\{ x;\forall\lambda\in\Lambda,x\in A\cup B_{\lambda}\right\} \\ & =\left\{ x;x\in\bigcap_{\lambda\in\Lambda}\left(A\cup B_{\lambda}\right)\right\} \\ & =\bigcap_{\lambda\in\Lambda}\left(A\cup B_{\lambda}\right) \end{align*}(19)
\begin{align*} A\cap\left(\bigcup_{\lambda\in\Lambda}B_{\lambda}\right) & =\left\{ x;x\in A\cap\left(\bigcup_{\lambda\in\Lambda}B_{\lambda}\right)\right\} \\ & =\left\{ x;x\in A\land x\in\bigcup_{\lambda\in\Lambda}B_{\lambda}\right\} \\ & =\left\{ x;x\in A\land\exists\lambda\in\Lambda,x\in B_{\lambda}\right\} \\ & =\left\{ x;\exists\lambda\in\Lambda,x\in A\land x\in B_{\lambda}\right\} \\ & =\left\{ x;\exists\lambda\in\Lambda,x\in A\cap B_{\lambda}\right\} \\ & =\left\{ x;x\in\bigcup_{\lambda\in\Lambda}\left(A\cap B_{\lambda}\right)\right\} \\ & =\bigcup_{\lambda\in\Lambda}\left(A\cap B_{\lambda}\right) \end{align*}(20)
\begin{align*} \left(\bigcup_{\lambda\in\Lambda}A_{\lambda}\right)^{c} & =\left\{ x;\exists\lambda\in\Lambda,x\in A_{\lambda}\right\} ^{c}\\ & =\left\{ x;\lnot\left(\exists\lambda\in\Lambda,x\in A_{\lambda}\right)\right\} \\ & =\left\{ x;\forall\lambda\in\Lambda,x\notin A_{\lambda}\right\} \\ & =\bigcap_{\lambda\in\Lambda}A_{\lambda}^{c} \end{align*}(21)
\begin{align*} \left(\bigcap_{\lambda\in\Lambda}A_{\lambda}\right)^{c} & =\left(\bigcup_{\lambda\in\Lambda}A_{\lambda}\right)^{cc}\\ & =\bigcup_{\lambda\in\Lambda}A_{\lambda}^{\;c} \end{align*}(21)-2
直接計算する。\begin{align*} \left(\bigcap_{\lambda\in\Lambda}A_{\lambda}\right)^{c} & =\left\{ x;\forall\lambda\in\Lambda,x\in A_{\lambda}\right\} ^{c}\\ & =\left\{ x;\lnot\left(\forall\lambda\in\Lambda,x\in A_{\lambda}\right)\right\} \\ & =\left\{ x;\exists\lambda\in\Lambda,x\notin A_{\lambda}\right\} \\ & =\bigcup_{\lambda\in\Lambda}A_{\lambda}^{c} \end{align*}
ページ情報
| タイトル | 集合の演算の基本 |
| URL | https://www.nomuramath.com/jibrws2h/ |
| SNSボタン |
集合の演算の定義
\[
A\cup B=\left\{ x;x\in A\lor x\in B\right\}
\]
集合族の和集合・積集合の性質
\[
\forall B\in\mathcal{A},B\subseteq\bigcup\mathcal{A}
\]

