Supported · uqcf
uqcf_codazzi_proof
Tmp/TOE/uqcf_codazzi_proof
High-precision Codazzi verification on the three-binary-node exponential family. Includes August 2026 scientific status report.
Strongest claim
Unbiased point: zero Codazzi defect. Weak coupling: full-rank susceptibility Ξ(J)=J²[[0,1],[-1,0]]+O(J³). Closed-form A(J), B(J) Grok-verified 1 Aug 2026.
Boundary
Finite three-node exponential family / exact enumeration. Not all graphs, not continuous systems, not gravity.
Wiki
- Supported four
- Claim ledger
- UQCF-GEM
- Dorau–Much projection path
- Proofs, simulations, and figures
- Working packages
- UQCF-GEM reader
X sources
Original posts this article was compiled from. The notebook copy is editorial; the status URL is the source.
-
2026-08-01
Codazzi harness handed to Grok
-
2026-08-01
Grok: Codazzi harness verified
-
2026-08-01
Grok independently re-ran the Codazzi harness
-
2026-08-01
Grok: clean result is finite-model separation
-
2026-08-01
Grok: closed-form susceptibility matches
-
2026-08-01
Codazzi genericity theorem complete
-
2026-08-19
Dorau–Much relative entropy as a later projection
-
2026-08-01
Potential and response geometries can separate