Thinking In Structure

Tag: mathematics

  • Quaternions Feel Natural. 3-D Rotation Isn’t.

    Quaternions Feel Natural. 3-D Rotation Isn’t.

    This essay is part of a three-part series on mathematical structures that survive the collapse of their original worldviews. Part I — Schrödinger Part II — Hamilton (this essay) Part III — Maxwell

    There’s a familiar demonstration in graphics or robotics: draw a sphere, mark two orientations, trace a smooth arc between them, then multiply two four-component objects and watch the rotation fall neatly into place.

    And it does fall neatly into place.

    But whenever mathematics feels too natural, it usually means we’re working inside a framework that makes it natural. The elegance is real — but the inevitability is inherited.

    This essay is the companion to my earlier article on Schrödinger’s equation. Not because quaternions and quantum waves share physics, but because they share a deeper structure: both look inevitable once you commit to a worldview that makes them inevitable.

    1. Rotation in 3-D feels simple only because we treat it as if it should be

    Physically spinning an object feels trivial. Mathematically, orientation lives on a curved manifold with awkward properties:

    • rotation axes don’t commute
    • no single coordinate chart covers everything
    • interpolation is genuinely hard
    • singularities appear in any naïve parameterization

    Yet engineering implicitly adopts a much cleaner ideal:

    A rotation should update smoothly, interpolate cleanly, and compose predictably.

    That assumption quietly commits us to smooth group structure, global behavior, and stable composition.

    It’s the same pattern seen in quantum mechanics: assume linear evolution, and Schrödinger’s equation suddenly looks like it was waiting for you.

    But the assumption came first.

    2. Introduce quaternions. And suddenly the geometry cooperates

    Hamilton’s quaternion algebra,

    i² = j² = k² = ijk = −1

    drops astonishingly well into the geometry of orientation. Unit quaternions live on the 3-sphere S³. Their multiplication composes rotations smoothly. Their logarithms generate infinitesimal rotations.

    The fit is elegant — suspiciously elegant.

    But it fits because we are already inside a conceptual architecture where:

    • we treat rotations as a Lie group
    • we want a global, nonsingular representation
    • we want geodesic interpolation
    • we want predictable numerical behavior

    Inside that worldview, quaternions look inevitable. Outside it, they’re simply one option among many.

    3. The double cover isn’t a physical requirement — it’s a geometric one

    The space of physical orientations is SO(3): a curved manifold with a nontrivial topology. Mathematically, it cannot be represented globally without singularities.

    Its smooth double cover — S³ equipped with quaternion multiplication — can.

    Classical mechanics does not require this double cover; a 360° rotation is identical to doing nothing for virtually all classical purposes. But if you want:

    • global smoothness,
    • singularity-free parameterization,
    • well-behaved interpolation,
    • stable composition,

    then working on S³ is not a metaphysical choice. It’s the mathematically natural one.

    Not because physics demands it, but because your representational commitments do.

    4. Hamilton discovered the right algebra — but not the meaning it would ultimately carry

    This is the structural parallel with Schrödinger.

    Schrödinger wrote the right equation for the wrong physical picture. Hamilton wrote the right algebra for the wrong geometric picture.

    Hamilton believed quaternions were the geometry of physical space — a direct extension of complex numbers. That wasn’t correct. But it wasn’t meaningless either. He had found something real, just not the thing he thought he’d found.

    And because he worked in pure mathematics — with no experimental pushback — nothing forced the interpretation to converge.

    Meaning arrived instead from entirely different domains.

    5. Gibbs, Cartan, aerospace, graphics: each world imposed new constraints

    Different backgrounds reshaped quaternions in different ways:

    Gibbs & Heaviside

    Extracted the vector calculus classical physics actually needed. They didn’t overthrow quaternions; they decomposed Hamilton’s system into usable, orthogonal parts.

    Cartan

    Reinterpreted rotation through moving frames and differential geometry. In this view, the quaternion group law is just the smooth double cover of SO(3). No mysticism — just structure.

    Aerospace (1960s onward)

    Needed singularity-free attitude control. Euler angles failed. Axis-angle became awkward. S³ remained stable.

    Computer graphics, robotics, VR

    Needed stable composition, clean interpolation, minimal parameters, and predictable error accumulation.

    Floating-point behavior mattered — but so did the topology, the group structure, and the geometry.

    Engineering didn’t invent quaternion meaning. Engineering selected it.

    6. The alternatives exist — and they fail under the same constraints

    This is the crux of “conditional inevitability”:

    • Euler angles: intuitive, catastrophic singularities (gimbal lock at ±90° pitch).
    • Rotation matrices: expressive but redundant (9 floats for 3 degrees of freedom).
    • Axis–angle: compact, awkward to compose or interpolate.
    • Rodrigues parameters: elegant, but blow up at 180°.

    And here’s the concrete anchor:

    A quaternion stores 4 floats; a rotation matrix stores 9, with 6 redundant nonlinear constraints that must be re-enforced after every update. A single rounding error pushes a matrix off the rotation manifold, while a quaternion’s only condition — unit length — is restored with one cheap normalization.

    Under the constraints of:

    • global smoothness
    • stable composition
    • cheap inversion
    • predictable numerical drift

    the design space collapses.

    Mathematics allows many representations. Engineering eliminates most of them.

    Quaternions don’t win by metaphysics. They win by elimination.

    The Geometry of Inevitability

    Left uses Euler angles (local coordinates). Right uses a quaternion view (global double cover). Set Pitch near ±90°: the Euler side will visibly lose a degree of freedom (Yaw and Roll collapse).

    Euler
    ⚠️ GIMBAL LOCK: YAW & ROLL COLLAPSE
    Mapping: R = Rx(p)·Ry(y)·Rz(r)
    Quat
    ✓ SMOOTH S³ MANIFOLD
    q = [1.00, 0.00, 0.00, 0.00]
    When gimbal lock triggers, the Euler cube will ignore Roll and fold it into Yaw (so two sliders drive one effective axis).

    7. The inevitability is retrospective — exactly like Schrödinger’s

    Once you assume:

    • S³ for smoothness
    • group structure for composition
    • great-circle interpolation
    • normalization for drift control

    then quaternions look like the only reasonable representation of rotation.

    But the inevitability is conditional:

    • geometry constrains the space of possibilities
    • engineering selects within that space
    • history later retells the survivor as obvious

    This is the same pattern seen in quantum mechanics:

    The equation is simple. The worldview that makes it simple is not.

    Hamilton found an algebra. A century of constraints gave it meaning.

    Conclusion: Quaternions are clean. Rotation is not.

    Quaternions behave beautifully. They feel like the natural language of 3-D orientation.

    But that sense of naturalness is produced by two forces:

    • mathematical constraint — the actual topology of SO(3)
    • engineering selection — the demands of computation, control, and stability

    Quaternions survive because they satisfy both.

    Not by destiny. Not by arbitrariness. By constraint.

    They feel inevitable only because the worldview behind them isn’t.

    And in that gap — where messy geometry meets tidy algebra — their meaning finally settled.

  • THE ANALYTIC STRUCTURE OF CONSTANTS

    THE ANALYTIC STRUCTURE OF CONSTANTS

    How singularities and symmetry determine the speed of numerical approximation

    Some mathematical constants are easy to approximate. Others converge painfully slowly. A few remain stubborn even after centuries of work. This variation is not random. It reflects the analytic structure of the functions that define the constants.

    The central idea of this article is simple:

    The ability of a function to continue analytically beyond the real line determines how fast any basic approximation method can converge. The location of singularities and the presence of global symmetries influence the decay of coefficients in Taylor, Fourier, or related expansions, and that decay controls the speed of computation.

    This gives us a clear way to understand why certain constants are intrinsically slow and why others allow rapid algorithms once the right structure is identified.

    1. Local and Global Analytic Structure

    Constants inherit their computational difficulty from the analytic behaviour of the functions behind them.

    Local structure

    Some functions have singularities very close to the real axis. For example:

    • arctan has singularities at ±i

    • 1/x has a pole at 0

    • algebraic functions have branch points near their roots

    Such functions have a limited radius of convergence for their power series. Their coefficients decay only at a polynomial rate, and this restricts how fast any elementary approximation can converge. By “elementary,” we mean methods that use:

    • Taylor expansions

    • Euler–Maclaurin corrections

    • Riemann sums and trapezoidal rules

    • simple algebraic transformations

    • Machin-type arctan decompositions

    These methods rely solely on real-line information and do not use any global structures such as periodicity or modular symmetry.

    A brief historical aside

    The contrast between “local” and “global” structure is not just a theoretical classification. When modular-form formulas for π were discovered and refined, the speed was so extraordinary that the Chudnovsky brothers built a home-made supercomputer in their New York apartment in the 1990s specifically to exploit them. The machine, assembled from spare parts and cooled with improvised plumbing, set world records for digits of π. It remains one of the clearest demonstrations of how global analytic structure can translate directly into raw computational power.

    Global structure

    Other functions behave nicely over large regions of the complex plane. Examples include:

    • sin(πx), which is entire and periodic

    • modular forms, which are analytic on the upper half-plane and satisfy transformation laws

    • elliptic functions, which are doubly periodic

    Their Fourier or spectral coefficients decay exponentially or faster, and this creates the possibility of very rapid convergence. Algorithms that use these structures are not elementary in the sense defined above. They rely on analytic continuation and global symmetry.

    2. Why Analytic Structure Determines Convergence

    The mechanism behind the phenomenon is classical. If a function is analytic inside a disk of radius R, then its Taylor coefficients are bounded by M divided by R to the power n. This means:

    • a nearby singularity (small R) leads to slow coefficient decay

    • entire behaviour (large R) gives exponential decay

    • modular or elliptic symmetries can create even faster decay

    Since all basic approximation schemes ultimately depend on expansions of this sort, the rate of coefficient decay sets a hard limit on the speed of convergence.

    This is a precise mathematical fact, not a heuristic.

    3. Constants Limited by Local Singularities

    These constants can only be reached slowly with elementary methods.

    π through arctan

    The singularities of arctan at ±i are at distance 1 from the real axis. Its Taylor coefficients behave like 1/n, which gives convergence of order 1/n for the usual Gregory series. This proves that real-line Taylor methods for π must be slow.

    Machin-type formulas help only because arctan(1/q) moves the singularities farther away, but the convergence is still polynomial.

    e and the logarithm

    The standard definitions through integrals or ODEs involve local behaviour. Any Riemann-sum or Euler–Maclaurin approach remains slow for the same analytic reason.

    γ (Euler–Mascheroni)

    The constant γ is the limit of Hₙ minus ln n. The defining function 1/x has a singularity at 0, so any elementary method that uses derivative information of 1/x, including Euler–Maclaurin, can only achieve polynomial convergence. There is no known elementary method that gives exponential decay of coefficients.

    4. Constants that Become Fast Once Their Global Structure Is Recognized

    ζ(2)

    The naive series 1 + 1/2² + 1/3² + … converges slowly. This is exactly what the coefficient-decay principle predicts.

    The situation changes completely once ζ(2) is linked to the sine function. The infinite product for sin(πx) is entire and periodic, so its associated coefficients decay exponentially. Fourier expansions and spectral methods then provide rapid convergence and lead directly to the closed form π²/6.

    This is the clearest example of how identifying the right global structure can transform a slow constant into a fast one.

    The Analytic Speed Limit

    Bars show digits gained per iteration. Local singularities (red) cap progress; global symmetries (green) accelerate it.
    Current Iteration
    0
    Step Size
    100
    Local (polynomial)
    Global (exponential)
    Click Run 100 repeatedly to see divergence.

    5. Constants With No Known Usable Global Structure

    ζ(3)

    The constant ζ(3) is analytically well-defined, and many series exist for it, but none of the known representations produce exponentially decaying coefficients using elementary constructions. At present there is no known periodic expansion, no simple entire product, and no modular-form identity that generates a rapidly convergent expression. Some series converge reasonably well, but never in a truly exponential way without heavy analytic work.

    Catalan and elliptic constants

    These constants are connected to functions with branch cuts and deep symmetries that are difficult to exploit. No simple representation with rapid coefficient decay is known.

    6. The Mechanistic Pattern

    The behaviour of constants now follows a very simple pattern:

    Local singularities produce polynomial convergence. Examples include π via arctan, e, the logarithm, γ, and the naive series for ζ(2) and ζ(3).

    Global periodicity or entire behaviour produces exponential convergence once the structure is used. Examples include ζ(2) through the sine product, and fast π algorithms based on modular forms.

    Deep analytic structure without accessible symmetry produces no known fast elementary convergence. Examples include ζ(3), Catalan’s constant, and elliptic integrals.

    The pattern is not historical. It is a direct consequence of standard complex analysis.

    7. Why Modular Forms Create Fast Algorithms for π

    Modular forms satisfy transformation laws that relate values at different points in the upper half-plane. By moving to regions where q = exp(2πiτ) is extremely small, one obtains series whose coefficients fall away at a superexponential rate. This behaviour is the reason the Chudnovsky and Ramanujan series converge so quickly. They harness global symmetry that elementary methods cannot access.

    This explains why polygon-based approximations are slow and why modular methods are exceptionally fast. The analytic behaviour is fundamentally different.

    Chudnovsky π Calculator

    Ready.
    
    
    
    




    




    8. Counterexamples and Edge Cases
    




    BBP formulas for π
    




    Although the BBP series looks elementary, its derivation relies on analytic continuation of polylogarithms and special algebraic identities. It does not fall under the elementary methods described here.
    




    Euler–Maclaurin for γ
    




    The method improves constants but not the overall rate. It remains polynomial.
    




    Continued fractions
    




    Some continued fractions converge quickly for algebraic constants, but analytic limitations prevent them from giving exponential speed for transcendental constants like π or γ without global structure.
    




    Nothing here contradicts the mechanism.
    




    




    9. Why These Ideas Matter
    




    The analytic structure of a constant provides a practical guide to its computational difficulty. It tells us:
    




    • no simple fast algorithm for γ exists unless new global structure is found • ζ(3) will not yield rapid convergence without discovering symmetry now unknown • every fast algorithm for π must rely on entire or modular behaviour
    




    These are clear predictions grounded in complex analysis.
    




    The principle is concise. The decay of coefficients controls convergence. The analytic continuation of a function controls the decay of its coefficients.
    




    Local structure gives slow convergence. Global structure gives fast convergence. Deep structure remains inaccessible without heavy machinery.
    




    This is why some constants are easy and others are not, and why the discovery of global analytic structure has such dramatic computational consequences.
    




    https://thinkinginstructure.substack.com/p/the-analytic-structure-of-constants
    




    

    
			
    
		
    
		
	
  • 
		
		
    
			
			
    The Hidden Geometry of Clumping
    
			
    

    Why galaxies, web networks, optimization landscapes — and perhaps even chess — form clusters, and what those clusters reveal about the structure of the underlying system
    




    




    Clumping looks universal.
    




    Galaxies condense out of nearly uniform early-universe matter.
    PageRank concentrates probability on a handful of influential webpages.
    Combinatorial optimization problems produce dense pockets of near-solutions.
    Even chess positions seem to fall into plateaus and pits where evaluation changes slowly or chaotically.
    




    The similarity is tempting — but misleading.
    




    Across physics, networks, complexity theory, and even games, clumping is not a mechanism.
    It is a diagnostic: the visible footprint of something deeper.
    




    The geometry of the low-eigenvalue modes of the operator governing a system determines where its clumps form, and what those clumps mean.
    




    Some systems have a handful of smooth, dominant modes (gravity).
    Some have intermediate spectral bottlenecks (graphs).
    Some have dense, ungapped spectra (NP-hard optimization).
    




    Each produces clumps — but for radically different reasons.
    




    Understanding that spectrum tells us how predictable a system is, how compressible it is, how learnable it is — and how hard.
    




    




    1. Why low modes are the unifying principle
    




    Every system considered here has three ingredients:
    




    A state space
    Density fields, directed graphs, bitstrings, chess positions.
    




    A functional
    Gravitational potential; random-walk operator; Hamiltonian or cost function; value function of a game.
    




    A flow rule
    Physical dynamics; Markov chain convergence; local search; neural evaluation.
    




    Clumping occurs where this flow slows, accumulates, or fails to escape.
    




    Across all these systems, such regions are controlled by small eigenvalues:
    




      

    • directions where the functional changes least,
      • 




    • nearly invariant subspaces under dynamics,
      • 




    • flat or marginal directions of the Hessian,
      • 




    • low-conductance sets in a graph,
      • 




    • rugged basins formed by many near-degenerate minima.
      • 

    




    That is why low modes unify gravity, PageRank, spin glasses, and evaluation landscapes:
    they determine the shape, scale, and meaning of clumps.
    




    




    2. Gravity: clumps from smooth, low-dimensional instabilities
    




    (Jeans 1902; Binney & Tremaine)
    




    Gravity is the canonical structured landscape.
    




    A small density fluctuation δk(t)\delta_k(t) in a fluid of density ρ\rho and sound speed csc_s​ satisfies the linear Jeans equation:δk(t)∝exp⁡ ⁣(4πGρ−cs2k2 t).\delta_k(t) \propto \exp\!\left(\sqrt{4\pi G\rho – c_s^2 k^2}\, t\right).
    




    For long wavelengths kk such that 4πGρ>cs2k24\pi G\rho > c_s^2 k^2, the frequency becomes imaginary and perturbations grow exponentially in time, signaling gravitational instability.
    




    Worked example
    




    Let G=ρ=1G = \rho = 1 and cs=0c_s = 0. Thenδk(t)=e4π t≈e3.54t.\delta_k(t) = e^{\sqrt{4\pi}\, t} \approx e^{3.54 t}.
    




    A 0.1% perturbation grows tenfold in under one Hubble time. Large-scale overdensities collapse into galaxies.
    




    Interpretation
    




    Gravity has very few dominant modes.
    Structure formation is governed by long-wavelength instabilities.
    The clumps are smooth, coherent, and predictable.
    The system is highly compressible.
    




    




    3. Web networks: clumps from spectral bottlenecks
    




    (Brin & Page 1998; Chung 1997; Cheeger 1970)
    




    PageRank computes the stationary distribution vvv of the Google matrix:v=αu+(1−α)Pv.v = \alpha u + (1 – \alpha) P v .
    




    PageRank does not use the graph Laplacian explicitly — but slow-mixing regions of the random walk correspond to:
    




      

    • nearly invariant subspaces of PPP,
      • 




    • which correspond to low-conductance sets,
      • 




    • which correspond to small Laplacian eigenvalues (via Cheeger’s inequality).
      • 

    




    Thus clumping remains spectral, tied to bottlenecks in the graph.
    




    Worked example
    




    Construct two triangles connected by a single edge.
    Random walks mix rapidly within each triangle but leak slowly between them.
    The Laplacian’s second eigenvalue λ2\lambda_2 is small.
    PageRank assigns disproportionate mass to whichever cluster has stronger internal connectivity.
    




    Interpretation
    




    Clumps reveal topology, not physics.
    There are more modes than in gravity, fewer than in NP-hard landscapes.
    Compressibility is intermediate.
    




    




    4. NP-hard optimization: clumps from rugged structure
    




    (Sherrington & Kirkpatrick 1975; Mézard, Parisi & Virasoro 1987)
    




    Take subset-sum:f(S)=∣∑i∈Sai−T∣.f(S) = \left| \sum_{i \in S} a_i – T \right|.
    




    Plot this objective over the hypercube {0,1}n\{0,1\}^n.
    You obtain a landscape analogous to a spin glass:
    




      

    • exponentially many local minima,
      • 




    • barriers growing with dimension,
      • 




    • flat directions interspersed with sharp cliffs,
      • 




    • a dense spectrum of near-zero eigenvalues.
      • 

    




    Worked example
    




    Let n=12n = 12 and ai∈[1,1000]a_i \in [1,1000] be random integers.
    Evaluating all 212=40962^{12} = 4096 configurations reveals:
    




      

    • many distinct local minima,
      • 




    • no dominant basin,
      • 




    • no coarse structure persisting across scales.
      • 

    




    Interpretation
    




    Clumping arises from too many competing minima.
    The system is maximally incompressible.
    Low modes are dense and uninformative.
    This is the opposite of gravity.
    




    




    5. The compressibility spectrum
    




    These systems lie along a single axis determined by their low-eigenvalue structure:
    




    SystemOperatorLow-mode structureBasin geometryCompressibility
    GravityPoisson / JeansFew, smoothLarge coherent wellsHigh
    Web graphsRandom walkModerate, topologicalCommunity clustersMedium
    NP-hardDiscrete HamiltonianDense, ungappedFragmented minimaLow
    




    Principle
    




      

    • Few low modes → structured clumps (predictable)
      • 




    • Several low modes → spectral clumps (clusterable)
      • 




    • Many low modes → rugged clumps (hard)
      • 

    




    




    6. Edge cases and transitions
    




    Protein folding
    Smooth funnels mixed with glassy regions — a hybrid spectrum.
    




    Hierarchical networks
    Successive spectral gaps → layered clumps.
    




    Turbulence
    Energy cascades generate multi-scale spectral structure.
    




    Phase transitions
    In spin glasses and constraint-satisfaction problems, the low-mode spectrum densifies abruptly.
    




    




    7. Why this matters: prediction, learning, hardness
    




    Predictability
    Gravity is predictable at large scales; NP-hard landscapes are not.
    




    Learnability
    Neural networks readily learn spectral structure; they struggle with rugged landscapes.
    




    Computational hardness
    Smooth → polynomial approximations possible.
    Spectral → clustering helps.
    Rugged → exponential barriers dominate.
    




    Clump structure indicates what kinds of inference are fundamentally possible.
    




    




    8. Chess: a system on the boundary
    




    Chess appears to occupy a hybrid regime.
    




    AlphaZero
    Rapid spectral decay in value networks (Silver et al., 2018).
    




    Leela Zero
    Strong compression in CNN representations.
    




    Stockfish NNUE
    Thousands of parameters suffice, indicating inherent compressibility.
    




    Measurement is feasible
    Sampling ∼106\sim 10^6∼106 positions and extracting leading eigenvalues via randomized SVD is practical.
    




    Hypothesis (testable)
    




    Chess lies mid-spectrum: globally compressible, locally rugged in tactical regions.
    




    A sharp spectral gap implies structural solvability.
    A dense near-zero spectrum implies inherent NP-like complexity.
    




    Either result is meaningful.
    




    




    9. Bottom line
    




    Clumping is ubiquitous — but not universal in cause.
    




      

    • Gravity: smooth physical instabilities
      • 




    • Networks: spectral bottlenecks
      • 




    • NP-hard systems: competing minima
      • 

    




    Across all cases:
    




    Clumps reflect the geometry of the low-eigenvalue spectrum — the determinant of predictability, learnability, and complexity.
    




    Clumping is not the phenomenon.
    It is the footprint of the geometry underneath.
    




    

    Formal timestamp:
    The Chess Eigenspectrum Hypothesis was published at Zenodo:
    https://doi.org/10.5281/zenodo.17845086
    

    




    https://thinkinginstructure.substack.com/p/the-hidden-geometry-of-clumping