Intersection¶

Version: v2 · 2026-09-28 · History
Prime #: 932
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Set Theory → Mathematics

Core Idea¶

The intersection of several collections is the set of elements belonging to all of them at once — what survives every membership test simultaneously. The defining commitment is simultaneous AND: not any, not most, but every collection under consideration.

How would you explain it like I'm…

The Both Spot

Imagine one hoop holds all the red toys and another hoop holds all the round toys. The spot where the hoops overlap holds toys that are red AND round at the same time. The intersection is just that overlap — the things that are in both. If nothing is both, the overlap is empty.

In Both Groups

The intersection of two groups is everything that belongs to both groups at the same time. If one list is 'kids who play soccer' and another is 'kids who play piano,' the intersection is the kids who do both. The key word is AND — not 'either one' and not 'most,' but every group at once. Once you've decided which groups you're comparing, the intersection is locked in; there's nothing left to choose. And sometimes the answer is 'nobody,' which is a real, useful answer meaning no one fits all the rules together.

Simultaneous AND

The intersection of two or more collections is the set of elements that belong to all of them simultaneously — what survives every membership test at once. Its defining commitment is simultaneous AND: not membership in any collection, not in most, but in every collection under consideration. It's one half of the basic Boolean pair on collections; its dual is union, which takes OR. Where union enlarges, intersection narrows — it finds the overlap region, the common ground. The substrate doesn't matter (numbers, people, legal statuses); only the simultaneous-membership test does. Three facts give it leverage: it's associative and commutative (order and grouping don't change the result), it's monotone downward (adding another collection to intersect can only shrink the result), and the result can be empty — which is itself the meaningful signature of 'nothing satisfies all of these together.'

The intersection of two or more collections is the set of elements that belong to all of them at once — what they share, what passes every membership test simultaneously. Its defining commitment is simultaneous AND: membership in every collection under consideration, not in any and not in most. Once the candidate collections are fixed, the intersection is fully determined; nothing further need be specified to read it off. It is one half of the basic Boolean pair on collections, its dual being union, which takes OR; where union enlarges, intersection narrows, locating the overlap region — the joint zone, the common ground, the multiply-qualified subset. The substrate is irrelevant to the structure; only the simultaneous-membership test matters. Three structural facts give it leverage. It is associative and commutative, so the order and grouping of combination make no difference and the operation can be reasoned about freely. It is monotone downward: adding another collection to be intersected can only shrink the result, never grow it, giving an immediate reason to expect difficulty when many independent criteria are stacked. And the result can be empty — the absence of any common element is not a degenerate edge case but a meaningful, frequently decisive outcome, the structural signature of 'no element satisfies all of these together.'

Broad Use¶

Mathematics and logic: set intersection, conjunction of predicates, the meet in lattice theory, the feasible region of a constraint system.
Probability: the joint event A ∩ B, the basis of conditional probability.
Law: the case falling under several statutes at once; conflict-of-laws analysis.
Demographics: the population defined by several criteria together — the core of intersectional reasoning.
Software: the SQL inner join, type intersection A & B, an access rule requiring all roles.
Engineering: the feasible region carved by mechanical, thermal, and cost constraints together.
Strategy: the bargaining zone — the intersection of each party's acceptable set.

Clarity¶

It converts vague phrasing ("the applicable requirements") into a precise structural question — which named collections, and whether their overlap is nonempty.

Manages Complexity¶

It collapses N membership questions into one composite-membership question, and its downward monotonicity (more constraints, smaller result) predicts difficulty before any computation.

Abstract Reasoning¶

It teaches the reasoner to decompose any "joint" requirement into the collections being conjoined, and to recognise when the right answer is a meaningful empty set.

Knowledge Transfer¶

Software: role-based access — the actions an actor holding every role may perform.
Manufacturing: tolerance stacking — the joint feasible range; empty means no part satisfies all specs.
Medicine: clinical-trial eligibility — the joint cohort; empty means no enrollable patient.

Example¶

The customers in both the high-value and the at-risk segments are the intersection of two sets; an analyst who instead sums or blends them names no one in particular.

Relationships to Other Abstractions¶

Current abstraction Intersection Prime

Parents (1) — outgoing typed relations

Intersection presupposes Set and Membership Prime

'Set-and-membership supplies the collections and the ∈ test; intersection is one OPERATION on them.' Intersection presupposes the set apparatus and adds the simultaneous-AND combiner.

