Recognition Science: From Distinctions to Physical Consequences
Two physical states can have the same cost and still respond differently to the same action, so a description that keeps only the cost cannot say what a participant will undergo. We ask what a description must keep so that no accessible consequence is lost. Squaring a comparison of two counts as signed postings and reading the residual against the comparison's own cross postings gives the reciprocal cost J(x) = (x + x−1)/2 − 1; a fixed composition law for chained comparisons, with a unit calibration, singles it out among all costs. Measured responses to that cost recover a directed ledger of bonds between participants. Economic transitions act on the same ledger, and a record of the path keeps what endpoint sums lose. On a finite quantum system, a finite list of preserved binary decisions (two, for a qubit) forces a physical channel that recovers the whole state, including its correlations with a retained reference. Each result holds under stated physical premises. The Born weights are fixed by stated record rules, chief among them register noncontextuality. What remains to be derived is which outcome a read gives and when, and which carriers and interactions the ledger's laws produce. Version 1.1 adds: the confusion of a comparison with its reverse is the only one any cost obeying the three laws of identity can make, so a cost-only description loses exactly the direction of each bond; the shape of the composition law is forced for every rational cost with no ceiling, and the record reading is its member k = 1 with the unit fixed by calibration; a test that tells the cost apart from a quadratic logarithmic rival; harm counted once, with a borne share that sums to the change of the ledger's total cost; the sphere of a qubit read as the sphere of ratios, on which the cost is sec(latitude) − 1; the characterization of local subjects composing into a whole; and the Born weights from stated record rules. It corrects version 1.0's abstract, which said that two preserved binary decisions force recovery on any finite quantum system: two suffice for a qubit, and d levels need a longer finite list (Theorem 6.1).
Authors
- Jonathan Washburn (ORCID: https://orcid.org/0009-0001-8868-7497)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-14
- DOI
- https://doi.org/10.5281/zenodo.24221138
- Primary Topic
- Quantum Mechanics and Applications
- Type
- preprint