Factual recall is linear superposition with a proven dimension bound
measured in 1 paperRavfogel et al. model subject embeddings as a sum of per-attribute vectors read by a relation-conditioned ReLU-gated MLP, proving (Theorem 4.1) a 1-layer transformer plus 3-layer MLP solves single-hop recall for N entities and R relations when d=4R*log(N)+1 [ravfogel-etal-2026-geometric-factual-recall-transformers] Synthetic experiments confirm the scaling: trainable embeddings memorize once d>=128 while frozen embeddings need d>=512 for R=16 [ravfogel-etal-2026-geometric-factual-recall-transformers] On five real LMs a rank-512 affine probe recovers the LM-head output embedding (best-layer MRR 0.44-0.69 across entity categories), reversing Hernandez et al. reported output-side non-linearity [ravfogel-etal-2026-geometric-factual-recall-transformers] Minimum-norm subject-embedding perturbations swap the queried attribute with high selectivity, and a frozen relation-selector MLP transfers zero-shot to unseen relation bijections [ravfogel-etal-2026-geometric-factual-recall-transformers]