Constraint¶

Version: v2 · 2026-08-30 · History
Prime #: 22
Domain group: Formal Sciences
Origin domain: Mathematics
Also from: Operations Research, Engineering & Design (beyond software), Philosophy
Aliases: Affordability Frontier, Allocation Limit, Budget Constraint, Cap, Quota, Constraint Programming
Related primes: Optimization, Boundary, Trade-offs

Core Idea¶

Limiting possibilities to manage outcomes.

How would you explain it like I'm…

Must-follow rule

When you build a tower with blocks, gravity won't let you stack them sideways in the air. That's a rule you can't break, no matter how clever you are. Some rules just say no, and you have to work around them. The blocks must touch something below.

Hard limit

A constraint is a rule that says certain choices are simply not allowed, no matter how good they might seem. If you have ten dollars and a toy costs fifteen, you can't buy it — your budget is a constraint. Constraints aren't about which option is BEST; they're about which options are even ALLOWED. Once you know your constraints, you can look at all the allowed choices (called the feasible set) and pick the best one from those.

Binding restriction

A constraint is a condition that restricts which configurations or choices are allowed. Anything that violates the constraint is off the table, regardless of how good it might otherwise be. This is different from a preference or an objective: a preference says some options are better, but a constraint says some options aren't options at all. Constraints define the 'feasible set' — the subset of all possibilities that actually satisfy your conditions. Every constraint has a domain (what it applies to), a condition (what must hold), a modal status (hard vs soft, negotiable vs not), and an origin (physical law, budget, regulation, moral commitment). Engineers, economists, and planners all build their thinking around constraints first, then optimize within them.

A constraint is a condition that restricts the admissible configurations, choices, or behaviors of a system to those satisfying it. The defining commitment is that violating the constraint disqualifies a candidate entirely, regardless of merit on other dimensions — making the feasible set (the admissible subset) a first-class object of analysis, separate from the objective that ranks within it. Constraints are distinct from objectives (which order admissible candidates), preferences (which order softly), trade-offs (which arise after constraints define the feasible set), and impossibility proofs (which show the feasible set is empty). Every constraint specifies its domain, the condition that must hold (equality, inequality, logical predicate, conservation law), its modal status (hard/soft, binding/slack), and its origin (physical law, regulation, budget, moral commitment, design envelope). Constraint reasoning is the structural prerequisite for disciplined decision-making under restriction: Lagrange multipliers in mechanics, the simplex method in operations research, KKT conditions in nonlinear optimization, and Goldratt's Theory of Constraints in operations management all instantiate the same structural move.

Cross-Domain Echoes¶

See how this entry connects to another domain.

Broad Use¶

Found in engineering, design, and project management (e.g., budgets, laws of physics).

Clarity¶

Focuses attention on viable solutions by eliminating infeasible options, e.g., time or resource constraints in project management.

Manages Complexity¶

Narrows down possibilities, focusing effort on feasible solutions and eliminating irrelevant options.

Abstract Reasoning¶

Encourages thinking about limitations and trade-offs, fostering innovation within boundaries.

Knowledge Transfer¶

Found in engineering (design tolerances), optimization problems (linear programming), and ethics (moral boundaries).

Example¶

A bridge design must satisfy constraints like maximum weight capacity and material limitations.

Relationships to Other Abstractions¶

Current abstraction Constraint Prime

Foundational — no parent edges in the catalog.

Children (269) — more specific cases that build on this

Absolute continuity Domain-specific is a kind of Constraint

It remains its own entry because its identity is fixed by the interval and real or metric-valued function, epsilon-delta quantifiers over finite disjoint intervals, endpoint increments, almost-everywhere derivative, integrability and reconstruction formula.
Adverbial complement Domain-specific is a kind of Constraint

It remains its own entry because its identity is fixed by the language and variety, clause and predicate, adverbial form and function, selected semantic role, subcategorization or valency frame, omission and substitution diagnostics, grammaticality evidence, constructional alternative, adjunct comparison and theoretical framework.
Ahlswede–Daykin inequality Domain-specific is a kind of Constraint

What makes it its own entry: the domain-specific identity determined by the carrier is a finite distributive lattice, all functions are nonnegative, and the pointwise join–meet hypothesis and set-sum conclusion use the theorem’s exact conventions.
Amenable number Domain-specific is a kind of Constraint

It remains its own entry because its identity is fixed by the positive integer n, multiset cardinality exactly n, integer entries and repetition, sum equality, product equality, sign convention, congruence characterization, exceptional cases and witness construction.
Ample line bundle Domain-specific is a kind of Constraint

Ampleness constrains global sections and positivity of a line bundle.

▸ Show 264 more

