Definition
Where Linear Direction and Linear Subspace each describe a single feature site, a relation frame is the hidden-state configuration of the token positions that jointly instantiate a -argument relation (e.g. the three role-tokens of a ternary relation). Rigorously it is an ordered configuration , from which we read three independently-manipulable, well-defined pieces: the centroid ; the centered shape ; and the spanned subspace , a point of the Grassmannian with . The orthogonally-invariant summary of the shape is the Gram matrix (invariant under any orthogonal change of the ambient basis).
Caveats on the “orientation sign” (corrected). A tempting scalar handedness label built from left singular vectors of the projected tuple is not a data invariant as usually stated:
- SVD singular vectors are defined only up to a per-column sign; flipping flips the determinant. With repeated singular values the corresponding singular subspace can be orthogonally rotated, making the sign still less determined. So a bare requires an explicit, fixed sign/orientation convention to mean anything.
- Any determinant sign is meaningful only after fixing an orientation of the ambient space; an orthogonal change of coordinates with determinant flips it.
- The centered configuration has rows summing to zero, so : there is generically no honest “-th” direction for the centered shape — the natural cap is .
If oriented information is genuinely needed, use the exterior product / Plücker coordinates after fixing orientation conventions, rather than a single unqualified sign.
Relative to linear-subspace and linear-direction
A Linear Direction or Linear Subspace is a single fixed geometric object shared across many activations (the same “truth direction” for every true/false statement). A relation frame is instead a per-instance, multi-token configuration — a different ordered tuple of vectors for every relation instance in every prompt — and the object of interest is how that tuple’s own internal shape and orientation vary with whether the tokens are genuinely relation-bound (versus scrambled or random). It generalizes the single-site view to an explicitly higher-arity one: a -argument relation should show its clearest signature at Plücker rank , not at rank 1.
Key evidence
Kobrosly (2026) uses Plücker sign entropy — the entropy of orientation signs over many sampled tuples — to test this on synthetic controlled-arity prompts ( arguments) across Llama-3.1 8B/70B/405B-Instruct: true relation tuples have consistently lower sign entropy (i.e. more orientation-consistent) at the arity-matched rank than scrambled or random-tuple controls, with positive diagonal margins in every headline row and in a held-out layer-selection audit, most uniform in the 405B model. In a separate edge-grid clean/corrupt steering assay (8×8 grid, YES/NO relation markers), patching the shape of a corrupt relation frame toward the clean frame’s shape — while leaving the centroid fixed — recovers clean-answer behavior and clean residual relation geometry in Llama-3.1-70B/405B-Instruct nearly as well as patching the whole frame, whereas moving only the centroid, or adding equal-norm noise, recovers almost nothing. See Plücker sign entropy and Relation-frame shape steering for the two techniques.
How to detect it
Fix a relation of known arity , sample matched true/scrambled/random token tuples, project into a shared low-rank analysis subspace, and compare orientation-sign entropy across candidate ranks : enrichment specifically at (not at other tested ranks) indicates the relation is represented as an -way oriented configuration rather than reducible to independent single-token directions.
Key papers
- Kobrosly (2026). Relational Rank Geometry in Transformers: Detecting and Steering Hidden-State Relation Frames. arXiv:2605.29634 — origin of Plücker sign entropy and relation-frame steering; independent-researcher preprint, single-paper evidence so far.