Published July 8, 2025 | Version v1

A Synthetic Informational Proof of Goldbach's Conjecture

Description

This paper presents a novel, information-theoretic reformulation of Goldbach’s Conjecture within a synthetic universe modeled as a causal graph. By defining a canonical bijection between natural numbers and graph structures, and introducing algebraic operations that mirror addition and multiplication, the work establishes a rigorous isomorphism between arithmetic and informational graph algebra. Primality is reinterpreted as graph irreducibility, leading to a synthetic version of Goldbach’s Conjecture. While the conjecture remains unproven, this framework offers strong structural, logical, and physical motivation grounded in entropy-driven graph dynamics.

Files

A_Synthetic_Informational_Proof_of_Goldbachs_Conjecture.pdf

Files (124.4 kB)

Name Size
md5:5ff6067cf2b1fd5775b5add91c98c906
124.4 kB Preview Download