Sets
Declare what belongs to a collection and the universe within which membership is judged.
SRAI Book 1 · Chapter 2 · PU-B01-C02
Sets determine what belongs. Logic determines truth conditions. Relations determine what is connected. Functions determine how declared inputs map to outputs. Lesson 2 connects these foundations to data filters, databases, knowledge systems, algorithms and transparent decision rules.
01 / LEARNING OUTCOMES
02 / FOUNDATIONAL STRUCTURE
Declare what belongs to a collection and the universe within which membership is judged.
State truth conditions and make decision rules inspectable.
Represent declared connections between elements without assuming a unique output.
Map each declared input to exactly one output in a stated codomain.
03 / SET OPERATIONS
For sets A and B, the notebook verifies union, intersection, difference, complement relative to a declared universe, and Cartesian product.
The universe is part of the specification. Without it, a complement is ambiguous and the resulting analytical claim cannot be defended.
| Union | A ∪ B |
| Intersection | A ∩ B |
| Difference | A ∖ B |
| Cartesian product | A × B |
Every operation is checked against explicit expected results.
A relation records which ordered pairs belong. It does not automatically guarantee a unique output for every input.
Totality and uniqueness are obligations that must be tested—not merely assumed from a label or data structure.
04 / DEFENSIBLE DECISION RULES
CONTROLLED RESOURCES
Controlled publication edition.
PDF ↗ REPRODUCEExecutable and independently verified.
IPYNB ↗ PRACTISEProgress toward independent application.
PDF ↗ RUNExecute the approved notebook in a clean cloud runtime.
COLAB ↗ DOWNLOADChapter, notebook, exercises, Executive Brief, code, metadata and validation records.
ZIP ↓ APPLYConnect analytical controls to decisions.
PDF ↗