A Finite-Resolution Locking of the Fine-Structure Constant: Deterministic, Non-Fitted Determination from Minimal Update Rules

Read full text
Authors: T Momose
Cited by: 0

Abstract

Important update: This is an earlier Alpha Locking record in the development path toward the current FDC/SCR structural readout framework. For the current compact structural readout record, including the updated readout near Φ_G ≈ 137.035999166, to be compared externally with CODATA 2022 α⁻¹ = 137.035999177, please see: SCR-v4: Structural Constant Readouts DOI: 10.5281/zenodo.20069325 For the current formal framework behind the readout grammar, please see: FDC-v7: Finite Distinguishability Closure DOI: 10.5281/zenodo.18926335 This earlier Alpha Locking record is retained as an archival development record. The current preferred references are SCR-v4 for numerical readouts and FDC-v7 for the formal closure framework. --------------------------------------------------------------------------------------------------------------------------------------- We present a deterministic and non-fitted selection mechanism for the fine-structure constant α based on a minimal set of finite-resolution update rules. Under explicit constraints—finite resolution, one-bit distinguishability, isotropic nearest-neighbor closure, and prohibition of parameter fitting—the admissible parameter space collapses to a unique discrete class. The absolute value of the inverse constant is reported as a residual between a canonical continuum limit and a finite discrete construction, while the locking decision itself remains strictly reference-free and depends only on discrete stability conditions. The resulting value is numerically consistent with the observed inverse fine-structure constant, α^{-1} ≈ 137.035999…, without using any experimental input. Full axiomatic specification and algorithmic reproducibility details are provided in the Supplemental Material. Changelog (this version): The formulation is revised to a residual definition α^{-1}(m)=K(c_ref−c_free(m)), removing any additive-origin framing. Any hard upper bound on the search range (e.g., m_max=13) is removed; enumeration proceeds m=2,3,… with an algorithmic stopping rule. The locking decision is made strictly reference-free via Δ(m), with c_ref canceling identically in the predicate; the absolute value is reported only after locking.

Fields of Study & Subjects

Model Reduction and Neural Networks Matrix Theory and Algorithms Advanced Numerical Methods in Computational Mathematics

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
3 January 2026
Language
EN
Document type
Preprint