Span¶
Core Idea¶
Span is the complete set of states, objects, or capabilities reachable by combining a given primitive set under a stated admissible-operations grammar. The structural force is the reachable closure: not just what the primitives do directly, but every composition of them that the grammar permits.
How would you explain it like I'm…
The Whole Rainbow
Imagine you have a few colors of paint. By mixing them in different amounts you can make a huge rainbow of new colors. The span is the whole rainbow you can reach from your starting paints. Some colors you can mix, and some you just can't make from what you have.
Everything You Can Build
Span is everything you can build once you fix two things: a small set of starting pieces, and the rules for how you're allowed to combine them. With a few LEGO bricks and the rule 'snap them together however you like,' you can make a giant number of shapes. That whole collection of buildable shapes is the span. Change the starting pieces or change the rules, and the collection changes too. What's interesting is how a tiny starting set can reach a gigantic collection.
Reachable Closure
Span is the complete set of things you can reach from a chosen set of building blocks, using only an allowed set of combining moves. It has three parts that always travel together: the primitives (the starting pieces), the grammar (which operations are legal, like adding, stacking, or repeating), and the resulting closure (everything reachable). It is not just what the pieces do alone; it is every legal combination of them. The shape of that closure depends on all three at once — which pieces, which moves, and whether the result is finite or infinite, or fills the whole space or only part of it. The point of interest is usually the gap between the small starting set and the large reachable set.
Span is the structural pattern of the complete set of states, objects, or capabilities reachable by combining a fixed primitive set under a fixed grammar of admissible operations. It commits to a three-way split: a primitive set (basis vectors, generators, verbs, tools), an admissible-operations grammar (linear combination, finite composition, repeated application, a group operation), and the reachable closure that results. What distinguishes span from a loose synonym for 'capability' is closure under the grammar: the span is the entire set of legal compositions of the primitives, not just their direct effects. The closure's character — finite or infinite, dense or discrete, the whole ambient space or a proper subspace inside it — depends jointly on the primitives, the operations, and how they interact, and changing any one changes the closure. The pattern travels because in many domains a small generating set determines a much larger closure, and the gap between the generators and the closure is exactly what makes it interesting: five pitches with 'play in sequence' and 'play together' give thousands of phrases but no microtones; arithmetic primitives with compose/condition/loop give the computable functions; two hundred words with a concatenation grammar give millions of sentences. The force comes from the reachable-closure concept, not the substrate.
Broad Use¶
- Linear algebra: the span of vectors is all their linear combinations — a subspace whose dimension is the rank.
- Group theory: a group generated by a set is the closure of that set under the group operation.
- Computability: the recursive functions are the span of composition, primitive recursion, and minimization over a base set.
- Cognitive skill: a learner's competence is the reachable closure over acquired primitive skills.
- Tool sets: "what I can build" is the span of one's tools under admissible composition.
- Language: expressive reach is the set of meanings reachable by combining lexical primitives under a grammar.
- Metabolism: nutritional span is the metabolic states reachable from available nutrients; essential nutrients are precisely those not in the span.
- Policy: a regulator's achievable effects are the span of taxes, subsidies, mandates, and disclosure.
Clarity¶
It separates the primitives a system has from the capabilities it can compose, and exposes which primitives are redundant — already in the span of the others.
Manages Complexity¶
It reduces a large space of capabilities to its small set of generators plus the grammar, so questions about the whole space become questions about the parts.
Abstract Reasoning¶
It names the gap-to-target fork: a desired capability is in the span (needs construction), outside it (needs a new primitive), or beyond the grammar (needs a new operation) — three cases with different fixes.
Knowledge Transfer¶
- Machine learning: PCA's principal components span the data's effective subspace; compressed sensing relies on sparse representation in a chosen span.
- Cryptography: the generated-subgroup concept underlies Cayley-graph algorithms and Diffie–Hellman's discrete-log security.
- Language design: the primitive-recursive-versus-Turing-complete distinction shapes total-functional and domain-specific languages that deliberately restrict the span.
- Curriculum design: skill-primitive-plus-composition theories move into mastery learning and structured curricula.
Example¶
The span of \(\{(1,0,0),(0,1,0)\}\) under linear combination is the \(xy\)-plane — a proper subspace. The target \((0,0,1)\) is outside it: no composition reaches it, so reaching it requires adding a new primitive, not more combining.
Relationships to Other Primes¶
Parents (2) — more general patterns this builds on
- Span is a kind of, typical Closure — Span is the reachable CLOSURE of a primitive set under an admissible-operations grammar — a closure (operations stay within a set) enriched with generators + a grammar + a gap-to-target fork. closure is the structural genus.
- Span decompose Basis — The file: a basis is the conjunction of span + independence + minimality; span (covers the space) is one of the two constituent properties. span is a candidate (CAND-R2-076-08).
Path to root: Span → Basis → Set and Membership
Not to Be Confused With¶
- Span is not Periodization because span is the static reachable closure considered timelessly, whereas periodization concerns reachability unfolding through ordered stages where some elements become available only after others are built.
- Span is not Compositionality because compositionality is the principle that wholes derive from parts and combination, whereas span is the resulting reachable set — a closure with a definite boundary.
- Span is not a Basis because a basis is the minimal generating set, whereas span is the closure it generates; many different bases yield the same span.