Quick Navigation
Topics
Quantum Simulation
Open Quantum Systems Decoherence
Entanglement Theory Quantum Correlations
The Born Rule as the Unique Refinement-Stable Induced Weight on Robust Record Sectors
arXiv
Authors: Marko Lela
Year
2026
Paper ID
35756
Status
Preprint
Abstract Read
~2 min
Abstract Words
166
Citations
N/A
Abstract
This paper proves a conditional structural uniqueness theorem for induced weight on robust record sectors within an admissible Hilbert record layer. Its theorem target and additive carrier differ from those of the standard Born-rule routes: additivity is not placed on the full projector lattice, but on disjoint admissible continuation bundles through an extensive bundle valuation, from which the sector-level additive law is inherited under admissible refinement. Accordingly, the result is not a Gleason-type representation theorem in different language, but a distinct uniqueness theorem about induced sector weight inherited from bundle additivity on admissible continuation structure. Under two explicit structural conditions, internal equivalence of admissible binary refinement profiles and sufficient admissible refinement richness, the quadratic assignment is the only non-negative refinement-stable induced weight on robust record sectors. In the main theorem, refinement richness is secured by admissible binary saturation. A supplementary proposition shows that dense admissible saturation already suffices if continuity of the profile function is added. Under normalization, the result reduces to the standard Born assignment.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- This paper proves a conditional structural uniqueness theorem for induced weight on robust record sectors within an admissible Hilbert record layer.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.