Set, Graph & Structural Mathematics

Primes about the formal architecture of mathematical structure: set-theoretic building blocks (sets, partitions, equivalence relations, cardinality), graph and network primitives (cycles, cuts, DAGs, coloring), and structure-preserving relations (isomorphism, duality, induction) that organize discrete systems.

33 primes in this family — primes that sit near one another in abstraction space (k-means over structural-signature embeddings). Each is shown with its short description.

• Abstract Structure — An abstract structure is a system of typed elements, relations, operations, and constraints considered independently of any particular material carrier or notation, with identity determined by structure-preserving correspondence.
• Boundary — Defines system limits.
• Boundedness — Values remain within limits.
• Canonical Form — A unique distinguished representative per equivalence class lets equivalence be tested by identity of representatives.
• Cardinality — Size of sets.
• Category — Describe a system by its arrows and their composition, not by what its objects are.
• Complement — Everything in a declared universe that is not in a designated subset.
• Complementarity — Two non-overlapping roles that jointly exhaust a whole and require each other.
• Completeness — No gaps in structure.
• Connectedness — A whole that cannot be split into parts with no relation crossing between them.
• Cut — A partition of a network's vertices and the crossing edges, converting global connectivity into a local edge-set.
• Cycle — A closed path in a network that returns to its origin, opening return, foreclosing ordering, and creating a loop invariant.
• Dependency — Directed relation in which one element relies on another being present, prior, compatible, or supplied, with a specifiable failure mode if the condition is unmet.
• Directed Acyclic Graph — Directed edges with no return path impose a one-way order on a whole structure.
• Discreteness — Countable steps.
• Disjointness — Two or more populated collections share no element.
• Duality — Complementary perspectives.
• Equivalence Relation — Groups elements into equivalence classes.
• Fungibility — Any unit of a class substitutes for any other without loss, erasing individual identity in favor of type and quantity.
• Graph Coloring — Conflict-free labeling so that no two items joined by a conflict edge share a label.
• Hierarchy — Organizes elements into levels or ranks.
• Infinity — Unbounded quantity.
• Isomorphism — Structure-preserving mapping.
• Mathematical Induction — Proof method across natural numbers.
• Network — Models interactions between components.
• Partition — A division of a set into non-overlapping, collectively exhaustive blocks.
• Permutation — Reassign every member or position of a collection exactly once, preserving membership while changing arrangement; the resulting bijective self-maps compose, invert, and decompose into cycles.
• Relation — Describes associations or dependencies.
• Set and Membership — Groups and categorizes elements.
• Span — The complete set reachable by combining primitives under admissible operations.
• Topology — Studies properties preserved under deformation.
• Type–Token Distinction — Separate a repeatable type from its numerically distinct tokens so shared properties attach once to the type while occurrence-specific identity, state, and history attach to each token.
• Well-Foundedness (Well-Ordering) — Prevents infinite descent.