The Moral Code from the Physics of the Record: Six Requirements on Reading the Record Fix One Law

The manuscript supplies a conditional characterization of a unique Boolean law on three-number addresses of a bilateral record. Definition 3.2 introduces the address (o, w, d) with sources x = o - d and y = w + d. A candidate law is any map from addresses to {yes, no}. Section 4 states six requirements on reading the record as it stands: R1 (whole posting invariance), U (unit invariance), R5 (acknowledged part read as third record), RS (no unheld set-off), R4 (other's further entry never ends a wrong), and H (balance differs from unit half-posting). Lemma 5.1 reduces any R1-law to a function of the two sources. Lemma 5.2 shows that R1, U, R5 and RS force constancy on the three regions P = {x > 0, x + y > 0}, N = {x < 0, x + y < 0} and Z = {x(x + y) <= 0}. Theorem 5.3 then proves that the six requirements together hold if and only if the law is A: yes exactly when 0 < x and 0 < x + y. The proof is elementary and fully written: H forces the answers at (0,0) and (1,0) to differ; R4 then forces z = no, p = yes and n = no. The converse is direct verification that A is constant on the regions and satisfies R4 and H. No continuity, measurability or topological hypothesis is used. The cost functional J never enters the argument of Theorem 5.3; it appears only later as a consistency check. Theorem 5.4 supplies an explicit counter-law for each dropped requirement (A restricted to d = 0, the half-unit threshold law, B, W, negation of A, and always-no), confirming necessity. The table on page 14 and the surrounding case analysis check out against the dropped moves. Thus the mathematical core is a clean, self-contained axiomatization of one Boolean predicate under six stated symmetries and polarity conditions. Domain of validity is every real triple (o, w, d); the result is exact, not approximate. Figure 1 visualizes the regions and the anchor line fixed by {R4, H}. Theorem 6.3 shows that the pair {R4, H} alone fixes answers only on the rays o <= 0 and o >= 1 of the line w = d = 0, and that any sub-collection fixing any answer must contain both. Theorem 6.4 locates the two contested points: RS decides (1,2,0) against the netted reading W, while R5 decides (1,-1,0) against the authorship-only reading B. These location results are correct and useful.

Section 7 treats the netted reading W : |y| < x. Theorem 7.2 proves that W(a) equals A on the set-off record whose sources are (x - s, y - s) with s = min(max(x,0), max(y,0)). Theorem 7.3 shows a set-off is on the record exactly when both parties write; Corollary 7.4 therefore makes the choice between A and W a fact of authorship rather than a free reading. Theorems 7.5 and 7.6 exhibit the two turns of W under the asked party's own entry alone, both of which violate RS. Theorem 7.7 recovers W from the rival set {R1, R2, R3, R4, R5}. Theorem 7.9 proves the sharp mutual exclusion: no law meets R1, H, RS and R2 simultaneously, while A meets the first three and W meets R1, H and R2. The exclusion is elementary and correctly proved; it shows that the manuscript identifies a genuine choice rather than deriving RS from shared record structure. Section 7.3 carries authorship to a reading via AU. Theorem 7.10 shows that AU plus R1, U, R4, H yields exactly B (yes iff 0 < x); Theorem 7.11 shows that extending the same sentence to joint entries against a fixed third record leaves only constant laws, which fail H. The history of acknowledgment and withdrawal (pages 21-22) makes the parting of A and AU concrete. These results correctly locate where the identification H1 sits.

Section 8 supplies an independent consistency check that uses the imported cost J. Lemma 8.2 expands the averaged harm of the other's entry over the two writing orders; the algebra is correct (the common numerator expands to (c - d)(c - a)(a + d)). Theorem 8.3 shows that, with equal weights fixed by the exchange symmetry (Lemma 8.1) and with the entry taken in its writer's favour, the sign of averaged harm recovers A. A confirmed typographic inconsistency appears on page 23: the destination-side averaged harm correctly writes (1/2)(c-d)(c-a)(a+d)/(2acd), while the parallel source-side line omits the leading 1/2 before (d-a)(c-a)(c+d)/(2acd). Because the omitted factor is positive the sign claim is unaffected; the display should be corrected to match Lemma 8.2. Theorem 8.4 shows that, inside the four symmetries, the cost carries only the single bit that the balanced record is no wrong. Theorem 8.5 shows that the undirected harm law E (yes iff 0 < x(x + y)) meets the four symmetries and H but fails R4, differing from A exactly on N. The direction is therefore R4's alone; the ground of R4 is not independent of that direction, a limitation the manuscript states.

Sections 9-10 extend the account under further premises. Theorem 9.1 shows that only an end's own entry moves a pair's net source. Under the identification that an undertaking is a posting due later (H6), an open unmet undertaking has address with x = 1, y = 0, so A answers yes. Theorem 9.2 defines the standing amount S_t; Theorem 9.3 and Corollary 9.4 then show that, under the one-ledger premise H3 on the amount reading, the remedy due equals the standing amount and a wrong stands while its cost is unanswered. These results unpack H3 rather than derive it; the manuscript correctly notes that the ratio reading of Section 8 is a different object (Lemma 2.6). Section 10 axiomatizes "bound" by four Boolean requirements K1-K4. Theorem 10.1 yields exactly two laws, K_code and K_form, differing only at the extorted address (1,1,0). Theorem 10.2 selects K_code once the open premise H7 (every yes under a false charge conditions payment on release) is assumed. Theorem 10.3 recovers "permitted" from the definition H8 once A is in force. All of these extensions are conditional on the listed premises; they are not consequences of Theorem 5.3 alone.

Section 11 shows that the same law appears on one re-encoding. The posting-current basis (probe plus preserving and reversing comparisons) admits exactly A (Theorem 11.1). The account-books basis, stated in the books' own words, is joined to the current basis by the amount reading (Lemma 11.2). Theorem 11.3 therefore recovers A in the books' language: 1 + d < F_S and 0 < F_S - F_D. Theorem 11.4 proves that the books forget authorship and the third record: a joint entry leaves the same books as successive own entries, and a crossed unit versus an uncrossed unit can leave identical entries. The result is invariance under this particular re-encoding, not preservation across every faithful realization; the manuscript states the limitation. Theorem 12.1 assembles the pieces under the eight premises H1-H8, with an explicit status table (identified, fact, open, definition). The table correctly marks H1 as identification, H7 as open, and H3 as amount-reading specific. The six requirements were found by working back from A; rival sets yield W, B and E (Theorems 7.7, 7.10, 8.5). No observation testing the two contested record types is offered. The mathematical theorems that were re-derived from the page images (5.3, 5.4, 6.3, 7.2, 7.9, 8.2-8.5, 10.1, 11.1, 11.3) hold under their stated premises. The broader claim that the result is "the" moral law of the record remains conditional on the identification H1 and on the open premise H7. The title and high-level framing can still be read more strongly than the conditional theorems support; the body, especially Sections 5, 6 and 12, already separates identification from characterization with unusual clarity. References [7] (Aczel) and [8] (Padoa) are real historical works; resolver misses do not indicate fabrication. The cost uniqueness Theorem 2.2 is imported background for Section 8 only and is not needed for the main characterization. Overall the paper is a carefully written conditional axiomatization whose internal mathematics is sound (apart from one display inconsistency that does not affect any theorem), whose limitations are largely self-reported, and whose physical or moral force rests on premises that remain open or identified rather than derived.

If the central characterization holds under its stated premises, the work supplies a clean, elementary uniqueness result for a binary predicate on three-number record addresses, with explicit necessity of each axiom and transparent separation of identification from theorem. Within the author's Recognition-Science framework this organizes several related readings and shows exactly where contested answers sit. Broader significance for ethics or physics remains limited: the decisive requirements are not independently derived or empirically tested, several supporting premises (especially the identification itself and one open fact about record terms) stay open, and preservation is shown only for one re-encoding of the same quantities. The paper itself marks these limits; the result is best read as a conditional axiomatization of one proposed reading, not as an established physical derivation of moral law.

1. Transparent separation of identification H1 from characterization Theorem 5.3, with an explicit status table for every premise.
2. Elementary, fully written proofs of uniqueness under the six requirements and of necessity of each requirement via explicit counter-laws.
3. Clean map of rival axiom sets to rival laws W, B and E, and the mutual exclusion of RS and R2 given only R1 and H.
4. Main characterization independent of the cost J; J used only as a labelled consistency check.
5. Careful edition history and correction log that make the logical development auditable.

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes. It does not decide whether the paper is published.

Get a human review · Become a reviewer

Competing interests. The author is affiliated with the Recognition Physics Institute and is an owner of Pith.

License. This paper is distributed under the Creative Commons Attribution 4.0 license.