Foundation Pair Kernel Physical Valuation Initiality S19 Weak Valuation Admits S

The limits of a weak valuation

The declaration weak_valuation_admits_same_card_misclassification is a theorem in the Recognition Science framework's machine-checked library of formal theorems. It proves that a valuation which preserves the core recognition structure can still misclassify carriers: it can fail to be injective, meaning two distinct channels can be assigned the same physical carrier, and it can fail to be surjective, meaning some physical carriers are never used by any channel. The theorem constructs a concrete example, a five-channel carrier, and shows it has both defects at once.

The valuation in question is called weak because it preserves only the weakest structural signature: it keeps the Tick composition law, reverse-event reciprocity, positivity, the D+2 classifier codomain, J aggregation, and a uniform energy-price relation. The theorem shows that this signature is not enough to force a clean one-to-one correspondence between the abstract recognition channels and the physical carriers that realize them. The framework's own vocabulary marks the boundary: the theorem is a non-uniqueness result, not a claim that the framework is broken or incomplete.

What the theorem does not claim is equally important. It does not say that every valuation misclassifies; it says there exists at least one such valuation. It does not say that the misclassification is unavoidable in the full framework; the same module proves that adding the stronger conditions of injectivity and surjectivity, along with self-similar survival and J-aggregate pricing, does force the physical readout semantics. The weak valuation is a boundary marker: it shows what the minimal structure cannot determine, and it isolates exactly which additional assumptions are needed to recover the intended physical picture.

/-- Even a five-element full weak valuation can collapse distinct parent
classes. Thus the numeral `D+2` cannot replace physical classification. -/
theorem weak_valuation_admits_same_card_misclassification :
    ∃ valuation : RecognitionPhysicalValuation3.{0} 3,
      ¬ PostingCarrierParentInjective3 valuation.physical ∧
        ¬ PostingCarrierParentSurjective3 valuation.physical := by
  refine
    ⟨unitRecognitionPhysicalValuation3
        (misclassifiedFiveChannelCarrier3 3),
      misclassifiedFiveCarrier_not_parentInjective,
      misclassifiedFiveCarrier_not_parentSurjective⟩

/-- Even a five-element full weak valuation can collapse distinct parent
classes. Thus the numeral `D+2` cannot replace physical classification. -/
theorem weak_valuation_admits_same_card_misclassification :
    ∃ valuation : RecognitionPhysicalValuation3.{0} 3,
      ¬ PostingCarrierParentInjective3 valuation.physical ∧
        ¬ PostingCarrierParentSurjective3 valuation.physical := by
  refine
    ⟨unitRecognitionPhysicalValuation3
        (misclassifiedFiveChannelCarrier3 3),
      misclassifiedFiveCarrier_not_parentInjective,
      misclassifiedFiveCarrier_not_parentSurjective⟩

/-- Even a five-element full weak valuation can collapse distinct parent
classes. Thus the numeral `D+2` cannot replace physical classification. -/
theorem weak_valuation_admits_same_card_misclassification :
    ∃ valuation : RecognitionPhysicalValuation3.{0} 3,
      ¬ PostingCarrierParentInjective3 valuation.physical ∧
        ¬ PostingCarrierParentSurjective3 valuation.physical := by
  refine
    ⟨unitRecognitionPhysicalValuation3
        (misclassifiedFiveChannelCarrier3 3),
      misclassifiedFiveCarrier_not_parentInjective,
      misclassifiedFiveCarrier_not_parentSurjective⟩

What this page does not claim

The theorem does not claim that all weak valuations misclassify, only that one exists. The theorem does not claim that the full framework is inconsistent; it isolates a boundary of the weak signature. The theorem does not claim that the misclassification is physically realized; it is a formal possibility.

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/PairKernelPhysicalValuationInitialityS19.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: