Skip to content

Conical combination

A finite nonnegative linear combination of vectors; the collection of all such combinations is their conical hull, the minimal convex cone generated from the origin.

Version
v1 · 2026-09-28 · History
Domain-specific #
8648
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Convex Geometry, Linear Algebra → Mathematics

Core Idea

Conical combination retains addition and positive scaling while forbidding signed cancellation. Each result is assembled from declared generators with coefficients at least zero. The empty or all-zero combination places the origin in the generated hull.

The construction sits between a union of rays and a linear span. Addition fills mixtures between rays, but absence of negative weights preserves directionality. Normalizing a nonzero coefficient vector shows the close relationship to convex combinations without collapsing the distinction.

How would you explain it like I'm…

Stretch and Add, No Backwards

You have a few arrows. You can make each arrow longer or shorter, but you can never flip it to point backwards, and you can put arrows end to end. Everywhere you can reach this way, plus staying right at the start by using no arrows, is made by a conical combination.

Adding Arrows With No Minus Signs

Imagine a few arrows all starting at the same spot. A conical combination means you stretch or shrink each arrow by some amount that is zero or more, then add them together tip to tail. You are not allowed to use negative amounts, so you can never flip an arrow around to cancel out another one. Using zero of everything keeps you at the starting point. All the spots you can reach form a region that fans out between the arrows.

Nonnegative Linear Combination

A conical combination of vectors v_1, ..., v_k is a sum a_1 v_1 + ... + a_k v_k where every coefficient a_i is at least zero. It keeps addition and positive scaling but forbids negative coefficients, so signed cancellation is impossible. The set of all conical combinations of some generators is their conical hull, which always contains the origin, since all coefficients can be zero. It sits between two neighbors: a union of rays, which lets you scale each vector but not add them, and a linear span, which allows negative coefficients and so fills whole lines and planes. It is also close to a convex combination, whose coefficients are nonnegative and add to one; dividing a nonzero set of conical coefficients by their sum gives such a combination, but the two ideas are not the same.

 

A Conical combination of generators v₁, …, v_k is a vector of the form Σ λ_i v_i with every λ_i ≥ 0. It preserves addition and nonnegative scaling but forbids signed cancellation, which is what distinguishes it from a general linear combination. Taking all coefficients zero (or the empty combination) gives the origin, so the conical hull of any set of generators contains the origin. Structurally, the conical hull lies between the union of the rays generated by each vector and the linear span: addition fills in the mixtures between rays, while the absence of negative weights preserves directionality. Convex combinations are the special case where the coefficients also sum to one, and any nonzero conical coefficient vector can be normalized to that form, which shows the close relationship without erasing the difference, since the conical hull is closed under positive scaling while the convex hull is not.

Structural Signature

Sig role-phrases:

  • Generator set — Supplies vectors whose nonnegative rays may be combined. It is carrier. Counterfactual: If arbitrary external directions are admitted, the result is not the hull of the stated set.
  • Nonnegative coefficients — Restrict movement to forward rays rather than arbitrary signed span. It is constraint. Counterfactual: Allowing negative coefficients yields a linear span instead.
  • Finite summation — Builds each member from finitely many selected generators. It is construction. Counterfactual: An unqualified infinite series requires additional topological assumptions.
  • Positive scaling closure — Makes the generated set a cone with apex at the origin. It is invariant. Counterfactual: A coefficient-sum-one requirement would produce only the convex hull.
  • Addition closure — Combines generated directions while preserving nonnegativity. It is invariant. Counterfactual: A union of rays need not be closed under addition.
  • Minimality — Excludes points not forced by convex-cone closure of the generators. It is boundary. Counterfactual: A larger ambient cone contains the hull but is not identical to it.

What It Is Not

  • It is not an arbitrary linear combination.
  • It is not a convex combination unless the weights also sum to one.
  • It is not merely the union of rays through each generator.
  • It is not automatically a topologically closed cone.
  • Closest near-miss. A convex combination fixes the coefficient sum at one and remains within the convex hull; a conical combination permits any nonnegative total and therefore scales the convex combination radially from the origin.

Scope of Application

  • Convex optimization. Represents feasible directions and dual certificates.
  • Polyhedral geometry. Generates finitely described cones and studies their extreme rays.
  • Economics. Models nonnegative production combinations or activity levels.
  • Signal and data models. Expresses additive mixtures with nonnegative amplitudes.
  • Theorem alternatives. States membership in a generated cone versus separation by a linear functional.

