What I learned today

Introduction — Who Was John von Neumann? 1.1 Polymath as transfer engine across domains 1.2 Extreme memory, speed and compression 1.3 From abstract mathematics to executable systems 1.4 Mathematics, physics, economics, computation, biology 1.5 The recurring move: redefine the object, then formalize it 1.6 Von Neumann as architect of representations rather than isolated results Made in Budapest 2.1 Budapest as an intellectual production environment 2.2 Family wealth, books, languages and cognitive bandwidth 2.3 Mental calculation and early abstraction 2.4 Rátz, Fejér, Szegő and accelerated mathematical cultivation 2.5 Problem-solving over rote procedure 2.6 Jewish insecurity and pressure toward exceptional achievement 2.7 The “Martians” as a network rather than isolated geniuses 2.8 Early evidence of cross-domain transfer To Infinity and Beyond 3.1 Crisis of mathematical foundations 3.2 Euclid → non-Euclidean geometry → abstraction of structure 3.3 Hilbert: strip objects of intuitive me...

  TSCT/GRM Base-t Resolution of Navier–Stokes via Laplacian Eigenfunctions Part I — Source / Carrier Separation 1. Problem Reframing 1.1 Fluid source ≠ Navier–Stokes carrier 1.2 PDE ≠ numerical representation 1.3 Remove “smooth/global” as primitives 1.4 Resolution = finite renewable certificate 2. PDE Structural Residue 2.1 Incompressibility 2.2 Momentum equation 2.3 Vorticity equation 2.4 ∂tω+(u·∇)ω=S(u)ω+νΔω 2.5 Transport / stretching / dissipation 2.6 Energy and enstrophy identities Part II — Laplacian Eigenfunction Carrier 3. Spectral Geometry 3.1 AΦ_k=μ_kΦ_k 3.2 Divergence-free basis 3.3 Boundary-compatible modes 3.4 u=Σa_kΦ_k 3.5 Vorticity basis 3.6 Orthogonality / Parseval 3.7 μ_k as scale ordering 4. Modal Dynamics 4.1 Structure coefficients C^k_ij 4.2 Quadratic modal interaction 4.3 Diagonal viscosity −νμ_ka_k 4.4 Forcing projection 4.5 Infinite coefficient system 4.6 Finite projection P_N 4.7 Tail Q_N 4.8 Modes generated beyond N Part III — 3D Turbulence Mechanism 5. Vort...

 GRM Base-t treatment of the Hodge conjecture   the GRM sequence TBLIND→ANS→FB∥RB→C★→U→CUT★→FNA★→carrier/grain/scale courts→Ρ★→repair DAG→liftback→replay , with target vocabulary stripped before the reverse build. TOC — TSCT/GRM Base-t Hodge Conjecture Solution 1. Problem State and Source Target 1.1 Smooth projective complex variety X 1.2 Codimension p 1.3 Rational Hodge class α ∈ H^(2p)(X,Q) ∩ H^(p,p)(X) 1.4 Cycle-class map cl: CH^p(X)_Q → H^(2p)(X,Q) 1.5 Required source ancestry Z with cl(Z)=α 1.6 SOURCE ≠ REPRESENTATION ≠ READOUT 1.7 Hodge type as recognizer, not constructor 1.8 Reject direct cl^(-1) and “choose Z” as primitives 2. Base-t Endpoint-First Back-Formation 2.1 Begin from Z | cl(Z)=α 2.2 Erase how Z was obtained 2.3 Back-form exact global reconstruction 2.4 Back-form liftback requirements 2.5 Back-form source generation requirements 2.6 Canonical reverse dependency: Z ← CLOSE ← TRANSPORT ← GENERATE 2.7 Identify the first dependency lacking an executable s...

  Turbulence as a Fracture of Navier–Stokes: Vorticity Stretching, Two Repair Channels, and 3D Failure Part I — The Apparent Closure of Navier–Stokes The compact PDE and the hidden dynamical system 1.1 Navier–Stokes as u_t + u·∇u = -∇p + νΔu 1.2 Incompressibility div u = 0 1.3 Local differential closure versus global regularity 1.4 Velocity as an infinite-dimensional state 1.5 Why smooth coefficients do not imply smooth evolution 1.6 The PDE as compressed representation 1.7 Turbulence as failure of representation-level smoothness The three competing operators 2.1 Nonlinear transport u·∇u 2.2 Pressure projection -∇p 2.3 Viscous diffusion νΔu 2.4 Transport creates geometry 2.5 Pressure enforces compatibility 2.6 Viscosity destroys fine scales 2.7 Why their balance is dynamically unstable Two supporting repair channels 3.1 Repair channel A: viscous diffusion 3.2 Repair channel B: incompressibility and pressure redistribution 3.3 Local damping versus nonlocal constraint repair 3.4 Why ...

  Why Smooth Flow Requires Complex Mathematics to Unravel Part I — The Compression Problem: A Short Equation, a Huge State Space The deceptive simplicity of a flow equation 1.1 Local differential rule versus global evolution 1.2 Why formula length says little about dynamical complexity 1.3 A velocity field as an infinite-dimensional state 1.4 Smoothness as a property of an entire orbit, not one instant 1.5 Initial data, forcing, geometry, and boundary conditions 1.6 Local solvability versus global continuation 1.7 Representation hides the evolving boundary of regularity From particles to fields 2.1 Lagrangian particle trajectories 2.2 Eulerian velocity fields 2.3 The flow map X(a,t) 2.4 Deformation gradient and volume distortion 2.5 Eulerian–Lagrangian conversion 2.6 Why the two descriptions expose different singular mechanisms 2.7 Particle smoothness versus field smoothness What “smooth flow” actually demands 3.1 Continuity 3.2 Differentiability 3.3 Higher derivatives 3.4 Sobolev ...

Convexity: An Analytic Viewpoint. Convex functions and sets — p. 1 1.1 Convex subsets of real vector spaces 1.2 Convex combinations and convex hulls 1.3 Convex and strictly convex functions 1.4 Epigraphs and geometric interpretation 1.5 One-dimensional convexity and secant slopes 1.6 Continuity and differentiability of convex functions 1.7 Supporting lines and tangent inequalities 1.8 Jensen’s inequality 1.9 Hölder and Minkowski inequalities from convexity 1.10 Gauges of convex sets 1.11 Legendre transforms 1.12 Hahn–Banach viewed through supporting tangents Simon explicitly identifies differentiability, Jensen, gauges, Legendre transforms, and the Hahn–Banach viewpoint as foundational themes   Orlicz spaces 2.1 Young functions 2.2 Convex growth functions beyond power laws 2.3 Modular functionals 2.4 Luxemburg-type norms 2.5 Orlicz classes and Orlicz spaces 2.6 Hölder-type inequalities in Orlicz spaces 2.7 Complementary Young functions 2.8 Duality phenomena 2.9 Comparison with...

  Distinguishability Transport and Reconstruction Theory — DTRT TOC Core spine: PAIR → CARRIER → TRANSFORMATION → DISTINCTION PROFILE → SURVIVAL LAW → LOSS PROFILE → RECOVERABILITY → ADEQUATE CARRIER . PART I — FOUNDATIONAL OBJECTS 1. Probability States 1.1 Probability measures as states 1.2 Sample spaces and measurable structure 1.3 Probability law versus density representation 1.4 Support and effective support 1.5 Joint and marginal states 1.6 Conditional states 1.7 Process-valued states 1.8 Model families as sets of probability states 1.9 State equivalence 1.10 State comparison 2. Ordered Probability Pairs 2.1 (P,Q) as the primitive comparison object 2.2 Directionality of comparison 2.3 Symmetric versus asymmetric comparison 2.4 Pair equivalence 2.5 Pair orbits under transformations 2.6 Pair invariants 2.7 Pairwise distinguishability 2.8 Family-relative distinguishability 2.9 Pairwise versus multi-state comparison 2.10 Comparison without scalarization 3. Carriers 3.1 Definition...