Definition
The circle , parametrised by an angle identified modulo . Embedded in a -dimensional space as along a chosen orthonormal pair of directions, with the remaining coordinates free to carry unrelated information.
Intuition
A clock face: one variable (time of day) wrapping around one loop, so that moving far enough in one direction returns you to where you started. Distance along the loop, not straight-line distance through the interior, is what should track semantic proximity for a cyclic concept.
Properties
- Compact, dimension 1. is a closed curve; it has no boundary and no endpoints.
- First homology . There is exactly one independent non-contractible loop, generated by winding once around. This is the invariant that distinguishes a circle from a torus (, two independent loops) and from an open arc or line (, no non-contractible loop).
- Intrinsically flat. As a 1-manifold, has no intrinsic curvature (curvature is a 2nd-order notion requiring ); the “curving” is only visible extrinsically, from the embedding in or higher.
- Geodesic distance vs. chord distance. For two points at angles , the intrinsic (geodesic, on-circle) distance is , while the Euclidean chord distance is . These agree only for small angular separation; they diverge maximally at .
- Isometry group . Rotations and one reflection generate all length-preserving self-maps of .
- Degenerate case of the general product. is the case of the -torus ; .
Key evidence
Sadek & Bakarji (2026, PMLR 303) train an autoencoder purely on
reconstruction loss over J.S. Bach’s Well-Tempered Clavier (no
harmonic labels) and find its pieces’ first-two-PCA-component latent
coordinates cluster by key into the classical circle-of-fifths
ordering: relative major-minor key pairs sit over 3x closer than
non-relative pairs, and circle-of-fifths distance correlates strongly
with learned latent distance — a specific, independently-known
circular ordering recovered unsupervised, not a generic cluster shape.
See
autoencoder-latent-space-recovers-circle-of-fifths-geometry-of-bach-preludes-and-fugues.
Carvalho & Bernardes (2023) systematically compare six input encodings
for an LSTM-VAE trained on 371 Bach chorales, quantifying circle-of-
fifths alignment via a circular Kendall’s Tau plus Davis-Bouldin/Dunn
cluster-separation statistics: a discrete-Fourier-transform-of-pitch
(“Pitch DFT”) encoding produces by far the best-aligned latent space
(Tau .44±.32) despite reconstructing the original music far worse than
a symbolic ABC encoding (Tau only .11±.09 despite 82.6% reconstruction
accuracy) — direct evidence that circle-of-fifths emergence depends
strongly on encoding choice and dissociates from pure reconstruction
fidelity. See
pitch-dft-vae-encoding-best-aligns-latent-space-with-circle-of-fifths-and-tonal-hierarchy.
Grasse & Tata (2026) test the emergence of “chroma equivalence” -
octave-periodic circular pitch geometry, distinct from linear pitch
height - in trained speech/audio networks, via RSA against hand-
specified pitch-height and chroma-equivalence model RDMs. All self-
supervised pretrained models (Wav2Vec 2.0, Data2Vec, others) show
significant pitch height but no chroma equivalence, and mere exposure
to music during self-supervised fine-tuning does not change this;
supervised fine-tuning on a music-transcription task (but not on speech
recognition) induces significant chroma equivalence in both Wav2Vec 2.0
and Data2Vec - a training-condition dissociation rather than an
architecture-driven one. See
supervised-music-transcription-fine-tuning-but-not-mere-music-exposure-induces-significant-chroma-equivalence-circular-pitch-geometry-in-wav2vec2-and-data2vec.
A 2026 study (arXiv:2607.29086; author byline not resolvable at time of writing) extends the chroma-equivalence question to real generative music foundation models (Jukebox and MERT, with consistent results also reported for MusicGen), extracting layer-wise representations of isolated notes across a wide range of instrument timbres and fitting the combined linear-pitch-height-plus-circular-chroma (helical) geometry via PCA. The helix’s clarity and rotations-per-octave depend systematically on instrument timbre (e.g. Hammond organ yields a clean one-rotation-per-octave helix, electric clean guitar yields two rotations per octave), with the effect traced to specific harmonics — the same combined shape Generalized Helix formalizes, here for musical pitch rather than a numeric quantity, and a timbre-dependence axis not covered by Grasse & Tata’s music-transcription-vs-speech dissociation above. See do-music-foundation-models-embed-pitch-in-helical-structure-2026-real-jukebox-mert-and-musicgen-embed-pitch-as-a-timbre-dependent-helix-with-rotations-per-octave-varying-by-instrument.
Singh & Chopra (2026) find, with no training or probing at all (purely
intrinsic geometric comparison via RSA
and GPA against independent human
psychophysical data), that color-description prompts fed to four
open-weight LLMs (LLaMA-3-8B, LLaMA-3.2-3B, Gemma-7B, Qwen3-4B) produce
middle-layer activation geometries resembling “the human perceptual
color wheel” — with alignment weak in early layers, peaking in
intermediate layers, and attenuating again in later layers across all
four models, a transient (rather than monotonically strengthening or
persistent) emergence pattern not previously documented on this page.
See
human-perceptual-domain-geometry-emerges-transiently-across-llm-layers.
Tang, Wang, García-Redondo & Monod (2026) confirm the circular
structure Nanda et al. (2023) found via Fourier analysis in
modular-addition transformers using an entirely independent
measurement — persistent homology (Vietoris-Rips filtration,
H0/H1 persistence statistics) computed directly on point clouds of
token-embedding and hidden-state activations, with no spectral
decomposition involved. H1 (loop) persistence rises sharply and
reproducibly exactly at the grokking phase transition (e.g. H1 max
persistence 0.075-0.08 to 0.20-0.25 for a 2-layer transformer, mod
197), replicated across three primes (113, 149, 197) and two
architectures (transformer, MLP), correlated with test accuracy
(Spearman up to 0.81) though not causally validated, and absent
in a non-grokking MNIST control task. See
tang-etal-2026-persistent-homology-h1-cycle-strength-rises-sharply-at-the-grokking-transition-and-correlates-with-generalization-across-primes-and-architectures.
Sivasankar (2026) quantifies the same underlying circular/Fourier structure from a different angle: a “Frequency Synchronization Degree” (FSD) metric measures how synchronized the Fourier components are across a modular-addition transformer’s embedding, MLP, and unembedding layers, and shows FSD reaches ceiling 500-3,000 steps before grokking (mean lead +1,722 steps) across five primes and three seeds. Causally forking training at the FSD ceiling and increasing weight decay produces monotonically earlier grokking, tying the circular Fourier structure’s synchronization timing directly to a training-level causal lever. See fsd-fourier-circuit-synchronization-metric-reaches-ceiling-before-grokking-and-forking-training-with-higher-weight-decay-causally-produces-earlier-grokking.
Swaroop (2026) examines the weight geometry underlying the same circular structure at the level of individual ReLU-MLP neurons rather than the embedding point cloud: input weights become near-binary square waves and output weights carry Fourier phases satisfying , extracted per-neuron via DFT. An idealized model built purely from these extracted components reaches 95.5% accuracy even when derived from an undertrained network scoring only 0.23% itself, direct causal evidence that this Fourier/circular weight structure is what generalization is built from, present before the model itself generalizes. See relu-mlps-trained-on-modular-arithmetic-develop-near-binary-square-wave-input-weights-and-fourier-phase-matched-output-weights-that-alone-reconstruct-95-5-percent-accuracy-even-from-an-undertrained-model.
Limberg, Zhang, Schulz & Weinzierl (2025) train a VAE with an explicit
unit-circle regularizer (an L2-norm hinge penalty) plus a metric-
learning “neighbor loss” to disentangle instrument timbre from pitch
in a 2D latent space, conditioning a downstream Transformer generator
on the result (pGESAM, built on EnCodec audio latents). They quantify
disentanglement directly via a component-wise variance ratio: the
variance of an instrument’s latent-mean vectors across different
pitches () is six orders of magnitude smaller than the
variance across different instruments within one pitch class
(, train set: 1.13e-7/1.00e-7 vs. 0.179/0.179) — tight
per-instrument point clusters scattered around the boundary of the
unit circle, with approaching the 0.25 value expected
for points spread uniformly across a disc of radius 1. A four-way
ablation (removing KL loss, the norm-regularization loss, the neighbor
loss, or the family classifier in turn) shows each geometric outcome
traces to a specific loss term: dropping the neighbor loss collapses
by roughly two orders of magnitude (points crowd near
the origin instead of spreading across the disc), while dropping the
family classifier degrades instrument-level disentanglement
( rises above baseline) without visibly changing the
disc-filling behavior — a training-time (not inference-time) causal
attribution of which loss term produces which piece of the geometry.
See
limberg-etal-2025-a-vae-unit-circle-regularizer-plus-neighbor-loss-produces-a-2d-latent-space-with-pitch-timbre-disentanglement-quantified-six-orders-of-magnitude-by-a-component-wise-variance-ratio.
Zhou, Zhang & Duan (2023/24) recover Russell’s circumplex-model
arousal-valence (AV) plane from a self-supervised speech model’s
emotion-classification features, in a non-LLM, non-vision (speech)
setting complementing valence-arousal-circumplex-subspace. A
WavLM-Large backbone, fine-tuned only for categorical emotion
classification (never given continuous AV labels), is projected via an
“anchored” UMAP-style nonlinear dimensionality reduction — ten emotion
categories are pinned near AV coordinates taken directly from
psychology literature (Russell & Mehrabian, 1977), then a weighted
kNN-graph optimization refines each utterance’s position around its
categorical anchor using the high-dimensional emotion features’
structure. The resulting 2D embedding reaches Concordance Correlation
Coefficient (CCC) up to 0.674 (valence) / 0.679 (arousal) against
human AV annotations on IEMOCAP — comparable to fully-supervised
regression baselines trained directly on those annotations — despite
using no ground-truth AV labels during training, and generalizes
(qualitatively, via cluster-to-anchor distance) to two further, out-
of-domain corpora (EmoDB, MEAD). An ablation removing the psychological
anchors collapses performance to near-zero CCC, showing the anchors
(not just the kNN-graph optimization) are what aligns the recovered
embedding with the AV plane specifically, as opposed to some other
consistent-but-uninterpretable 2D layout. See
zhou-etal-2023-a-self-supervised-speech-emotion-classifiers-features-are-recoverable-via-anchored-nonlinear-projection-into-a-psychologically-defined-2d-arousal-valence-plane-matching-supervised-regression-ccc-without-av-labels.
Nishi, Ramesh, Okawa, Khona, Tanaka & Lubana (2024) confirm pretrained
transformers naturally encode cyclic conceptual structure (e.g. months,
days of the week) as a genuine cyclic manifold via Isomap projection —
shown in Llama-3.1-405B-Instruct, GPT-2-Small, and Mistral-7B — and then
causally probe it: applying knowledge-editing algorithms (ROME, MEMIT) to
a synthetic transformer trained from scratch on a structured knowledge
graph measurably “shatters” this discovered geometry via a normalized
Frobenius-norm pairwise-distance-matrix distortion metric
(Representation-shattering distortion metric), distorting the
relative positions of entities never directly targeted by the edit, in
proportion to the edit’s counterfactual distance from the targeted fact —
degrading factual recall and reasoning, and replicated in real pretrained
Llama 3 8B Instruct and Mamba. See
knowledge-editing-interventions-measurably-shatter-a-pretrained-transformers-natural-cyclic-manifold-geometry-scaling-with-counterfactual-edit-distance.
Joseph, Garrido, Balestriero, Kowal, Fel, Bakhtiari, Richards & Rabbat
(2026) find motion-direction information in frozen, pretrained V-JEPA 2
and VideoMAE-v2 video encoders is carried by a population of direction-
selective MLP units whose tuning curves tile the full angular range
with a smooth, sine/cosine-like profile at an intermediate-depth
“Physics Emergence Zone” — a genuinely circular population code
(evidenced by a “sawtooth” probe-accuracy pattern under successive
feature orthogonalization, consistent with paired sine/cosine encodings;
R²=0.97 for direction decoding). Local-attention suppression targeted
at the emergence zone causally degrades both direction-decoding R²
(0.97→0.14) and intuitive-physics accuracy (78.3%→61.7%) while leaving
ImageNet classification nearly unchanged (33.7%→33.1%) — a clean double
dissociation. Direct steering of the direction variable required
jointly manipulating dozens of orthogonal probe dimensions, consistent
with a population code rather than a single direction. See
joseph-etal-2026-motion-direction-is-encoded-as-a-circular-population-code-in-a-physics-emergence-zone-of-real-video-world-models-while-scalar-physical-quantities-remain-linearly-decodable.
-
A representation-theoretic (Fourier/irrep) algorithm for finite-group composition, confirmed by reverse-engineering real trained weights and by ablation, generalizing the modular-addition clock beyond a single group. Chughtai, Chan & Nanda (2023) show real trained small MLPs/transformers solving arbitrary finite-group composition tasks consistently implement a family of Fourier/irrep-based algorithms — confirmed both by reverse-engineering trained weights/logits and by ablation experiments — though which specific circuit within that family a given network lands in varies across differently-initialized/trained networks (“mixed evidence for universality”). Generalizes the single-group modular-addition clock structure (Nanda et al. 2023; Zhong et al. 2023, above) to arbitrary finite groups. See
chughtai-etal-2023-real-trained-networks-solving-finite-group-composition-tasks-consistently-implement-a-representation-theoretic-fourier-algorithm-confirmed-by-ablation. -
A universal approximate Chinese Remainder Theorem algorithm, with individual neurons measured to activate exclusively on specific coset structures. McCracken, Moisescu-Pareja, Letourneau, Precup & Love (2025) extend the modular-addition Fourier/group-universality cluster with a coset-structure-based measurement approach, confirming across neurons, neuron clusters, and whole trained networks that individual neurons activate exclusively on measured coset structures, and confirming the theory’s predicted O(log n) feature-count scaling. See
mccracken-etal-2025-real-trained-networks-solving-modular-addition-implement-a-universal-approximate-chinese-remainder-theorem-algorithm-with-neurons-activating-exclusively-on-measured-coset-structures. -
A semi-ring algebraic construction, confirmed by direct factorization of real trained weights and by exact hidden-node counting per Fourier frequency. Tian (2024/2025, NeurIPS 2025) proves a semi-ring/ring-homomorphism algebraic structure for 2-layer quadratic-activation networks solving modular addition, then measures it directly in real gradient-descent-trained networks (widths 20/512/1024, modular addition mod ): around 95% of trained solutions factorize against the theoretical construction with small error (~0.04 relative to solution norm), and direct counting confirms exactly 6 hidden nodes exist per Fourier frequency , matching the prediction exactly. A further theory-heavy but real-weight-verified extension of the modular-addition Fourier/group-universality cluster above. See
tian-2024-real-gradient-descent-trained-quadratic-mlps-on-modular-addition-factorize-into-a-semi-ring-algebraic-structure-matching-a-theoretical-construction-with-exactly-6-hidden-nodes-per-fourier-frequency.
Levy & Geva (2025) find, outside the modular-arithmetic-training literature above, that ordinary pretrained Llama 3 8B and Mistral 7B represent each decimal digit of a multi-digit number as its own orthogonal circle (a per-digit, single-frequency base-10 code), independently discovered via digit-wise circular probes reaching 91-92% joint-digit accuracy versus under 20% for any other tested base. A causal mod-10 rotation applied to one digit’s circular-probe directions reliably edits that digit alone in the model’s generated output (up to 15% exact, 50% off-by-one), confirming the per-digit circle is used, not merely present. See llama-3-8b-mistral-7b-orthogonal-circular-per-digit-base-10-representations.
Carlsson & Brüel Gabrielsson (2018) and Brüel Gabrielsson & Carlsson
(2019) apply persistent homology to the point cloud of convolutional
filter weights of real trained CNNs (custom MNIST/CIFAR-10/SVHN
networks, plus pretrained VGG16/VGG19 on ImageNet) and find a
persistent circle recurring at nearly every depth across roughly 1,000
networks — the first non-transformer, weight-space (rather than
activation-space) circle finding on this page. A causal follow-up
fixes the first convolutional layer to an idealized discretized circle
and measures a real transfer-learning gain (MNIST→SVHN accuracy 11-12%
→ 28% versus random-Gaussian/normally-trained controls). Both papers
also report a weaker two-/three-circle configuration that they loosely
label a “Klein bottle,” inherited from Carlsson et al. (2008)‘s
natural-image-patch study — neither independently verifies
non-orientability on the CNN weights themselves, so that label is
noted here only as context, not as a separate structure claim. See
a-persistent-circle-recurs-in-the-convolutional-filter-weights-of-real-trained-cnns-across-depths-datasets-and-training-and-fixing-an-idealized-circle-as-the-first-layer-causally-improves-cross-dataset-generalization.
Exercises
Base
- Parametrise by . What is the geodesic (on-circle) distance between and , on a circle of radius ?
Solution
Raw angular difference is , but since we can also go the other way around the loop, the geodesic distance is .
- Compute informally: how many “independent” loops does the circle support, and why can’t there be a second, independent one?
Solution
Exactly one. Any closed loop traced on is homotopic to winding around the circle some integer number of times (its winding number), and this integer is the only invariant — so , generated by the single “wind once” loop. There is no second, independent generator because has only one direction to move in (dimension 1); a second independent cycle would require a second, orthogonal direction to loop around, which does not have.
Middle
- Show that geodesic distance and chord distance on the unit circle agree to first order for small angular separation , and find the leading-order discrepancy.
Solution
Geodesic distance is . Chord distance is . Taylor expanding: . So they agree to first order ( for small ), with leading discrepancy — chord distance under-estimates geodesic distance, increasingly so as .
- A candidate circular feature is embedded as with (an ellipse, not a circle) in the ambient coordinates. Is this still topologically ? Does it still have ? What breaks?
Solution
Yes to both: an ellipse is homeomorphic (in fact diffeomorphic) to a circle via a linear reparametrisation, so it is still topologically with — homology only sees the loop structure, not the embedding’s metric distortion. What breaks is the isometric structure: geodesic distance is no longer simply proportional to , since points near the ends of the major axis are metrically farther apart per unit than points near the minor axis. Confusing “topologically a circle” with “isometrically a round circle” is a common error when reading off cyclic structure from PCA projections, since PCA has no reason to produce equal axis scales.
Pro
- Suppose two candidate cyclic features are each confirmed to individually satisfy in their own 2D subspace, and the two subspaces are orthogonal complements of each other inside a shared 4D space. Does and on the two separate subspaces let you conclude on the joint 4D configuration? What additional fact is needed?
Solution
Not automatically. Two orthogonal subspaces each containing a copy of does not by itself tell you what the joint set of points occupied by the data looks like — homology is a property of the actual topological space traced out by the data, not of the ambient coordinate directions available to it. If the data in the joint 4D space genuinely is (up to homeomorphism) the product — i.e. every combination of angles that occurs on the first circle co-occurs, independently, with every angle on the second — then by the Künneth formula . But if, say, only a 1-dimensional diagonal subset of the product actually occurs (the two angles are not independent — e.g. locked to each other, ), the joint space is homeomorphic to a single , not , and , not . The additional fact needed is independence: the joint point set must actually realize the full product, not a lower-dimensional sub-locus of it. This is exactly the gap between “two circles exist in orthogonal subspaces” and “a torus exists” — see Torus.
- Let be a smooth embedding of a cyclic feature, and suppose a linear probe is trained to decode the angle from by regressing onto directly (not onto separately). Explain why this probe is fundamentally ill-posed, independent of how much data or capacity it has.
Solution
is a coordinate on , not on — it is only defined modulo , so and are the same point on the circle (arbitrarily close together) but arbitrarily far apart as real numbers. Any function continuous on must therefore agree at and , but a linear probe regressing onto raw is being asked to produce output close to and close to for inputs that are close together in — a discontinuity is unavoidable at the wraparound point no matter how the probe is fit. The fix is to regress onto (or equivalently treat the target as a point on , e.g. via a circular/von Mises loss), which are genuine continuous single-valued functions on .