Set-builder notation notes.

notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json

@@ -322,7 +322,7 @@
     "_journal/2024-03-18.md": "8479f07f63136a4e16c9cd07dbf2f27f",
     "_journal/2024-03/2024-03-17.md": "23f9672f5c93a6de52099b1b86834e8b",
     "set/directed-graph.md": "b4b8ad1be634a0a808af125fe8577a53",
-    "set/index.md": "5302d73c3f54892d46413533b1eb04d0",
+    "set/index.md": "9a270d08a96d0c8094ffb58671e50a12",
     "set/graphs.md": "55298be7241906cb6b61673cf0a2e709",
     "_journal/2024-03-19.md": "a0807691819725bf44c0262405e97cbb",
     "_journal/2024-03/2024-03-18.md": "63c3c843fc6cfc2cd289ac8b7b108391",
@@ -582,7 +582,7 @@
     "_journal/2024-07/2024-07-02.md": "489464ee47c3ba21307bfabae569ad29",
     "_journal/2024-07/2024-07-01.md": "7cffc27813fe7a7338e411d054ac3bd5",
     "set/bags.md": "ba7990801734f411838d7b33e7ec0542",
-    "_journal/2024-07-07.md": "fbd2ad529330b632d65280c7fc221122",
+    "_journal/2024-07-07.md": "9ee2d5007c34cc7ff681f3d9e998eca4",
     "_journal/2024-07/2024-07-06.md": "2b794e424985f0e7d4d899163ce5733c"
   },
   "fields_dict": {

notes/_journal/2024-07-07.md

@@ -9,3 +9,4 @@ title: "2024-07-07"
 - [ ] Korean (Read 1 Story)
 
 * Notes on [[bags]] and multigraphs.
+* Additional notes on set-builder notation and gotchas related to it.

notes/set/index.md

@@ -96,6 +96,11 @@ Tags: adt::dynamic_set
 <!--ID: 1715432070083-->
 END%%
 
+Sets are often denoted using **roster notation** in which members are specified explicitly in a comma-delimited list surrounded by curly braces. Alternatively, **abstraction** (or **set-builder notation**) defines sets using an **entrance requirement**. Examples of the set of prime numbers less than $10$:
+
+* Roster notation: $\{2, 3, 5, 7\}$
+* Set-builder notation: $\{x \mid x < 10 \land x \text{ is prime}\}$
+
 %%ANKI
 Basic
 Define the set of prime numbers less than $10$ using abstraction.
@@ -206,6 +211,100 @@ Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Pre
 <!--ID: 1716494526284-->
 END%%
 
+%%ANKI
+Basic
+How are members of the following set defined using extensionality and first-order logic? $$B = \{P(x) \mid \phi(x)\}$$
+Back: $\forall x, P(x) \in B \Leftrightarrow \phi(x)$
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720369624727-->
+END%%
+
+%%ANKI
+Basic
+How are members of the following set defined using extensionality and first-order logic? $$B = \{x \mid x < 5 \land x \text{ is prime}\}$$
+Back: $\forall x, x \in B \Leftrightarrow (x < 5 \land x \text{ is prime})$
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720369624730-->
+END%%
+
+%%ANKI
+Cloze
+$P(x)$ is equivalently written as $x \in$ {$\{v \mid P(v)\}$}.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720369624733-->
+END%%
+
+%%ANKI
+Cloze
+$\exists A \in B, uFx$ is equivalently written as $x \in$ {$\{v \mid \exists A \in B, uFv\}$}.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720369624735-->
+END%%
+
+%%ANKI
+Basic
+How is set $\{P(y) \mid y \in B\}$ interpreted?
+Back: As the set of $P(y)$ for all $y \in B$.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720369624736-->
+END%%
+
+%%ANKI
+Basic
+How many members are in set $\{P(y) \mid y \in B\}$?
+Back: As many as the number of unique $P(y)$ for each $y \in B$.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720369624737-->
+END%%
+
+%%ANKI
+Basic
+How is set $\{P(y) \mid \exists y \in B\}$ interpreted?
+Back: If $B$ is empty, the empty set. Otherwise as singleton $\{P(y)\}$.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720369624738-->
+END%%
+
+%%ANKI
+Basic
+How many members are in set $\{P(y) \mid \exists y \in B\}$?
+Back: At most $1$.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720369624739-->
+END%%
+
+%%ANKI
+Basic
+In set-builder notation, the left side of $\{\ldots \mid \ldots\}$ denotes what?
+Back: The members of the set.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720370610010-->
+END%%
+
+%%ANKI
+Basic
+In set-builder notation, the right side of $\{\ldots \mid \ldots\}$ denotes what?
+Back: The entrance requirement.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720370610016-->
+END%%
+
+%%ANKI
+Basic
+How is set $\{v \mid \exists A \in B, v = A\}$ written more compactly?
+Back: $\{A \mid A \in B\}$
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720370610022-->
+END%%
+
+%%ANKI
+Basic
+How is set $\{v \mid \exists A \in B, v \in A\}$ written more compactly?
+Back: N/A.
+Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
+<!--ID: 1720370610028-->
+END%%
+
 ## Extensionality
 
 If two sets have exactly the same members, then they are equal: $$\forall A, \forall B, (\forall x, x \in A \Leftrightarrow x \in B) \Rightarrow A = B$$