Authors: Andrey V. Voron
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.
Comments: 14 Pages.
Download: PDF
[v1] 2026-11-22 03:54:48
Unique-IP document downloads: 0 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.