Pith. sign in
module module high

IndisputableMonolith.Information.NoCloning

show as:
view Lean formalization →

The Information.NoCloning module formalizes the no-cloning theorem for quantum states inside Recognition Science. It defines states as unit vectors in Hilbert space and shows that no cloning machine preserves inner products for all inputs. The argument uses algebraic constraints on inner products together with the discrete time quantum from Constants.

claimA quantum state is a unit vector $\psi$ in a Hilbert space $\mathcal{H}$ with $\|\psi\|=1$. No linear cloning map $C$ exists such that $C(\psi \otimes |0\rangle) = \psi \otimes \psi$ for every $\psi$, because the inner-product preservation condition forces a contradiction for non-orthogonal states.

background

This module sits in the Information domain and imports the RS time quantum $\tau_0 = 1$ tick from Constants. It introduces QuantumState as a unit vector, the inner product on the space, and a CloningMachine as a hypothetical linear operator. The setting links these objects to the discrete tick structure of Recognition Science, where all operations are ultimately counted in fundamental time quanta.

proof idea

The module first defines the basic objects (states, inner products, cloning machines). It then derives an algebraic constraint that any cloning map must obey. Direct substitution of the inner-product condition produces a contradiction unless the states are orthogonal, yielding the no-cloning result by elementary calculation.

why it matters in Recognition Science

The module supplies the no-cloning limit as a foundational constraint for quantum information within Recognition Science. It supports later results on measurement disturbance and quantum cryptography. No downstream theorems are recorded in the current dependency graph, but the content aligns with the discrete information processing enforced by the eight-tick octave and the phi-ladder.

scope and limits

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (20)