I am reading Automata and Computability by Dexter C. Kozen and I am in the first chapter entitled Strings and Sets.
If we have a set $A=\{ab,b\}$ do we get to assume that the null string $\epsilon$ is also a member of that set? If we have another set $B=\{\epsilon\}$, does $A\cap B = \{\epsilon\}$ or does $A∩B=\emptyset$?
On a related note, I am having trouble understanding the meaning of a little chunk in the textbook. What does "family of set indexed by another set $I$" mean? What does the set $I$ consist of here? I am very confused by the notation as well. Anything you can do to help me understand the excerpt below is appreciated.
Set concatenation distributes over union: \begin{align} A(B\cup C) &= AB \cup AC, \\ (A \cup B)C &= AC \cup BC. \end{align} In fact, concatenation distributes over the union of any family of sets. If $\{B_i \mid i \in I \}$ is any family of sets indexed by another set $I$, finite or infinite, then \begin{align} A \bigl( \bigcup_{i \in I} B_i \bigr) &= \bigcup_{i \in I} AB_i, \\ \bigl( \bigcup_{i \in I} B_i \bigr) A &= \bigcup_{i \in I} B_iA. \end{align} Here $\bigcup_{i \in I} B_i$ denotes the union of all the sets $B_i$ for $i \in I$. An element $x$ is in this union iff it is in one of the $B_i$.