Children (17) — abstractions linked here by typed relations

Arrangement of hyperplanes Domain-specific is a kind of Intersection

The identity-bearing flat structure is literally generated by intersections of the hyperplanes; What makes it its own entry: the finite hyperplane family together with intersection-derived structure, distinct from an arbitrary partition, one hyperplane, or an unrestricted subspace arrangement.
Blocking set Domain-specific is a kind of Intersection

Blocking Set instantiates Intersection because its defining test requires the candidate point set to have a nonempty intersection with every designated line or block.
Center (group theory) Domain-specific is a kind of Intersection

It remains its own entry because its identity is fixed by the group and operation, universal commutation condition, selected subset, closure inverses and identity, normal and characteristic proofs, quotient relation and abelian or centerless limiting cases.
Clique graph Domain-specific is a kind of Intersection

Output adjacency is literally generated by intersection among the family of maximal clique sets; maximal-clique extraction and graph reconstruction provide the domain-specific residual.
Cross Section (Geometry) Domain-specific is a kind of Intersection

Intersection is the strict parent by specialization.

▸ Show 12 more

Feasible Region Domain-specific is a kind of Intersection
A Feasible Region is the Intersection specialized to the permitted sets carved out by every constraint over one candidate space.
Gδ Set Domain-specific is a kind of Intersection
Gδ Set directly instantiates **Intersection**: its object is defined as the common elements of a countable family of open sets.
Intersection type Domain-specific is a kind of Intersection
What makes it its own entry: the autonomous type theory identity defined by a term must satisfy each intersected type under the same environment and the system’s subtyping and equality rules.
Kernel (category theory) Domain-specific is a kind of Intersection
It remains its own entry because its identity is fixed by the category and zero object or zero morphisms, input morphism f from X to Y, kernel object K and arrow k, zero composite, universal factorization and uniqueness, monomorphism consequence, existence, equalizer formulation, concrete algebraic realization and distinction from kernel pair.
Line–line intersection Domain-specific is a kind of Intersection
It remains its own entry because its identity is fixed by the ambient geometry and dimension, line, ray or segment carriers, coordinate representation, parameter ranges, direction vectors, exact parallel and coincidence predicates, skew and coplanarity handling, intersection set, numerical tolerance or exact arithmetic, and degeneracy policy.
Map graph Domain-specific is a kind of Intersection
It remains its own entry because its identity is fixed by the finite region family, Euclidean plane and simple-connectivity convention, pairwise interior disjointness, boundary-contact adjacency including point contacts, graph simplicity, planar witness bipartite graph and half-square construction, clique behavior, recognition representation and comparison with planar and intersection graphs.
Saturated set (intersection of open sets) Domain-specific is a kind of Intersection
What makes it its own entry: the domain-specific identity determined by the set equals its topological saturation under the declared specialization-order orientation and is an arbitrary intersection of open subsets.
Tangential quadrilateral Domain-specific is a kind of Intersection
What makes it its own entry: the domain-specific identity determined by the quadrilateral is convex, one circle is tangent to all four side segments under the declared convention, contact points and incenter exist, and side-length and angle conditions are applied with their converse hypotheses.
Erdős–Ko–Rado Theorem Domain-specific presupposes Intersection
**`prime:intersection`** is the broader abstraction this entry instantiates by composition/presupposition.
Intersection Curve Domain-specific presupposes Intersection
The curve is selected from the common locus of two surfaces.
Segre Class Domain-specific presupposes Intersection
Segre Class compositionally presupposes **Intersection** because its output lives in the intersection-theoretic cycle algebra and corrects nonproper intersections.
Topological Space Domain-specific includes Intersection
Finite Intersection is the second named collection operation under which a topology must remain closed.

Hierarchy path (1) — routes to 1 parentless root

Intersection → presupposes Set and Membership

Not to Be Confused With¶

Intersection is not Aggregation because aggregation pools contributions into a summary (a sum, a mean), whereas intersection filters to the elements common to all collections.
Intersection is not Union because union takes OR (membership in any collection) and enlarges, whereas intersection takes AND (membership in every one) and narrows — they are De Morgan duals.
Intersection is not Set and Membership because set-and-membership supplies the collections and the ∈ test, whereas intersection is one operation on them — the simultaneous-AND combiner with its own algebra.