TRUNCATION SYMMETRY THEOREM AND REFERENCE WEIGHT BASIS IN THE SCALED BERGMAN NUMERAL SYSTEM (SBNS)
This paper presents the algebraic formalization and proof of the Truncation Symmetry Theorem for the Scaled Bergman Numeral System (SBNS) – a positional computational basis with the irrational golden ratio base φ = (1 + √5) / 2 and a central scaling factor k = 0.2. By decomposing bit weights into a rational component involving Lucas numbers and an irrational component involving Fibonacci numbers, it is proven that applying a syntactic parity filter leads to the identical mutual cancellation of local decimal truncation errors for all natural numbers N ∈ ℕ. Strict invariance of the residual error during transitions between canonical dual code forms – Parity-Filter Working Code (PFWC / Code A) and Parity-Filter Check Code (PFCC / Code B) – is demonstrated. The paper provides a standardized formula for computing bit weights, reveals their mirror symmetry relative to the central scale element, and establishes a reference weight table for the index range n ∈ [−16, 14], suitable for implementing exact integer arithmetic in finite hardware registers.
Authors
- Andrey Voron
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24418125
- Primary Topic
- Advanced Mathematical Theories and Applications
- Type
- preprint