Log-Harmonic Field Theory (LHFT) - Conditional Recovery Mathematics and Source-Level Proof Obligations
Log-Harmonic Field Theory (LHFT): a source-traceable research framework and its proof graph This release presents a bounded working paper on Log-Harmonic Field Theory (LHFT), developed by Christian Baganz, together with a machine-readable LHFT Proof Graph and an accompanying JSON Schema. The central purpose of the combined release is to make a developing theoretical framework assessable in familiar scientific terms: explicit definitions, assumptions, propositions, conditional recovery statements, counterexamples, source provenance, and unresolved proof obligations. The release should be read as a research program with documented mathematical results and open physical derivations, not as a completed or experimentally established unification of fundamental physics. 1. Physics and scope LHFT proposes a relational description using four organizational concepts: structure (intrinsic relations and scale organization), state (a physical or structural configuration), coupling (dynamical interaction), and projection/readout (the operation by which certain coupled structural relations become measurable). Observable general-relativistic, electromagnetic, and quantum descriptions are investigated as possible effective recovery regimes rather than assumed to be the fundamental ontological layer. A logarithmic radial coordinate, u = ln(r/r₀), is used where appropriate; it is a coordinate choice and does not, by itself, establish discrete scale invariance or physical equivalence to a new spacetime geometry. The accompanying paper develops conditional mathematical comparisons involving Schur complements and effective visible-sector operators, gyroscopic energy evolution and modal residues, weak-coupling spectral models, weighted variational problems, and statistical identifiability in the presence of nuisance parameters. These methods belong substantially to established mathematics and mathematical physics. Their relevance to LHFT depends on whether the corresponding coefficients, backgrounds, constraints, and readout maps can be obtained from the complete frozen structural action S₁L. That source-level implication remains an explicit research question. 2. What is the LHFT Proof Graph? For physicists, the closest analogy is a versioned theorem-dependency and provenance register, augmented by a knowledge graph of physical assumptions, competing interpretations, calculations, counterexamples, and unresolved conditions. It is not merely a collection of manuscripts, a flowchart illustrating the theory, or a numerical ranking of evidence. It records which assertion is being made, the premises under which it is valid, where its derivation originated, what other assertions it requires, and what would still need to be demonstrated before the assertion could be used in a stronger physical conclusion. In version v10.275, the canonical JSON contains 7,712 nodes, 25,381 directed edges, and 26,977 recorded formula entries, spanning historical and current research material. These counts describe the size of a provenance and argumentation system; they are not counts of independent verified theorems, experimentally confirmed predictions, or microscopic derivations. The graph also contains historical branches and critical cross-references; it is not required to be a directed acyclic proof graph. Nodes represent definitions, lemmas, propositions, theorems, recovery claims, counterexamples, open defects, and other research records. Typical fields include a permanent id, source_branch, object_type, status, a statement, assumptions, a proof sketch, formula records, and references to supporting sources. Edges encode typed relations such as SUPPORTS, REFINES, PROOF_DEPENDENCY, REQUIRES, and BLOCKS. A connection is not automatically a logical implication: its relation type and the premises of its target claim must be examined. Logic groups organize combinations of premises or requirements, including conjunctions needed for a conditional conclusion. They represent a structured audit trail, not an automatic theorem prover. Source catalogue and aliases retain the identity and provenance of imported work, preserving distinctions between historical precursors, standard-physics comparator results, LHFT interpretations, and speculative candidates. Transactions record successive changes against earlier versions. The governance policy favors traceable additions and explicit corrections over silently replacing earlier claims. The status vocabulary matters as much as the graph structure. Definition identifies a stipulated object; Derived refers to a mathematical result under stated premises; Recovery identifies an effective comparison with established physics; Normal-form closed indicates closure within a specified reduced model, not microscopic closure; Candidate denotes a proposed interpretation; and Open marks an unresolved proof obligation. Historical status labels also occur. A reader must inspect assumptions, provenance, and limiting qualifications rather than interpreting a status word or node count in isolation. 3. What does the JSON Schema do? The file LHFT_Proof_Graph_v10.275.schema.json is a companion JSON Schema Draft 2020-12 document. It supplies an explicit, machine-readable structural contract for the canonical graph LHFT_Proof_Graph_v10.275.json. In particular, it requires the principal collections metadata, source_catalog, nodes, edges, logic_groups, aliases, transactions, and statistics; enforces the exact v10.275 metadata identifiers; and checks specified mandatory node and edge fields and source-branch values. Crucial distinction: schema validation establishes that the JSON conforms to the declared data model. It does not prove the physical equations, independently check every mathematical argument, establish causal relations, or guarantee that all scientific dependencies have been closed. The present schema deliberately permits additional properties and is not a formal proof-assistant certificate. Independent mathematical and empirical scrutiny remains necessary. 4. How to audit an LHFT assertion Begin with a numbered claim in the working paper or the LHFT_Claim_and_Proof_Register_v10.275.html. Find the corresponding permanent node identifier in the canonical graph JSON and inspect its statement, assumptions, status, and proof_dependencies. Follow typed dependency and source-provenance relations back to the relevant frozen-action terms, independent comparison proofs, or counterexamples. Check every defect_gate that limits transfer of the mathematical result into a physical recovery claim. Use the accompanying JSON Schema to validate file structure, the source/claim register to verify interpretation, and the SHA-256 manifest to check file integrity. None of these replaces a substantive proof review. For example, a positive hidden-sector Schur reduction may yield a well-defined effective operator. The corresponding conclusion is conditional on positivity, invertibility, domain and reduction hypotheses. Its existence in a familiar block-matrix model does not establish that the complete LHFT action produces those hypotheses. The graph records that distinction instead of treating a successful comparator calculation as microscopic closure. 5. Scientific boundaries and falsifiability The paper explicitly does not claim a source-level derivation of all Einstein equations, a unique fine-structure constant, canonical quantization or the Born rule, or an experimentally confirmed LHFT-specific signal. In particular, the joint stationary background of the complete frozen action, its fully constrained positive physical operator and calibrated readout, and the quantum measurement instrument remain open. Nine physical source gates are tracked in the claim ledger (eight open and one partial in this version). The suggested observational program specifies nuisance-aware tests, not a new observational detection reported by this deposit. Several derivations included in the working paper are applications or specializations of known mathematical techniques. The project-specific contribution of the Proof Graph is systematic, versioned traceability of claims, assumptions, corrections, and outstanding physical obligations across a heterogeneous theory-building effort. No claim is made that knowledge graphs, formal verification, or proof-dependency registers are new inventions, or that storing a statement in this graph makes it true. 6. Files and reproducibility LHFT_Working_Paper_v10.275.pdf — the readable mathematical research paper. LHFT_Proof_Graph_v10.275.json — the canonical machine-readable argument and provenance graph. LHFT_Proof_Graph_v10.275.schema.json — its structural validation schema. The underlying frozen action is identified as Freeze_S1L.html, SHA-256 40321469e525e73b043fa5cd48bde275798092d8b2e242fef43c8cb733bff7fa. It is a separate primary-source document and should be made available alongside this record; it is contained in the upload package. Authorship and review status LHFT was developed by Christian Baganz (Potsdam, Germany). Preparation of the present research artifacts involved AI-assisted drafting and internal symbolic, structural, and provenance checks. These checks must not be confused with independent human peer review. This version is an author working paper intended for transparent scientific examination and criticism.
Authors
- CHRISTIAN BAGANZ
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24408641
- Primary Topic
- Relativity and Gravitational Theory
- Type
- preprint