Definition
The cone over a base space is the set of rays from a fixed apex through every point of , parametrised by a non-negative scalar :
Two special cases matter here:
- , a finite set of directions — a polyhedral convex cone, , a wedge/pyramid shape.
- , a circle — a classical circular (ice-cream) cone: angular coordinate times a shared radial magnitude , i.e. points for .
Intuition
A single ray from the origin is a 1D half-line. A polyhedral cone is what several rays sweep out when they must combine with the same sign (non-negative coefficients only — no cancellation allowed). A circular cone is an old-fashioned lampshade: the angle around the shade encodes one variable, and how far from the tip you are (the radius) encodes something else entirely, independent of angle.
Properties
- Non-negativity is the defining restriction. Unlike a linear subspace (any real coefficients, including negative — closed under ) or an affine subspace (offset, no origin-anchoring), a cone’s coefficients must be : the apex is a genuine corner, not a point you can pass smoothly through in every direction.
- Not a manifold at the apex. Every point of has a neighbourhood homeomorphic to locally, but the apex itself (where all rays meet) has no Euclidean neighbourhood when has more than one point — it is a genuine singular point.
- Polyhedral case: generators, causal independence is a separate question from linear independence. linearly independent directions span an -dimensional cone, but two directions being orthogonal only guarantees they don’t interfere under linear superposition — it does not guarantee that intervening on one leaves the other’s causal effect intact. Distinguishing ” orthogonal directions” from ” causally-independent generators” requires an intervention, not just a geometric check (e.g. ablate one candidate direction, verify the others still reproduce their effect).
- Circular case: collapsing recovers the circle. Projecting onto the unit circle () exactly recovers Circle — the cone is the circle’s angular structure with one extra, independent radial degree of freedom.
- Convexity. A polyhedral cone is always convex: if then (coefficients add and stay non-negative), and for .
Relative to concept-lattice
The polyhedral case above is given in V-representation (non-negative combinations of generator rays ). The exact same object class also has an H-representation — the intersection of finitely many origin-passing half-spaces, — which is how Concept lattice (Formal Concept Analysis half-space model) builds a “concept” out of several linear attribute directions simultaneously. What’s new there isn’t the single-cone shape itself, but the order-theoretic system of many such cones connected by a Galois connection into a complete lattice with meet/join operations.
Key evidence
Alper & Averbuch-Elor (2024) find off-the-shelf CLIP/OpenCLIP/ALIGN
embedding spaces exhibit an emergent Euclidean relaxation of this cone
structure: anchoring the apex at the model’s own embedding of the
empty string (“entailment root” ), radial distance
measures concept
genericity and an exterior-angle metric at tests entailment
direction between two concepts — order-consistency with true
hierarchical ordering reaches Kendall’s zero-shot on
their HierarCaps benchmark, and causal fine-tuning targeting this
exact geometry raises it to while leaving standard
task performance unchanged. See
vlm-embeddings-exhibit-emergent-radial-entailment-hierarchy-improvable-by-fine-tuning
via Radial Entailment Embedding.
Baek, Li & Tegmark (2024) find a second, structurally distinct instance
of this shape: a discrete-tree cone rather than a continuous-hierarchy
one. Fitting a coordinate-wise order-embedding score (the
cone probe) on top of a 10-dimensional
PCA-reduced residual-stream subspace, across five instruction-tuned LLMs
answering in-context genealogy questions (“is X a descendant of Y?”),
they find the fitted cone subspace is not merely correlationally present
but causally implicated: projected activation patching restricted to
this subspace produces an effect on the model’s answer (measured via
logit difference) comparable to or larger than patching a same-rank
top-PCA-component subspace, with an unrestricted full-layer patch
producing a still larger effect — evidence of real but incomplete
localization of the tree structure to the fitted cone subspace. See
baek-etal-2024-cone-probe-isolates-a-tree-like-subspace-for-genealogy-descendant-relations-causally-validated-by-projected-activation-patching.
Winninger (2026) extracts a fourth account of refusal’s cone-like
structure, cheaper than the constrained-optimization search used to fit
the polyhedral cone above: training a Recursive Feature Machine as a
target-vs-rest refusal classifier directly on Qwen3 (1.7B-14B) and
Qwen2.5-7B-Instruct residual-stream activations, then taking the ranked
top-k eigenvectors of the resulting Average Gradient Outer Product matrix
(RFM/AGOP Subspace Extraction (LLM activations)) as the subspace. Cumulative ablation
shows attack-success rate rises monotonically with the number of ablated
eigenvector dimensions, and the dimensionality needed to cross a 50%
attack-success threshold scales with model size — single-direction
ablation suffices for smaller models, but Qwen3-8B/14B need 3 or more
dimensions — with steering along the top eigenvector inducing refusal and
random-direction controls of matched rank confirming the effect is not
noise. See
rfm-agop-extracted-refusal-subspace-dimensionality-required-for-full-suppression-scales-with-model-size.
Exercises
Base
- Is the union of two opposite rays, for a fixed vector , a cone in the sense defined above, and is it the same set as the 1D linear subspace ?
Solution
Yes to both. As a set, — allowing both signs of the scalar recovers the full line. This is the cone over the 2-point base (or equivalently , the cone over the 0-sphere), and it happens to coincide with a linear subspace precisely because the base is symmetric under negation. A generic finite base (not closed under negation) gives a proper wedge, not a full subspace.
- Give a base for which is exactly a half-plane in .
Solution
Take to be a semicircle, e.g. . Then is exactly the closed upper half-plane .
Middle
- Prove that a polyhedral cone is convex.
Solution
Let and be in (so all ), and let . Then . Each coefficient since , so . Hence is convex.
- For the circular cone , what is this set, concretely, as a subset of ? Is the map a homeomorphism from onto its image?
Solution
The set is all of (every point has some polar representation). The map is continuous and surjective onto , but it is not a homeomorphism from : at , every value of maps to the same point (the origin), so the map is not injective there, and (a half-infinite cylinder) is not homeomorphic to near that collapsed circle. This is exactly the sense in which the apex is a genuine topological singularity — the cone construction pinches the boundary circle of the cylinder down to a single point.
Pro
- Suppose a behavior is mediated by a polyhedral cone with generators that are pairwise orthogonal. An experimenter ablates the component of activations along (projects it out) and finds the behavior is fully eliminated on every test example. Does this refute the 3-generator cone account in favor of a single-direction account? What must additionally be true of ‘s coefficients across the test examples for the two accounts to be distinguishable?
Solution
Not necessarily — full elimination after ablating is also consistent with a genuine 3-generator cone if, on that particular test set, the coefficients happen to be zero (or small enough that the behavior’s threshold isn’t met without ‘s contribution) for every example. The two accounts (single direction vs. 3-generator cone) are only distinguishable on examples where or is large enough to independently cross the behavior’s activation threshold — i.e. the experimenter needs a test set where each generator, in isolation (with the others ablated), still triggers the behavior on some examples. Only if ablating eliminates the behavior on every example, including ones specifically chosen to have large , does the data support a true single-direction account over the polyhedral cone.
- Consider collapsed by the map for . Show that restricted to is a well-defined continuous surjection onto , and explain in what sense this operation “recovers the circle” from the cone while discarding exactly one real degree of freedom.
Solution
For with , , which is well defined (division by is legal) and continuous as a composition of continuous operations. It is surjective since every is attained (e.g. by any ). The fibers are exactly the rays of the cone, each parametrised by the single remaining coordinate — so quotients out exactly the radial degree of freedom, leaving only the angular one, which is precisely . This is the formal version of “cosine-normalizing every point recovers the pure circle as a cross-section.”