Clarity

State the ambient vector space, scalar field, generator set, coefficient sign constraint, and whether finite, closed, or pointed cones are intended. For membership, exhibit nonnegative coefficients; for exclusion, use separation or an invariant incompatible with the generated cone.

Manages Complexity

The abstraction compresses infinitely many feasible mixtures into a finite or described generator set plus a nonnegativity rule. It separates directional generation from normalized interpolation and signed span, allowing the correct geometry and algorithms to be selected.

Abstract Reasoning

  1. Fix the ambient vector space and source generators.
  2. Introduce one nonnegative coefficient per selected generator.
  3. Form their finite weighted sum.
  4. Collect all possible sums to obtain the conical hull.
  5. Test closure under addition and nonnegative scaling and verify minimality.
  6. Distinguish algebraic hull from its topological closure when limits matter.

Knowledge Transfer

The transferable cargo is closure under addition and nonnegative scaling from chosen generators. It transfers to resources, rays, and additive mixtures with meaningful directionality; it stops when negative cancellation or unit-normalized interpolation is constitutive.

Examples

Canonical

For vectors e₁ and e₂ in the plane, all αe₁+βe₂ with α,β≥0 form the closed first quadrant.

Mapped back: generators → coordinate vectors; coefficients → nonnegative; hull → first quadrant.

Applied / In Practice

The vector 6x+3y equals 9[(⅔)x+(⅓)y], displaying a nonzero conical sum as positive scale times a convex combination.

Mapped back: scale → 9; convex weights → ⅔, ⅓.

Applied / In Practice

The vector x−y belongs to the linear span of x and y but need not lie in their conical hull because one coefficient is negative.

Mapped back: signed coefficient → -1; conical → not guaranteed.

Structural Tensions

T1 — Expressive Generation versus Directional Restriction. Nonnegative weights generate many mixtures while forbidding cancellation through reversed generators.

Diagnostic: Does the generator set itself contain opposite directions?

T2 — Finite Algebraic Closure versus Topological Closure. A conical hull need not include every limit point in infinite-dimensional or nonclosed settings.

Diagnostic: Is closure part of the intended object?

T3 — Generator Redundancy versus Minimal Representation. Different generator sets and coefficient vectors can produce the same cone or point.

Diagnostic: Does the application require membership only or a sparse decomposition?

Structural–Framed Character

Conical Combination is hybrid: structurally nonnegative linear generation and framed by the ambient vector-space and closure conventions.

Structural Core vs. Domain Accent

The core is a weighted sum constrained to the nonnegative orthant. Convex geometry supplies cones, hull minimality, extreme rays, normalization to convex combinations, separation, polyhedral representation, and closure distinctions.

  • Approved root. Convex Hull is neighboring rather than ancestral because its unit-sum constraint changes the generated object; the frozen root is retained.

  • Related — convex combination, convex hull, linear span, positive cone, extreme ray, and Farkas lemma. These provide normalized, signed, geometric, and dual constructions.

Neighborhood in Abstraction Space

Conical combination sits in a moderately populated region (47th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Polynomial Rings & Rational Approximants (15 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Convex Combination. Tell: Both use nonnegative weights, but a convex combination requires their sum to equal one.
  • Linear Span. Tell: A span permits negative coefficients and therefore cancellation and opposite directions.
  • Convex Cone. Tell: A convex cone is any set closed under conical combinations; the conical hull is the smallest one generated by a given set.
  • Positive Linear Dependence. Tell: Dependence concerns a nontrivial conical relation summing to zero rather than any generated point.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Conical_combination (revision 1337399234).
  • Preserved source candidate: https://books.google.com/books?id=Gdl4Jc3RVjcC&pg=PA101&dq=%22conical+combination%22&sig=ACfU3U1PhwoewUhc6T8MpfreQHpB35d7jQ#PPA101,M1
  • Preserved source candidate: https://books.google.com/books?id=ofrBsl61lq8C&pg=PA67&dq=%22unbounded+convex+polyhedron%22&sig=ACfU3U1Yv3iG-XIn3hiuh84nK2e8UIcdAA#PPA68,M1
  • Preserved source candidate: https://web.stanford.edu/~boyd/cvxbook/

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.