Subadditivity¶
Core Idea¶
Subadditivity is the one-sided composition law that evaluating a combined whole never produces more than the sum of evaluating its parts separately. In its familiar additive form, a function \(f\) is subadditive when
for every admissible pair \(x,y\). The plus sign is not essential. The domain can combine objects by vector addition, set union, concatenation, joint formation, or another associative operation. What matters is that the same two routes can be compared: combine first and evaluate once, or evaluate the pieces and add their values. Subadditivity says the first route cannot exceed the second.
Broad Use¶
Normed geometry and analysis. Every norm obeys \(\|x+y\|\leq\|x\|+\|y\|\): the triangle inequality is exactly subadditivity of the magnitude map on vector addition. Together with a norm's absolute homogeneity, the triangle inequality makes every norm ball convex; by itself it also turns local component bounds into a bound on a vector sum. The domain-specific catalog entry norm adds vector-space structure, homogeneity, and definiteness; subadditivity isolates the one constituent law that also survives far outside vector spaces.
Clarity¶
Subadditivity clarifies a common ambiguity in claims that “combining helps.” That phrase can mean at least four different things: a one-off saving, a decreasing average, a causal synergy, or a universal upper-bound law. The abstraction asks for the exact object and exact comparison. What is the carrier? How are two objects combined? What map evaluates both the whole and the pieces? Over which scope is the inequality universal? Once those four fields are filled, the claim becomes testable rather than rhetorical.
Manages Complexity¶
The central compression is to replace evaluation of a difficult composite object with a sum of tractable component evaluations. If a rare failure event is a union of many simpler events, the union bound replaces dependence-sensitive exact computation with a sum of marginal probabilities. If a long stochastic route is decomposed into segments, subadditivity replaces a global path optimization with segmentwise upper bounds. If a bundle's value or production cost is hard to compute jointly, separate valuations give a certified ceiling.
Abstract Reasoning¶
Forward inference: decompose and bound. Once subadditivity is established, choose any legal decomposition and sum the easier values. The conclusion is guaranteed to sit above the whole. This is the union-bound move in probability, triangle-inequality move in analysis, and stand-alone-cost comparison in economics.
Refutation by witness. Because the claim is universal, one pair with \(f(x\oplus y)>f(x)+f(y)\) is decisive.
Knowledge Transfer¶
The transfer case is strongest when roles are mapped rather than examples merely listed.
- In a norm, vectors are the carrier, vector addition is combination, the norm is the evaluation, and the triangle inequality is the whole-below-sum invariant.
- In probability, events are the carrier, union is combination, probability is the evaluation, and event overlap is the non-negative slack.
- In information theory, random-variable systems are the carrier, joint formation is combination, entropy is the evaluation, and mutual information is the slack between marginal sum and joint whole.
- In production economics, output vectors are the carrier, vector addition is combination, minimum cost is the evaluation, and joint-production savings are the slack.
- In combinatorial allocation, item sets are the carrier, union is combination, a bidder's valuation is the evaluation, and absence of positive complementarity is the subadditive restriction.
- In a stochastic path process, adjacent intervals or path segments are the carrier, concatenation is combination, optimal passage time is the evaluation, and route re-optimization can only improve on the concatenated segment costs.
Relationships to Other Abstractions¶
Current abstraction Subadditivity Prime
Parents (3) — more general patterns this builds on
-
Subadditivity is a kind of Function (Mapping) Prime
The accepted reference-grade review places Subadditivity under Function (Mapping) because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
-
Subadditivity presupposes Order Prime
The accepted reference-grade review places Subadditivity under Order because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
-
Subadditivity presupposes Semigroup Prime
The accepted reference-grade review places Subadditivity under Semigroup because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Hierarchy paths (8) — routes to 7 parentless roots
- Subadditivity → Function (Mapping)
- Subadditivity → Semigroup → Closure
- Subadditivity → Order → Relation
- Subadditivity → Order → Set and Membership
- Subadditivity → Semigroup → Set and Membership
- Subadditivity → Semigroup → Associativity → Invariance
- Subadditivity → Order → Comparison → Self Checking
- Subadditivity → Semigroup → Associativity → Symmetry