Anti-alienation clause Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the jurisdiction and effective date, governing instrument and arrangement, protected interest and beneficiary, voluntary and involuntary transfer restrictions, creditor and statutory exceptions, distribution event, remedies and preemption issues.
Antimatroid Domain-specific is a kind of Constraint
Feasible build sequences are governed by persistent prerequisite constraints.
Asefru Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the Kabyle language and dialect, poem and attribution, period and transmission, three-stanza and nine-line structure, syllable-count convention, AAB rhyme identification, recited or sung performance, transcription, variants, and evidence.
Balanced matrix Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the binary matrix and dimensions, selected rows and columns, forbidden odd square submatrix condition, equivalent hypergraph characterization, associated linear program, right-hand-side or objective assumptions and claimed integrality result.
Bernstein inequalities (probability theory) Domain-specific is a kind of Constraint
For a declared family of centered random sums, the selected Bernstein theorem states explicit independence or dependence, variance, magnitude or moment, and deviation conditions that restrict the admissible tail probability to values no greater than its exponential bound.
Bidiagonal matrix Domain-specific is a kind of Constraint
Bidiagonal structure is a strict constraint on matrix support.
Biordered set Domain-specific is a kind of Constraint
The object is characterized by coupled order and partial-product constraints.
Björling problem Domain-specific is a kind of Constraint
The candidate literally instantiates prime:constraint; its minimal_surface_geometry restrictions provide the domain-specific residual.
BK-space Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the scalar sequence carrier, vector-space and norm structure, completeness, inclusion in all sequences, coordinate projections and their continuity, relation to FK spaces, canonical unit vectors and basis qualifications and examples c c0 l-p and l-infinity.
Bounded arithmetic Domain-specific is a kind of Constraint
Syntactic bounds constrain the strength of arithmetic reasoning.
Bounded complete poset Domain-specific is a kind of Constraint
The property constrains which suprema a partial order must contain.
Bounds checking Domain-specific is a kind of Constraint
The check enforces a numeric or positional constraint before use.
Brauer's theorem on forms Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the field and its diagonal-form solvability function, number and degrees of homogeneous forms, target subspace dimension, variable threshold and conclusion about simultaneous vanishing.
Butson-type Hadamard matrix Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the integers q and N, chosen roots of unity, matrix entries, conjugate-transpose orthogonality, normalization and equivalence convention and existence or construction claim.
Cancellation property Domain-specific is a kind of Constraint
Cancellation constrains multiplication maps to be injective.
Carleman's equation Domain-specific is a kind of Constraint
Carleman's equation instantiates Constraint because it restricts an unknown function to those whose logarithmic potential equals prescribed data, with an explicit range and compatibility condition.
Cauchy–Schwarz inequality Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by the carrier is an inner-product space and the stated inner-product and induced-norm conventions make the inequality and equality condition valid for every pair.
Centripetal Force Domain-specific is a kind of Constraint
**Constraint** is the strict parent because the relation \(\sum F_n=mv^2/R\) partitions candidate motions and force inventories into dynamically admissible and inadmissible cases.
Certainty in English law Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the jurisdiction and instrument type, parties and intention, disputed words, subject matter and objects, essential terms, incorporated standards, admissible context, construction and implication rules, severability and legal consequence.
Chance-constrained portfolio selection Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the asset universe and horizon, portfolio weights and budget and short-sale constraints, random return model and dependence, final wealth or loss expression, survival threshold, maximum violation probability, objective function, deterministic reformulation or numerical solver and estimation robustness and out-of-sample validation.
Chandrasekhar's white dwarf equation Domain-specific is a kind of Constraint
The equation literally restricts admissible radial density profiles to those satisfying a nonlinear differential relation and center/surface conditions.
Characters per line Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the medium and viewport or page, monospaced font and cell width, margins, column count, tabs and wide characters, wrap and truncation policy, readability target and device constraints.
Circle of Forces Domain-specific is a kind of Constraint
The circle or ellipse is a concrete feasible-set constraint on tire-force components, not a subtype of the abstract concept.
Claw-free graph Domain-specific is a kind of Constraint
Membership is a structural constraint excluding a particular induced configuration.
Closure problem Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by the selected vertex set is successor-closed under every directed edge and has maximum total declared weight among all such sets.
Club principle Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the regular uncountable cardinal, stationary subset S, sequence indexed by S, cofinal subset A-delta of each delta, arbitrary unbounded subset A, containment witness delta and comparison with club sets diamond and continuum-hypothesis implications and consistency results.
Coherency (homotopy theory) Domain-specific is a kind of Constraint
Coherency (homotopy theory) is a strict kind of Constraint: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.
Collateral estoppel Domain-specific is a kind of Constraint
The doctrine constrains later adjudication through a prior issue determination.
Compatibility-with-childcare theory Domain-specific is a kind of Constraint
Childcare responsibility literally constrains feasible work patterns through distance, timing and interruption.
Complete intersection Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by the ambient space, local or global convention, codimension, generator sequence, and regularity condition agree so the equation count equals codimension.
Confined Liquid Domain-specific is a kind of Constraint
**Constraint** is the broader abstraction this entry instantiates.
Constraint (Computational Chemistry) Domain-specific is a kind of Constraint
Constraint (Computational Chemistry) is a strict kind of Constraint: it is an explicitly enforced restriction on admissible molecular coordinates or collective variables.
Constraint (computer-aided design) Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the CAD system and version, entities and parameters, constraint type and value, degrees of freedom, solver convention, dependency graph, satisfiability state and behavior under model edits.
Constraint satisfaction Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the variables and domains, constraints and scopes, satisfaction semantics, complete assignment, propagation and search rules and proof of solution or infeasibility.
Costas array Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the order n and square grid, permutation representation, one-dot-per-row-and-column rule, directed or signed displacement convention, uniqueness across all dot pairs and construction or exhaustive-search evidence.
Critical path method Domain-specific is a kind of Constraint
Precedence and duration constraints determine feasible schedules and the binding path.
Critical Success Factor Domain-specific is a kind of Constraint
The domain of application is the set of candidate implementations or operating states for a declared strategy.
Cyclic surgery theorem Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by manifold compactness, orientability, irreducibility, torus boundary, non-Seifert and non-solid-torus hypotheses, slopes, Dehn filling convention, cyclic fundamental groups, and distance conclusion.
D-block contraction Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the element series and electron configurations, compared radii and reference trend, shielding argument and effective nuclear charge, observed contraction, linked ionization or bonding consequences and distinction from lanthanide contraction.
Decisional Diffie–Hellman assumption Domain-specific is a kind of Constraint
What makes it its own entry: The cryptographic hardness assumption that a genuine Diffie–Hellman tuple is computationally indistinguishable from one with an independent random final group element.
Defective matrix Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the square matrix and scalar field, characteristic polynomial and eigenvalues, algebraic and geometric multiplicities, eigenspace dimensions, missing eigenvector count, diagonalizability test, generalized eigenvectors and Jordan blocks and numerical sensitivity.
Deficient number Domain-specific is a kind of Constraint
Membership is literally determined by the strict inequality constraint on an arithmetic function; What makes it its own entry: the exact proper-divisor-sum inequality on positive integers, rather than smallness, primality, scarcity of divisors, or an informal failure to reach a target.
Delone Set Domain-specific is a kind of Constraint
**Constraint** is the broader abstraction this entry instantiates.
Diaconescu's theorem Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the constructive foundation and exact choice principle, arbitrary proposition, proposition-dependent sets or epimorphism, selected section, extensionality and separation assumptions and derivation of excluded middle.
Diophantine Equation Domain-specific is a kind of Constraint
**`prime:constraint`** is the broader abstraction this entry instantiates.
Diophantine quintuple Domain-specific is a kind of Constraint
The set is defined by a complete network of pairwise arithmetic constraints.
Disjunct matrix Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by for every column and every set of at most d other columns, a row witnesses the column with 1 and all competitors with 0 under the stated Boolean outcome model.
Document Structure Description Domain-specific is a kind of Constraint
The schema constrains valid XML document structures and values.
Domain (ring theory) Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by the ring is nonzero, multiplication and sidedness conventions are fixed, and every zero product has a zero factor.
Double Mersenne number Domain-specific is a kind of, typical Constraint
Double Mersenne number membership is the checkable existence condition n = 2^(2^p-1) - 1 for some prime p.
Doubly stochastic matrix Domain-specific is a kind of Constraint
The class is defined by simultaneous nonnegativity and two sets of linear sum constraints.
DSPACE Domain-specific is a kind of Constraint
DSPACE constrains computational memory usage.
Duty of Prudence Domain-specific is a kind of Constraint
Duty of Prudence instantiates Constraint because it restricts a trustee's legally available choices and processes by a context-sensitive standard of prudent fiduciary administration.
Elliptic operator Domain-specific is a kind of Constraint
Ellipticity constrains the leading symbol in every nonzero direction.
Equalized odds Domain-specific is a kind of Constraint
**Constraint** (`prime:constraint`).
Equichordal point problem Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by body regularity and convexity, interior points, full chord rather than half-chord convention, point-specific constants, and theorem status match the solved problem.
Essentialia negotii Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the jurisdiction and transaction type, parties, alleged agreement, legally essential terms, agreed or determinable content, gap-filling rules, certainty, intention and consequence of omission.
Estoppel in English law Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the English jurisdiction and date, specific estoppel species, representation or shared assumption, knowledge and intention requirements, reliance and detriment, unconscionability if relevant, right asserted, defense or cause-of-action status and remedy.
Factor-critical graph Domain-specific is a kind of Constraint
The graph satisfies a universal deletion-and-matching constraint.
Fat object (geometry) Domain-specific is a kind of Constraint
Fatness constrains admissible geometry by cross-direction extent.
Feasibility condition Domain-specific is a kind of Constraint
Feasibility condition is a strict kind of Constraint: The feasibility condition is a fundamental concept in microeconomics used in conjunction with the tangency condition to solve the consumer choice problem and derive the demand function.
Fermat number Domain-specific is a kind of Constraint
Fermat-number membership is literally an exact formula constraint on an integer and index; What makes it its own entry: the exact double-exponential sequence and its product identities, distinct from arbitrary numbers of form 2^m+1 or from the subset of Fermat primes.
Finite morphism Domain-specific is a kind of Constraint
Finiteness constrains a morphism through module-finite coordinate algebras.
Flexible Algebra Domain-specific is a kind of Constraint
The accepted reference-grade review places Flexible Algebra under Constraint because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Forcing (computability) Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the computability objective, condition poset and ordering, names or finite approximations, dense sets and effectiveness level, generic filter or sequence, forcing relation, construction and verification of the resulting degree or set.
Formally real field Domain-specific is a kind of Constraint
Formal reality constrains sums of squares and permissible orderings.
Formation rule Domain-specific is a kind of Constraint
Formation rules constrain admissible symbolic structures.
Fragment (logic) Domain-specific is a kind of Constraint
A fragment constrains the expressions allowed by a formal language.
Friendly-index set Domain-specific is a kind of Constraint
Friendly labelings literally satisfy a global balance constraint and the invariant is generated over that constrained family.
Frink ideal Domain-specific is a kind of Constraint
The identity constrains which subsets are closed under a finite order operation.
Generic filter Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by the filter obeys the order convention and meets each dense subset of the forcing notion that lies in the declared ground model.
Guard (computer science) Domain-specific is a kind of Constraint
Guard (computer science) is a strict kind of Constraint: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.
Hadamard matrix Domain-specific is a kind of Constraint
Hadamard Matrix instantiates Constraint because its class is exactly the set of square matrices satisfying the joint sign-entry and Gram-orthogonality restrictions.
Hanani–Tutte theorem Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the graph and topological drawing, general-position conventions, independent-edge definition, parity count for every required edge pair and claimed strong or weak planarity conclusion.
Hardening (computing) Domain-specific is a kind of Constraint
Hardening literally limits a system's permitted functions, privileges, interfaces, and configurations to guide it away from exploitable states; cybersecurity baselining and drift control supply the domain-specific specialization.
Health insurance mandate Domain-specific is a kind of Constraint
The mandate imposes a participation constraint on insurance actors.
Higher spin alternating sign matrix Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the size and positive integer spin, allowed integer entries, traversal direction, row and column partial-sum bounds, terminal line sums, normalization, ordinary-ASM specialization, symmetry class, and enumeration or model correspondence.
Highly irregular graph Domain-specific is a kind of Constraint
The class is defined by a local degree-distinctness constraint.
Hilbert system Domain-specific is a kind of Constraint
The calculus constrains which formula sequences count as proofs.
Hyperperfect number Domain-specific is a kind of Constraint
Hyperperfect membership is literally defined by satisfying an exact arithmetic constraint; divisor-sum semantics and integer parameterization form the DS residual.
Hyperproperty Domain-specific is a kind of Constraint
**Constraint** is the broader abstraction this entry instantiates because a hyperproperty partitions trace-set systems into admissible and inadmissible ones.
Ice-Type Model Domain-specific is a kind of Constraint
**Constraint** is the strict parent because the ice rule restricts local possibilities and thereby organizes every global outcome.
Incompatibility of quantum measurements Domain-specific is a kind of Constraint
The identity constrains which quantum observables can share a joint realization.
Incompressible surface Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the three-manifold and embedded surface, properness and two-sidedness conventions, sphere and boundary exceptions, essential loops, compressing-disk test and fundamental-group injectivity formulation.
Independent set (graph theory) Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the graph and directed or simple convention, selected vertex subset, pairwise nonadjacency condition, complement-clique equivalence, cardinality or weight, maximal versus maximum status, independence number and computational complexity.
Indicator function (convex analysis) Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the ambient vector space and set, extended-real codomain, zero-inside and positive-infinity-outside convention and any convexity or closure assumptions.
Isothermal Process Domain-specific is a kind of Constraint
**Constraint — the broader abstraction.** Isothermal Process restricts the feasible thermodynamic path to the level set \(T=T_0\).
Khintchine inequality Domain-specific is a kind of Constraint
The theorem bounds one norm uniformly by another under random signs.
Knaster's condition Domain-specific is a kind of Constraint
The property constrains uncountable configurations in a poset.
Lacunary value Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the domain X, complex-valued function and image, candidate complex value, nonmembership proof, holomorphic meromorphic or general function class, singularities and extension conditions, Picard or related bound and examples.
Leontief utilities Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the goods and nonnegative bundle, positive fixed-proportion coefficients, normalized quantities x-i over w-i, minimum utility formula, perfect-complements interpretation, L-shaped indifference curves, demand under prices and budget and bottleneck and excess-input behavior.
Limit state design Domain-specific is a kind of Constraint
The method enforces multiple performance and failure constraints under uncertainty.
Linear matrix inequality Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the real symmetric or complex Hermitian matrices, affine variable map, semidefinite ordering, feasible variables, strict or nonstrict convention and any Schur-complement equivalence.
Liouville's theorem (differential algebra) Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the differential field and constant field, elementary extension class, integrand, claimed primitive, derivative and logarithmic-derivative decomposition, hypotheses on constants and use in a nonelementarity proof.
Matching (graph theory) Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the graph and direction convention, selected edge set, endpoint-disjoint condition, maximal maximum or perfect qualification, weights if any and algorithm or certificate.
Matrix grammar Domain-specific is a kind of Constraint
What makes it its own entry: A matrix is a sequence of rules, not an array of numeric coefficients, and ordinary context-free derivation permits rules independently.
McDiarmid's inequality Domain-specific is a kind of Constraint
The theorem turns bounded coordinate influence into a probabilistic deviation constraint.
Mechanical Constraint Domain-specific is a kind of Constraint
A mechanical kinematic restriction is a constraint on admissible physical configurations or motions.
Metrical Bridge Domain-specific is a kind of Constraint
A bridge restricts admissible or expected word boundaries at a specified verse position.
Monochrome Domain-specific is a kind of Constraint
Monochrome restricts the admissible colors of a visual carrier to one hue family, or to an achromatic value range under a grayscale convention.
Newbury principles Domain-specific is a kind of Constraint
The domain is the set of conditions an authorized planning authority might attach to a particular development consent.
Nine lemma Domain-specific is a kind of Constraint
The candidate literally instantiates prime:constraint; its homological_algebra restrictions provide the domain-specific residual.
No-cloning theorem Domain-specific is a kind of Constraint
The theorem imposes a structural impossibility on allowed transformations.
Non-aggression principle Domain-specific is a kind of Constraint
The principle imposes an admissibility boundary on conduct: initiatory force is excluded while defense is conditionally permitted.
Noncototient Domain-specific is a kind of Constraint
Membership is defined by the impossibility of satisfying a totient-derived equation.
Nonviolence Domain-specific is a kind of Constraint
**Constraint** is the strict parent by composition/presupposition because nonviolence defines and maintains a boundary on admissible conflict means.
Norm (philosophy) Domain-specific is a kind of Constraint
Norms constrain or guide action through prescriptive force.
Normal operator Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the complex Hilbert space, bounded linear operator and adjoint, equality T-star T equals T T-star, equivalent norm condition, spectrum and spectral measure, unitary diagonalization in finite or compact cases and self-adjoint unitary and skew-adjoint subclasses.
Normal space Domain-specific is a kind of Constraint
Normality constrains which disjoint sets admit disjoint neighborhoods.
Nowhere commutative semigroup Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the carrier and associative operation, universal conditional ab equals ba implies a equals b, equivalent identities aba equals a and abc equals ac, idempotence and rectangular-band representation.
Obstruction theory Domain-specific is a kind of Constraint
What makes it its own entry: A family of topological methods that assigns cohomological classes whose vanishing determines whether a partial construction extends to the next dimension.
Orthocentric system Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the four planar points and nondegeneracy assumptions, six connecting lines, perpendicular disjoint pairs, four induced triangles, orthocenter relation and common nine-point-circle or circumradius consequences.
Perfect number Domain-specific is a kind of Constraint
Perfection is literally the feasible class cut out from positive integers by the checkable equality sigma(n)=2n; divisor arithmetic and the even-odd theory provide the autonomous specialization.
Perfect ruler Domain-specific is a kind of Constraint
The ruler is defined by simultaneous coverage and uniqueness constraints on differences.
Polynomial identity ring Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by a nonzero polynomial identity, coefficient base, variable count, evaluation convention, and any monic or characteristic restriction are stated and hold universally.
Positive-real function Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by the function is real-rational under the declared convention, analytic in the right half-plane, real on the real axis where defined, and has nonnegative real part throughout the right half-plane.
Prime ideal Domain-specific is a kind of Constraint
Primality is a closure-and-factor constraint on ideals.
Primitive ring Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the ring and identity convention, left or right orientation, module and action, simplicity and faithfulness, annihilator, maximal one-sided ideal characterization, Jacobson density representation and examples separating left from right.
Proper forcing axiom Domain-specific is a kind of Constraint
The axiom imposes a simultaneous dense-set meeting condition on proper partial orders.
Proper transfer function Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the input-output convention, rational numerator and denominator in reduced form, pole and zero degrees, relative degree, proper or strictly proper class and realization or causality assumptions.
Qualification problem Domain-specific is a kind of Constraint
Qualifications constrain whether an action transition is licensed.
Quartic graph Domain-specific is a kind of Constraint
The class is defined by a uniform degree constraint.
Quasi-algebraically closed field Domain-specific is a kind of Constraint
The C1 identity literally constrains the admissible relation between degree and variable count so that a rational zero must exist.
Quasiperfect number Domain-specific is a kind of Constraint
The number class is literally cut out by one exact arithmetic equality on the divisor-sum function; the open existence question and derived factor restrictions supply the specialization.
Quasitrace Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by homogeneity, tracial symmetry, commuting additivity, and the declared matrix-level extension all hold, with boundedness or normalization separately stated.
Real-time computing Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the system and clock, tasks and release model, deadlines and hard firm or soft class, worst-case execution and blocking, scheduler and priority, resource sharing, interrupt latency, overload handling and timing evidence.
Regular space Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the topological space and convention, arbitrary closed set and exterior point, two open neighborhoods, containment and disjointness, equivalent neighborhood-closure condition, T1 or Hausdorff qualification and examples and counterexamples.
Regulated verse Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the Chinese text and date, form subtype, number and length of lines, historical tone classification, tone template and permitted variations, rhyme category and positions, parallel couplets, caesura and translation limitations.
Relevance logic Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the formal language, implication connective, proof calculus and structural rules, semantic frame or algebra, relevance condition, treatment of weakening and contraction and status of material-implication paradoxes.
Requirement Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by a clearly scoped subject, required condition, governing authority or rationale, and feasible verification or validation criterion are stated and traceable.
Restricted product Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the index set, local groups and topologies, exceptional indices, compact open subgroups, finite-deviation membership condition, componentwise operation, basis of open sets and proof of local compactness.
Right triangle Domain-specific is a kind of Constraint
The exact right-angle requirement literally restricts the space of all Euclidean triangles and forces the distinguished side and similarity structure; those geometric consequences provide the autonomous residual.
Rule Against Perpetuities Domain-specific is a kind of Constraint
The rule excludes certain future interests by a binding temporal validity condition.
SC (complexity) Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the decision problem and input length, deterministic machine model, polynomial time bound, polylogarithmic space bound and fixed exponents, same-algorithm requirement, DTISP notation, containments with L NC P and PolyL and named complete or open problems.
Semiprimitive ring Domain-specific is a kind of Constraint
The class constrains a ring's Jacobson radical to vanish.
Separable polynomial Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the base field and characteristic, polynomial and degree, algebraic closure, distinct-root count, formal derivative, greatest common divisor and treatment of reducible or zero-derivative cases.
Serviceability failure Domain-specific is a kind of Constraint
The condition is failure to remain within a declared performance constraint.
Η set Domain-specific is a kind of Constraint
The property constrains realization of all small order cuts.
Set estimation Domain-specific is a kind of Constraint
Every estimate is produced by intersecting compatibility constraints.
Set inversion Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the domain and codomain, function and regularity, target set and constraint form, desired preimage, search region, interval extension, inclusion tests, subdivision and termination tolerances and inner and outer guarantees.
Single-crossing condition Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the ordered domain and alternatives, compared functions or preference relation, weak or strict formulation, crossing direction, treatment of equality intervals and implications for monotone choice or distribution order.
Slitherlink Domain-specific is a kind of Constraint
Slitherlink instantiates Constraint because a solution is an edge assignment admitted by fixed local counts, vertex degrees, and a global one-cycle condition.
Small cancellation theory Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the generators and symmetrized relator set, cyclic reduction, piece definition, overlap length, chosen small-cancellation condition and threshold, van Kampen diagrams, curvature or Greendlinger conclusion and group-theoretic consequence.
Special Ordered Set Domain-specific is a kind of Constraint
An SOS is a strict instance of **Constraint**.
Specified subject condition Domain-specific is a kind of Constraint
The condition restricts transformations by structural locality.
Square principle Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the ambient theory and cardinal or class, indexed club sequence, limit domains, order-type or width bounds, coherence equation, no-thread condition and consistency or implication claim.
Standing (law) Domain-specific is a kind of Constraint
Standing constrains access to adjudication through party-and-injury requirements.
Starlike tree Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the finite tree, unique central vertex and degree k at least three, path components after removal, positive branch lengths and vertex count, isomorphism under branch permutation, star-graph specialization and spectral or extremal properties.
Strictly simple group Domain-specific is a kind of Constraint
The property constrains a group's ascendant-subgroup lattice.
Strong antichain Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by the set is an antichain and every distinct pair lacks the declared common lower or upper bound in the whole poset.
Subjacency Domain-specific is a kind of Constraint
Subjacency formally restricts syntactic movement steps across designated bounding nodes, a specialized constraint.
Super-Poulet number Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the positive composite integer, complete divisor set, base two, congruence for each divisor, exclusion of primes and any construction or enumeration claim.
Supercompact space Domain-specific is a kind of Constraint
Supercompactness is a strong constraint on the cover structure of a topology.
Superperfect number Domain-specific is a kind of Constraint
Superperfect number membership is the checkable iterated divisor-sum equation sigma(sigma(n)) = 2n, structurally the same pattern as perfect and hyperperfect numbers.
System Requirements (Spacecraft System) Domain-specific is a kind of Constraint
**Constraint** is the strict parent because every requirement excludes otherwise possible designs or operations according to a mission-bound acceptance condition.
Tacnode Domain-specific is a kind of Constraint
A tacnode is defined by a local singularity condition on curve branches.
Thinking processes (theory of constraints) Domain-specific is a kind of Constraint
What makes it its own entry: A suite of causal-diagram methods in the theory of constraints for identifying a core conflict, designing a future state and planning the transition to it.
Tightness of measures Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by for every positive tolerance the required compact set exists under the declared single-measure or uniform-family quantifiers.
Total functional programming Domain-specific is a kind of Constraint
Total Functional Programming instantiates Constraint because it restricts the admissible program space to definitions satisfying totality and termination proofs.
Transitively normal subgroup Domain-specific is a kind of Constraint
The property imposes a universal inheritance constraint on subgroup normality.
Triangle-free graph Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the finite or infinite undirected graph, simplicity convention, triangle as a three-cycle or three-clique, induced-versus-noninduced convention and proof, algorithm or extremal claim.
Triangle inequality Domain-specific is a kind of Constraint
It constrains admissible distance assignments and path comparisons.
Truncated normal distribution Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by support, original normal parameters, truncation bounds, and normalization constant are all declared consistently.
Tsirelson space Domain-specific is a kind of Constraint
The construction engineers a Banach norm under simultaneous reflexivity and subspace-exclusion constraints.
Typed assembly language Domain-specific is a kind of Constraint
The type system constrains legal low-level machine states and transitions.
Typing rule Domain-specific is a kind of Constraint
Typing rules constrain admissible term-type judgments.
Unate function Domain-specific is a kind of Constraint
Unateness constrains each Boolean coordinate to one fixed polarity.
Unconscionability in English law Domain-specific is a kind of Constraint
The doctrine constrains enforcement of formally consensual obligations when exploitation crosses an equitable threshold.
Unenforced law Domain-specific is a kind of Constraint
The jurisdiction and time period supply a domain of conduct; the formally valid legal command supplies a condition partitioning conduct into legally admissible and prohibited cases; and the continuing rule preserves that normative restriction even when ordinary sanctions are absent.
Uniform module Domain-specific is a kind of Constraint
Uniformity constrains the entire submodule lattice by a nonzero-intersection law.
Unimodular matrix Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the square integer matrix and dimension, determinant plus or minus one, integer inverse and adjugate equivalence, membership in GL-n of Z, lattice bijection and volume preservation, closure under product and inverse and distinction from totally unimodular and complex unit-modulus conventions.
Universal grammar Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the claimed innate endowment, class of possible grammars, acquisition mechanism and input, poverty-of-stimulus argument, proposed universals or constraints, cross-linguistic evidence, developmental predictions and competing usage-based or general-learning explanations.
V-Ring (Ring Theory) Domain-specific is a kind of Constraint
**Constraint** is the strict parent because the V-ring class is the feasible subset of rings satisfying the explicit universal condition that every simple module on the stated side is injective.
Variation diminishing property Domain-specific is a kind of Constraint
The property imposes a global no-new-variation constraint on a transformation.
Vicious circle principle Domain-specific is a kind of Constraint
The principle constrains admissible definitions through dependency order.
Wall–Sun–Sun prime Domain-specific is a kind of Constraint
Membership is defined by a rare squared-divisibility constraint on prime-indexed Fibonacci behavior.
Waraszkiewicz spiral Domain-specific is a kind of Constraint
What makes it its own entry: the domain-specific identity determined by the planar continuum follows the declared Waraszkiewicz construction and the asserted pairwise incomparability or universality obstruction is proved under continuous surjections.
Well-quasi-ordering Domain-specific is a kind of Constraint
The property constrains all infinite sequences by an increasing-pair condition.
Widows and orphans Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the publication and layout engine, paragraph and region boundaries, definitions of widow, orphan and runt, minimum-line rule, reflow and spacing tolerances, priority against other composition constraints and visual review.
XOR gate Domain-specific is a kind of Constraint
The gate enforces a Boolean parity condition on input-output combinations.
XYZ inequality Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the finite poset, three incomparable elements, uniform linear-extension measure, exact precedence probabilities and stated XYZ inequality and equality conditions.
Z-matrix (mathematics) Domain-specific is a kind of Constraint
It remains its own entry because its identity is fixed by the real square matrix, dimensions, each off-diagonal entry and inequality, diagonal freedom, negated-Metzler equivalence, subclass tests and application-specific Jacobian interpretation.
Access Control Prime is a kind of Constraint
Access control is a specific kind of constraint, restricting admissible principal-action-resource combinations to those satisfying a security policy.
Circuit Breaker Prime is a kind of Constraint
Circuit breaker is a specific kind of constraint, imposing a binding threshold that interrupts flow once a danger level is exceeded.
Coastal Squeeze Prime is a kind of, typical Constraint
'not generic constraint; the specific geometry of advancing-front and fixed-rear and immobile-subject that produces monotonic compression without exit.' A specialization of constraint with a mobility-asymmetry signature.
Commitment Prime is a kind of Constraint
A commitment is a reflexive (self-imposed) constraint-creation on one's own future; commitment is a kind-of constraint (the existing commitment_device already sits under constraint).
Complexity (Time/Space) Prime is a kind of Constraint
Computational complexity is a specific kind of constraint, binding admissible algorithms to those whose resource growth rate keeps problems practically solvable.
Confidentiality Prime is a kind of Constraint
Confidentiality is the information-use species of constraint, restricting an authorized holder's admissible disclosures and downstream actions.
Containment Prime is a kind of Constraint
Containment is a kind of constraint: a maintained perimeter restricts the admissible reach of an entity, process, or hazard.
Error Proofing (Poka-Yoke) Prime is a kind of Constraint
Error Proofing is a kind of constraint: the system is designed so that error states are physically inadmissible or immediately detected.
Interference and Contention Prime is a kind of Constraint
Interference and contention is a specific kind of constraint, where shared-resource competition restricts admissible concurrent throughput.
Irreducible Floor Prime is a kind of Constraint
The floor 'is a constraint, formally a binding inequality at the optimum' but adds the two-level structure (intra-regime vs structural lever) the general constraint concept does not carry.
Latency Prime is a kind of Constraint
Latency is a specific kind of constraint, binding system response time below an irreducible transit minimum.
Liebig's Law of the Minimum Prime is a kind of Constraint
Liebig's Law is Constraint specialized to the binding minimum among non-substitutable complementary inputs.
Pigeonhole principle Prime is a kind of Constraint
The accepted reference-grade review places Pigeonhole principle under Constraint because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Rate Limiting Prime is a kind of, typical Constraint
A rate limit is a temporal constraint on consumption (units per time per actor); a specialization of constraint.
Receptor Saturation Prime is a kind of Constraint
Receptor Saturation is a kind of constraint: a finite count of binding sites caps the system's response regardless of further input.
Requisite Variety Prime is a kind of Constraint
Requisite Variety is a kind of constraint: it imposes a binding lower bound on the regulator's variety relative to disturbance variety.
Aggregate Supply Domain-specific is part of Constraint
Aggregate supply contains a binding constraint whose identity migrates from nominal adjustment in the short run to productive capacity in the long run.
All-Interval Tetrachord Domain-specific is part of Constraint
the all-ones vector is an exact membership condition.
Aztec Diamond Domain-specific presupposes Constraint
**Constraint.** Every admissible tiling must satisfy a strict exact-cover rule.
Barycentric-sum problem Domain-specific is part of Constraint
The selected subsequence is admissible only when some selected term satisfies the hard finite-group equality `Σ a_i = k a_j`.
Baxter Permutation Domain-specific presupposes Constraint
**Constraint** is the broader abstraction this entry instantiates.
Boundary Value Problem Domain-specific is part of Constraint
Boundary conditions are internal Constraints that prune the equation's solution family to functions matching prescribed edge data.
Bounded Storage Model Domain-specific is part of Constraint
A hard cap on adversarial retained source information is constitutive of every admitted bounded-storage experiment.
Cauchy's Equation Domain-specific presupposes Constraint
Cauchy's Equation presupposes Constraint: the parent's defining role is necessary to the child's frozen mechanism or criterion.
Classical Unities Domain-specific presupposes Constraint
The classical-unities doctrine requires prescriptive limits on dramatic construction.
Cognitive Load Domain-specific presupposes Constraint
Cognitive load presupposes constraint because the working-memory budget is a binding restriction on admissible processing demands.
Dependency Hell Domain-specific is part of Constraint
Mechanically checkable version constraints are constitutive parts of the dependency-hell feasibility problem.
Edgeworth Paradox Domain-specific is part of Constraint
A binding capacity Constraint below total demand is the strict constituent that discontinuously changes the price-competition best responses.
Expander code Domain-specific is part of Constraint
Local code checks are binding constraints internal to an expander code.
Flux Limiter Domain-specific presupposes Constraint
Flux Limiter presupposes prime:constraint because its nonlinear function restricts candidate flux corrections to an admissible nonoscillatory envelope.
Fracton (Subdimensional Particle) Domain-specific presupposes Constraint
An isolated fracton presupposes a binding restriction on the local operations that could move it without altering other excitations.
Game Domain-specific presupposes Constraint
A game is not a constraint; its playable identity presupposes constraints that delimit permitted actions, outcomes, resources, or state transitions.

Condition / exception Constraint supplies the constitutive rule boundary, but a game also requires participants, meaningful play states, and challenge or outcome structure.
Geometrical Frustration Domain-specific presupposes Constraint
Geometrical frustration presupposes a geometric compatibility constraint on local preferences, but is not itself a constraint.
Kinetic depth effect Domain-specific is part of Constraint
Kinetic depth contains a hard rigidity constraint that excludes deforming 3D candidates and makes the moving projection solvable.
Matching Domain-specific presupposes Constraint
Matching presupposes constraint because pairwise vertex-disjointness is the hard condition that prunes all edge subsets to the feasible matching family.
Miller's Law (7 ± 2) Domain-specific is part of Constraint
Miller's Law contains a hard small-integer Constraint on the number of independently active units admitted to immediate recall or judgment.
Nine-Point Conic Domain-specific presupposes Constraint
The accepted reference-grade review places Nine-Point Conic under Constraint because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Paranormal Operator Domain-specific is part of Constraint
the inequality selects a proper class from all bounded operators.
Pinch analysis Domain-specific presupposes Constraint
**Optimization** (`prime:optimization`).
Roman Dominating Set Domain-specific is part of Constraint
A required local predicate permits a zero label only beside a two-labeled neighbor.
Rooker–Feldman Doctrine Domain-specific presupposes Constraint
Rooker–Feldman Doctrine presupposes Constraint: the parent's defining role is necessary to the child's frozen mechanism or criterion.
Schneider–Lang Theorem Domain-specific presupposes Constraint
The theorem composes **Constraint**: analytic growth and arithmetic degree impose an explicit upper constraint on the admissible common-value locus.
Sullivan Conjecture Domain-specific presupposes Constraint
The Sullivan Conjecture compositionally presupposes **Constraint** in the precise sense that it establishes a severe admissibility result for homotopy classes of maps from \(BG\) into \(X\): the based mapping space has only the weak type of.
Sum-Free Sequence Domain-specific presupposes Constraint
Sum-Free Sequence compositionally presupposes **Constraint**: at each index, the next integer must lie outside the subset-sum closure of the predecessor prefix.
Sun–Ni Law Domain-specific presupposes Constraint
**Constraint — strict presupposition.** Memory capacity is the constitutive bound used to select the scaled workload.
Time Geography Domain-specific presupposes Constraint
the broader abstraction; capability, coupling, and authority constraints jointly delimit feasible paths and projects.
Tractable Problem Domain-specific presupposes Constraint
Tractable Problem presupposes Constraint: the parent's defining role is necessary to the child's frozen mechanism or criterion.
Venus Effect Domain-specific is part of Constraint
An exact optical Constraint is a constituent of the Venus Effect because reflection geometry makes the accepted self-regarding configuration inadmissible.
Working Memory Domain-specific is part of Constraint
Working Memory contains binding capacity and duration constraints that force rehearsal, replacement, and competition among active representations.
Activation Energy Prime presupposes Constraint
Activation energy presupposes constraint because the barrier defines a binding threshold below which the process cannot proceed.
Bypassed Safeguard Prime presupposes, typical Constraint
A bypassed safeguard presupposes a protective control (a constraint installed to prevent a hazard) that operators route around under production pressure; it is a failure mode OF a constraint, built on the safeguard it disables.
Checks and Balances Prime presupposes Constraint
Checks and Balances presupposes Constraint: each authority is bound by reciprocal restrictions that exclude unilateral action.
Commitment Device Prime presupposes Constraint
A commitment device presupposes constraint because its function is to deliberately restrict the future feasible set of one's later self.
Consistency Prime presupposes Constraint
'Consistency is a META-property of a COLLECTION of constraints' — whether the intersection of all their admissible regions is nonempty.
Decision Prime presupposes Constraint
Decision presupposes constraint because selecting one alternative from a set requires that the admissible set be defined by binding restrictions.
Degrees of Freedom Prime presupposes Constraint
Degrees of freedom presupposes constraint because counting independent parameters only becomes meaningful once binding restrictions on configurations are specified.
Design for Implementation Prime presupposes Constraint
Design for implementation presupposes constraint because the discipline is precisely the inclusion of production and operational limits as binding restrictions on design choices.
Dimensional Analysis Prime presupposes Constraint
Dimensional analysis presupposes constraint because dimensional homogeneity is a binding restriction on which equations among physical quantities can be admissible.
Efficiency Prime presupposes Constraint
Efficiency presupposes constraints because they define the feasible alternatives against which resource use and result are judged.
Embeddability Prime presupposes Constraint
Embeddability requires binding ambient and conflict Constraints that divide possible placements into admissible and forbidden sets.
Improvisation Prime is part of Constraint
A live backbone of rules, resources, timing, or form is a constitutive part of improvisation rather than an incidental limitation.
Linear Programming (LP) Prime is part of Constraint
Linear Programming contains linear Constraints that define which candidates are feasible.
Minimalism Prime presupposes Constraint
Minimalism presupposes constraint because its disciplined stripping-away operates as a binding restriction on what counts as admissible in the design.
Need–Solution Alignment Prime is part of Constraint
The need is operationalized through binding conditions the solution must satisfy in the beneficiary's context.
Reactance Prime presupposes Constraint
Reactance presupposes constraint because the motivational state only arises when a perceived freedom is threatened or restricted by an external limit.
Rule of Least Power (Minimum Sufficient Capability) Prime presupposes, typical Constraint
Rule_of_least_power 'prescribes WHICH constraints to prefer (those that bound expressiveness)' — a design discipline of choosing the most constrained mechanism sufficient for function.
Shared-Interface Constraint Conflict Prime is part of Constraint
Mutually unsatisfiable receiver constraints are internal constituents of the conflict rather than optional background conditions.
Structural Violence Prime presupposes Constraint
Structural violence presupposes constraint because the harm it names is produced by social arrangements that systematically restrict admissible life-courses.
Trade-offs Prime presupposes Constraint
Trade-offs presuppose constraint because the inability to improve all dimensions simultaneously is what makes the feasible set bounded by a frontier.
Aspect Qualifier Domain-specific is a decomposition of Constraint
The qualifier and its applicability rule jointly restrict a descriptor to an admissible sense and forbid unlicensed descriptor-qualifier pairings.
Contraindication Domain-specific is a decomposition of Constraint
Removing clinical vocabulary leaves a conditional constraint that prohibits a generally permitted action when a named context flips its balance against use.
Feasible Region Domain-specific is a decomposition of Constraint
Removing optimization geometry from Feasible Region leaves Constraint's exact candidate-domain, admissibility-condition, and feasible-set structure.
Type System Domain-specific is a decomposition of Constraint
Removing formal-language machinery preserves the binding restrictions a type system places on which categorized expressions may legally combine.
Working Memory Capacity Domain-specific is a decomposition of Constraint
Working Memory Capacity is the human active-workspace form of a Constraint, partitioning simultaneous content sets into those within and beyond a cap.
Bottleneck Prime is a decomposition of Constraint
A bottleneck is the specific shape a constraint takes when one stage's limited capacity binds the throughput of an entire pipeline.
Bounded Rationality Prime is a decomposition of Constraint
Bounded rationality is the specific shape constraint takes when the binding restrictions act on cognitive, informational, and time resources of decision-makers.
Engineering Tolerances Prime is a decomposition of Constraint
Engineering tolerances is the specific shape constraint takes when admissible variation around a nominal target is explicitly bounded for component acceptance.
Immutability Prime is a decomposition of Constraint
Immutability is the specific shape a constraint takes when in-place modification of a value or record is forbidden across all subsequent operations.
Mandatory vs. Default Norms Prime is a decomposition of Constraint
Mandatory versus default norms is the specific shape constraint takes when rules are sorted by whether they can or cannot be opted out of.
Normativity Prime is a decomposition of Constraint
Normativity is the specific shape constraint takes when the binding restriction is an evaluative standard against which states can be judged correct or incorrect.
Oversight Capacity Prime is a decomposition of Constraint
Oversight capacity is the specific shape a constraint takes on the number of direct sub-units a single supervising entity can effectively manage.
Scarcity Prime is a decomposition of Constraint
Scarcity is the specific shape constraint takes when the binding restriction is finite supply relative to competing demands on a resource.

Not to Be Confused With¶

Constraint is not Uncertainty because Uncertainty is incompleteness of knowledge or measurement, while Constraint is a definite restriction on what is possible or permitted.
Constraint is not Optionality because Optionality is the freedom to choose among possibilities, while Constraint is the reduction of possibility space to a subset of what is logically possible.
Constraint is not Requisite Variety because Requisite Variety is the principle that a control system must have at least as much variety as the system it controls, while Constraint is a restriction on variable values or action possibilities.
Constraint is not Dimension because Dimension is a measurable attribute or axis along which variation occurs, while Constraint is a restriction on the values or relationships that attributes can take.
Constraint is not Scheduling because Scheduling assigns tasks to resources over time respecting some constraints, while Constraint is the restriction itself (precedence, capacity, deadline limits) that scheduling must respect.