A set is a well-defined collection of distinct objects, called its elements or members. In quant finance, those objects might be securities that pass a screen, dates on a trading calendar, or possible market outcomes. Membership answers a yes-or-no question: does this object belong?
Write when belongs to set , and when it does not. Curly braces list members. For example, contains three hypothetical securities. Order and repeated entries do not change a set:
This matters when combining security lists: seeing the same security in two input files does not create two distinct securities. A transaction ledger, where repeated trades matter, needs more information than a set of security identifiers.
Screening a universe
Suppose a research process starts with the fixed universe . Its eligibility screen accepts , while a separate borrow-availability snapshot lists . The capital letters inside braces are security labels; and name the two sets.
If a candidate must pass both tests, use intersection. If it may pass either test, including both, use union. If the question is which eligible securities lack borrow availability, use set difference.
| Operation | Result | Meaning in this snapshot |
|---|---|---|
| Intersection | Eligible and borrowable | |
| Union | Eligible or borrowable, including both | |
| Difference | Eligible but not borrowable | |
| Reverse difference | Borrowable but not eligible |
Difference is directional: reversing its inputs changes the question. The complement of relative to is . Always state the universe: “not eligible” here means among these four securities, not among every security in existence.
Original fixed-snapshot example. Each mark denotes membership; the columns are security identifiers, not an ordered ranking. Borrow availability is stipulated for illustration and does not establish executable borrowing terms or a trade recommendation.
The cardinality of a finite set is its number of distinct elements, written . Here,
Subtracting the intersection corrects the double counting of B and C. Simply adding the two list sizes would overstate the combined universe.
Containment and an empty result
A set is a subset of , written , if every member of belongs to . Equality is allowed. A strict subset, written , additionally requires . Thus : both survivors are eligible, while A is eligible but does not survive both tests. Every set is a subset of itself, but never a strict subset of itself.
Do not confuse membership with containment: says security A is a member; says the one-security set is contained in .
The empty set, , has no members. If no securities pass a screen, its result is empty and its count is zero: . That is different from the numerical singleton , which has one member, the number zero. An empty screen also conveys a different fact from a zero portfolio weight assigned to an eligible security. Intersecting any set with the empty set returns the empty set; the empty set is a subset of every set.
Membership comes before weights
Eligibility does not specify how much capital to allocate. Holding B and C equally, holding them unequally, or leaving both unheld requires a separate portfolio decision. A membership indicator function can encode “in” as one and “out” as zero, but those values are flags, not allocation weights.
Sets also provide the language of probability: a sample space collects possible outcomes, and an event collects outcomes satisfying a condition. A probability law adds likelihoods. Neither a set of securities nor its size supplies those likelihoods automatically.
For that next step, Probability Fundamentals develops events, complements and the probability addition rule. The full lesson is free with a signed-in account; the public link provides a preview.
Sources
- Dongryul Kim, A rough guide to linear algebra, version of 18 April 2020, §1.1, Definitions 1.1.1 and 1.1.3–1.1.5: membership, subsets, difference, intersection and union.
- Philip B. Stark, UC Berkeley, SticiGui: “Set Theory: The Language of Probability”: set equality, order irrelevance, complements, empty sets and the connection to events. This article uses for inclusion allowing equality and for strict inclusion.
- OpenDSA, Virginia Tech, CS4114 Formal Languages, §2.1 “Set Notation”: membership, cardinality and standard set-operation notation.