Foundation Pair Kernel Posting Boundary Record Free Unit Assignment Rejected By

The rejected free unit

A posting boundary record is the numerical trace of a single economic event, a transfer between two accounts. In the Recognition Science framework, this record is computed as a flux across a boundary: a sum of signed values flowing from a source pole to a sink pole. The framework's machine-checked library of formal theorems proves that for any realized posting, this boundary flux is exactly 1 in one direction and exactly -1 in the reverse direction. That orientation is not a convention; it is forced by the antisymmetry of the underlying flow.

The declaration freeUnitAssignment (a freely chosen constant value of 1 assigned to any pair of poles) is rejected as an occurrence identity. The theorem scalar_flux_eq_does_not_force_same_poles proves that two distinct oriented records can share the same scalar flux: with at least three poles, two different source-sink pairs both yield flux 1. Therefore a bare number, such as the unit 1, cannot distinguish which posting actually occurred. The framework proves that a recovery mechanism, which reads a bit from a cut and matches it to the boundary record, must force that bit to be constant (always 1), and thus cannot carry the identity of the posting. The moving-cut occurrence bridge is stated as OPEN: recovering the bare bit is forced to a free constant channel, which is refused as occurrence identity.

What this establishes is a negative result with a positive consequence. The framework does not claim that a free unit assignment is a valid record. It proves that the only way to recover a posting boundary record from a bit carrier forces the bit to be constant, and therefore the record cannot be the identity of the occurrence. The framework's library shows that a posting step is unique by account and side, but the scalar flux alone does not determine the poles. The consequence is that occurrence identity requires more structure than a single real number, and the framework models that structure as the oriented pair of poles itself.

/-- Orientation theorem: forward record `+1`, reversed flow on the same region
`-1`. -/
theorem postingBoundaryRecord_orientation
    {n : ℕ} (source sink : Fin n) (h : source ≠ sink) :
    postingBoundaryRecord source sink = 1 ∧
      boundaryFluxAcrossDebit (elementaryPosting sink source) source = -1 :=
  ⟨postingBoundaryRecord_forward source sink h,
    postingBoundaryRecord_reversed_flow source sink h⟩

/-- Scalar-coincidence decoy: equal unit fluxes do not identify poles. -/
theorem scalar_flux_eq_does_not_force_same_poles
    {n : ℕ} (hn : 3 ≤ n) :
    ∃ r₁ r₂ : OrientedPostingBoundaryRecord n,
      r₁.flux = r₂.flux ∧ r₁ ≠ r₂ := by
  have hpos : 0 < n := lt_of_lt_of_le (by decide : (0 : ℕ) < 3) hn
  have h1 : 1 < n := lt_of_lt_of_le (by decide : (1 : ℕ) < 3) hn
  have h2 : 2 < n := lt_of_lt_of_le (by decide : (2 : ℕ) < 3) hn
  let a : Fin n := ⟨0, hpos⟩
  let b : Fin n := ⟨1, h1⟩
  let c : Fin n := ⟨2, h2⟩
  have hab : a ≠ b := by
    intro h; exact (by decide : (0 : ℕ) ≠ 1) (congrArg Fin.val h)
  have hac : a ≠ c := by
    intro h; exact (by decide : (0 : ℕ) ≠ 2) (congrArg Fin.val h)
  refine ⟨⟨a, b, hab⟩, ⟨a, c, hac⟩, ?_, ?_⟩
  · simp [OrientedPostingBoundaryRecord.flux,
      postingBoundaryRecord_forward a b hab,
      postingBoundaryRecord_forward a c hac]
  · intro hEq
    have hsink :=
      (orientedPostingBoundaryRecord_eq_iff_same_poles
        ⟨a, b, hab⟩ ⟨a, c, hac⟩).mp hEq
    exact (by decide : (1 : ℕ) ≠ 2) (congrArg Fin.val hsink.2)

theorem recovers_implies_constant
    (attach : CutBitOfOrientedPosting)
    (hrec : RecoversPostingBoundaryRecord attach) :
    IsConstantCutBit attach :=
  ⟨(1 : ZMod 2), fun _ _ _ => recovers_forces_posted_one attach hrec _ _ _⟩

What this page does not claim

This does not claim that a free unit assignment is a valid posting record. This does not claim that the scalar flux alone can identify a posting occurrence. This does not claim that the moving-cut occurrence bridge has been constructed.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/PairKernelPostingBoundaryRecord.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: