Linear-Combination Membership Test¶
Decision procedure — instantiates Coherent Linear Space Design
Decides whether a target element is reachable as an admissible linear combination of a given set — and returns the coefficients when it is.
Once a space is declared and verified, the recurring operational question is "can I build this out of those?" The Linear-Combination Membership Test answers it. Given a target element and a set of generators, it decides whether the target can be written as an admissible linear combination of the generators — whether it lies in their reachable set — and, when the answer is yes, it returns the coefficients; when no, it returns the obstruction. Its defining subtlety is the word admissible: the reachable set depends entirely on which coefficients the problem allows. Any real coefficients give the full span (a subspace); nonnegative coefficients give a cone; coefficients that are nonnegative and sum to one give a convex hull; integers give a lattice. The test is the mechanism that makes that admissibility rule explicit and then computes membership against it, rather than assuming the span is always the whole story.
Example¶
A lab keeps five stock solutions on the shelf and needs a target buffer with specified concentrations of several ions. The chemist frames it as a membership question: is the target concentration vector reachable from the five stock vectors? The admissibility rule is not "any real coefficients" — you cannot add a negative volume of a stock — so the legal coefficients are nonnegative, which means the reachable set is the convex cone generated by the stocks, not their full linear span. Solving the system finds that matching the target exactly would require a negative amount of one stock. Verdict: not reachable by mixing these five alone; the obstruction points squarely at the ion that is over-supplied by every stock. The lab now knows it needs a sixth reagent rather than a cleverer recipe. Had the chemist tested membership in the full span (allowing negative coefficients), the target would have looked reachable — and the recipe would have been physically impossible.[n1]
How it works¶
- Assemble the generator matrix from the candidate building blocks and the target vector.
- State the admissibility rule — the coefficient domain the problem actually permits (any real, nonnegative, convex, integer). This choice defines the reachable set before any solving.
- Solve for coefficients within that domain (Gaussian elimination or least-squares for the full span; constrained solving for cones and hulls).
- Report reachability plus evidence — the coefficients when the target is inside, or the residual/obstruction (which direction cannot be matched) when it is outside.
The test presupposes a valid space; it does not re-derive one. It asks a reachability question inside an already-governed carrier.
Tuning parameters¶
- Admissibility rule — the highest-leverage dial by far: any-real (span), nonnegative (cone), convex (hull), or integer (lattice). Loosening it enlarges the reachable set and can turn a physically impossible answer into a spuriously possible one.
- Exactness — exact membership versus approximate ("is the target within ε of the reachable set?"). Approximate membership returns a nearest reachable point and a residual.
- Solver — exact elimination for a definite yes/no versus least-squares projection when the target may only be approximately reachable.
- Generator curation — which building blocks are admitted as generators; adding one can flip a target from unreachable to reachable.
When it helps, and when it misleads¶
Its strength is answering, concretely and with receipts, "can we construct this from what we have, and if so how" — returning an actual recipe or a specific reason it is impossible.
Its failure mode is forgetting the coefficient constraint. Testing membership in the full span when the problem only allows nonnegative or convex combinations makes unreachable targets look reachable, and the returned "recipe" is nonsense. The classic misuse is in color: declaring a target color reproducible because it lies in the linear span of the primaries, while ignoring that physical mixing requires nonnegative weights, so the truly reproducible set is the convex hull — the gamut — which is strictly smaller. The guarding discipline is to state the admissibility rule before solving and to test membership against that set, not against the mathematically convenient full span.
How it implements the components¶
The test fills the archetype's combination face — it operationalizes which combinations are legal and whether a target is among them:
linear_combination_admissibility_rule— its heart: it names the legal coefficient domain and computes membership against exactly that reachable set.closure_axiom_checklist— it relies on the reachable set being closed under the admitted combinations, and checks that the produced combination lands back inside the carrier.scalar_domain_specification— it reads which scalars are permitted as coefficients, the parameter that distinguishes span from cone from lattice.
It does not declare the carrier or operations (the Vector-Space Specification Sheet), verify the full axiom set (the Linear-Axiom Verification Checklist), fix a basis or coordinates (the Basis & Coordinate Table), interpret coordinate semantics across frames (the Change-of-Basis Review), or map nonlinear exceptions (the Nonlinear-Boundary Stress Test).
Related¶
- Instantiates: Coherent Linear Space Design — the test answers the reachability questions the governed space is meant to support.
- Consumes: Vector-Space Specification Sheet — membership is only well-posed once the carrier, scalars, and operations are declared.
- Sibling mechanisms: Vector-Space Specification Sheet · Linear-Axiom Verification Checklist · Basis & Coordinate Table · Change-of-Basis Review · Zero-Span Linearity Check · Linear Embedding Diagnostics · Nonlinear-Boundary Stress Test
Editorial Notes¶
Form Classification¶
Form family: Analysis, Modeling & Optimization
Rationale: The method solves whether a target lies in an admissible span and computes coefficients when it does.
Nearest alternative: Decision, Gate & Allocation — It returns member or nonmember, but that result is a linear-algebraic computation rather than an authority disposition.
Review outcome: Adjudicated after independent review; high confidence.
Origin Attribution¶
Primary origin: Mathematics
Origin pattern: Single lineage
Present-day reach: Specialized
Rationale: Testing span membership and returning coefficients is a canonical linear-algebra problem.
Review outcome: Independent reviewer agreement; high confidence.
Notes¶
[n1] The Rouché–Capelli theorem gives the exact condition for a linear system Ax = b to have a solution: the coefficient matrix and the augmented matrix must have equal rank. It is the standard test for membership in the span; the nonnegativity or convexity constraints that arise in physical mixing shrink the reachable set below the span and require a constrained solver. ↩