Definition 5.3. Let (Aj)j∈J be a non-empty family of non-empty sets and U an ultrafilter on J.

  • Write ∏⁡j∈JAj∕U to be ∏⁡j∈JAj∕∼ (where ∼ is defined as in Definition 5.1).

  • [(aj)j∈J]U is the equivalence class of (aj)j∈J with respect to ∼.

  • Let Bj⊆Aj for every j∈J. Then

    [(Bj)j∈J]U={[(aj)j∈J]∈∏j∈JAj∕U:{j∈J:aj∈Bj}∈U}.