Encyclopedia Foundation Foundation Pair Kernel Scale Covariant Observables S20 Classified Responses Dist

ARTICLE 1 claim 1 theorem

Foundation Pair Kernel Scale Covariant Observables S20 Classified Responses Dist

A physical system's responses can tell its inputs apart exactly when each input leaves a distinct mark, a condition the framework proves equivalent to a structural property of its parent responses.

Distinguishable channels

The declaration classifiedResponses_distinguish_iff_parentInjective states a precise equivalence about how a physical system responds to events. In plain language, it says that a system can tell apart every possible input event from every other one, meaning each event produces a unique response, if and only if a certain structural map, called the parent response, is injective. A map is injective when it never sends two different inputs to the same output. So the theorem ties an operational idea, distinguishability, to a mathematical property, injectivity.

The framework models a physical process as a ledger, a discrete record of events, where each event carries a configuration of parent responses. The declaration shows that if you can always tell which event occurred by looking at the responses, then the underlying parent response structure must also be injective, and vice versa. This is not a claim about any particular physical system. It is a structural theorem: within the framework's model, the two notions, operational distinguishability and structural injectivity, are exactly the same condition.

The statement does not claim that any real system actually achieves this distinguishability. Whether a concrete physical carrier, like a particle or a field, realizes these responses is a separate question. The framework's library proves the structural equivalence, but the physical realization of those responses remains a hypothesis, not a theorem. The declaration also does not claim that distinguishability is always possible; it only says that when it holds, it is equivalent to injectivity.

What this means in practice is that the framework gives a clean mathematical handle on a physical idea. Instead of asking separately whether a system is distinguishable and whether its parent structure is injective, you can check one and get the other for free. This is a useful bridge between the operational language of experiments and the structural language of the framework's mathematics.

THEOREM parentTagResponse3_injective · IndisputableMonolith/Foundation/PairKernelScaleCovariantObservablesS20.lean
theorem parentTagResponse3_injective
    {N : ℕ} [NeZero N]
    {event : RealizedPostingEvent3 N} :
    Function.Injective
      (@parentTagResponse3 N _ event) := by
  intro left right h
  cases left with
  | inl leftAxis =>
      cases right with
      | inl rightAxis =>
          simp [parentTagResponse3] at h
          exact congrArg Sum.inl h
      | inr rightKind =>
          simp [parentTagResponse3] at h
  | inr leftKind =>
      cases right with
      | inl rightAxis =>
          simp [parentTagResponse3] at h
      | inr rightKind =>
          simp [parentTagResponse3] at h
          exact congrArg Sum.inr h

What this page does not claim

No real physical system is claimed to actually achieve this distinguishability. The physical realization of the parent responses is not claimed to be a theorem.

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

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND