Downloads · 30 days
0
callensxavier/leanflow-mechanized-t-duality-k3t2
leanflow-mechanized-t-duality-k3t2 is a feature extraction model from callensxavier. Use it when you need embeddings to search or compare text. The card lists the license as apache-2.0.
Author: Xavier Callens Affiliation: SocrateAI Lab | SymbioticFactory Research GitHub Repository: xaviercallens/SocrateAI-Scientific-DualScaleSimulator & xaviercallens/SocrateAI-Numeric-DualScale-Solver
Downloads · 30 days
0
Access
Public
Updated Sep 10, 2026
Repo size
4.5 MB
Likes
0
Public
Click a slice to open those files.
.pdf2.2 MB · 48%
From the Hugging Face model README
Author: Xavier Callens
Affiliation: SocrateAI Lab | SymbioticFactory Research
GitHub Repository: xaviercallens/SocrateAI-Scientific-DualScaleSimulator & xaviercallens/SocrateAI-Numeric-DualScale-Solver
Publication Status: Preprint / Formal Computational Manuscript (34 Pages, Version 7)
We present LeanFlow, a neuro-symbolic computational architecture that bridges high-performance stiff numerical differential equation solvers with interactive theorem proving (Lean 4) and Topological Data Analysis (TDA) to simulate and formally certify frontier non-linear string cosmology.
String compactifications on non-trivial geometries such as $K3 \times T^2$ feature stiff multi-scale dynamics, non-perturbative duality symmetries ($O(D,D; \mathbb{Z})$), and discrete topological invariants that challenge conventional floating-point simulations. LeanFlow addresses these challenges through five foundational pillars:
| File | Description | Size |
|---|---|---|
T_duality_Alone.pdf | Complete 34-Page Manuscript (PDF) with full mathematical derivations, listings, and figures | 2.2 MB |
T_duality_Alone.tex | Complete LaTeX manuscript source and bibliography entries | 103 KB |
lean4_formal_proofs.tar.gz | 14 Sorry-Free Lean 4 Formal Proofs (Mukai lattice, Kummer resolution, Buscher rules, CDL c-theorem, etc.) | 24 KB |
rust_stiff_dualscale_simulator.tar.gz | Rust Stiff Dual-Scale Simulator Crate (Cargo.toml, src/) with native AOT duality assertions | 11 KB |
tda_mapper_skeleton.json | TDA Mapper 1-skeleton graph: 187 nodes, 557 edges, Betti numbers ($\beta_1 = 376$) | 81 KB |
kummer_langevin_summary.json | Kummer orbifold Langevin simulation telemetry ($48 \times 48$, $25,344$ transitions) | 310 B |
vacuum_decay_cdl_summary.json | Coleman–De Luccia vacuum decay bounce action telemetry ($S_E \approx 137.15$, $R_c \approx 2.82,\ell_s$) | 390 B |
tachyon_condensation_summary.json | Boundary tachyon condensation profile telemetry ($w \approx 1.54\sqrt{\alpha'}$) | 288 B |
zenodo_deposit_bundle.zip | Unified Zenodo deposit distribution package | 2.1 MB |
graph TD
A[BDF Stiff PDE Solver<br/>Rust SIMD Engine] -->|12-18 ns AOT In-Loop Gate| B[Buscher & Metric Unimodularity Lock]
A -->|Point Cloud Data<br/>N = 25,344| C[TDA Mapper Algorithm<br/>Spatial Filter ||grad phi||^2]
C -->|Simplicial 1-Skeleton<br/>187 nodes, 557 edges| D[Betti Extraction<br/>beta_0=6, beta_1=376, chi=6]
D -->|45 ms Outer IPC Gate| E[Lean 4 Kernel Certification<br/>KummerTDAAnomalyCertification.lean]
E -->|Certified Sorry-Free| F[Formal Proof Ledger<br/>Mukai.lean, KummerResolution.lean]
theorem fourier_mukai_preserves_pairing (v w : MukaiVector) : mukai_pairing (spherical_reflection v) (spherical_reflection w) = mukai_pairing v wtheorem kummer_euler_characteristic : e(X) = 24 via 16 exceptional $\mathbb{P}^1$ divisors.theorem discrete_euler_poincare_consistency : chi(K) = V - E + beta_1@article{Callens2026MechanizedTDuality,
author = {Callens, Xavier},
title = {Mechanized T-Duality and Frontier String Dynamics on K3 × T²: Closing the Loop via LeanFlow Stiff Solvers with Native Duality, Topological Data Analysis, and Lean 4 Certification},
journal = {Preprint / SocrateAI Scientific Research},
year = {2026},
url = {https://huggingface.co/callensxavier/leanflow-mechanized-t-duality-k3t2}
}
All software code is licensed under the Apache-2.0 License. Scientific research, documentation, and manuscript artifacts are licensed under the Creative Commons Attribution 4.0 International (CC-BY-4.0).