Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The program measure qKtU\mathrm{qKt}_UqKtU​; polynomially universal and quasi-linear universal machines; the properties of Theorem D.30, Equation (36) and Lemma F.7

Definition
QuantumKtSoI_Supplement_qKtU

by iris · Nov 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorykolmogorov-complexityp2o-gran-per-chapterp2o-plan-bookp2o-v1quantum-computing

For a machine UUU of Definition 3.1 the measure defined by its programs is

qKtU(y∣x)=min⁡p,t{∣p∣+⌈log⁡t⌉:p∈{0,1}∗, t≥1, PU(⟨p,x⟩;t,y)≥2/3},\mathrm{qKt}_U(y|x)=\min_{p,t}\{|p|+\lceil\log t\rceil : p\in\{0,1\}^*,\ t\ge1,\ P_U(\langle p,x\rangle;t,y)\ge 2/3\},qKtU​(y∣x)=p,tmin​{∣p∣+⌈logt⌉:p∈{0,1}∗, t≥1, PU​(⟨p,x⟩;t,y)≥2/3},

with the minimum of the empty set equal to +∞+\infty+∞ and qKtU(y)=qKtU(y∣ϵ)\mathrm{qKt}_U(y)=\mathrm{qKt}_U(y|\epsilon)qKtU​(y)=qKtU​(y∣ϵ).

  1. UUU is polynomially universal (Equation (23)) with positive integers kU,CU,dUk_U,C_U,d_UkU​,CU​,dU​ if every description eee has a program pep_epe​ with ∣pe∣≤∣e∣+kU|p_e|\le|e|+k_U∣pe​∣≤∣e∣+kU​ and PU(⟨pe,x⟩;CU(t+∣e∣+∣x∣+1)dU,y)≥Pe(x;t,y)P_U(\langle p_e,x\rangle;C_U(t+|e|+|x|+1)^{d_U},y)\ge P_e(x;t,y)PU​(⟨pe​,x⟩;CU​(t+∣e∣+∣x∣+1)dU​,y)≥Pe​(x;t,y) for all x,yx,yx,y and t≥1t\ge1t≥1.
  2. UUU is quasi-linear universal (Definition 9.1, condition (U-a)) if there are constants ca,ca′≥1c_a,c'_a\ge1ca​,ca′​≥1 such that for every machine MMM, all strings w,x,yw,x,yw,x,y and every t≥1t\ge1t≥1,
PU(⟨⌜M⌝‾ w,x⟩;cM(t+∣x∣+∣w∣+1)⌈log⁡(t+2)⌉,y)≥PM(⟨w,x⟩;t,y),cM=ca(∣⌜M⌝∣+2)ca′.P_U\big(\langle\overline{\ulcorner M\urcorner}\,w,x\rangle;c_M(t+|x|+|w|+1)\lceil\log(t+2)\rceil,y\big)\ge P_M(\langle w,x\rangle;t,y),\qquad c_M=c_a(|\ulcorner M\urcorner|+2)^{c'_a}.PU​(⟨┌M┐w,x⟩;cM​(t+∣x∣+∣w∣+1)⌈log(t+2)⌉,y)≥PM​(⟨w,x⟩;t,y),cM​=ca​(∣┌M┐∣+2)ca′​.
  1. A machine III and a polynomial pIp_IpI​ with nonnegative coefficients have the Theorem D.30 property if PI(⟨e,x⟩;pI(∣e∣+log⁡(t+∣x∣+2))(t+∣x∣+∣e∣+1),y)≥Pe(x;t,y)P_I(\langle e,x\rangle;p_I(|e|+\log(t+|x|+2))(t+|x|+|e|+1),y)\ge P_e(x;t,y)PI​(⟨e,x⟩;pI​(∣e∣+log(t+∣x∣+2))(t+∣x∣+∣e∣+1),y)≥Pe​(x;t,y) for every description eee, all x,yx,yx,y and t≥1t\ge1t≥1.
  2. Equation (36) for III and UUU: there are γU≥1\gamma_U\ge1γU​≥1, ℓU,δU≥0\ell_U,\delta_U\ge0ℓU​,δU​≥0 with PU(⟨⌜I⌝‾ w,x⟩;γU(∣x∣+∣w∣+2)δU(t+∣x∣+∣w∣+1)⌈log⁡(t+2)⌉ℓU,y)≥PI(⟨w,x⟩;t,y)P_U(\langle\overline{\ulcorner I\urcorner}\,w,x\rangle;\gamma_U(|x|+|w|+2)^{\delta_U}(t+|x|+|w|+1)\lceil\log(t+2)\rceil^{\ell_U},y)\ge P_I(\langle w,x\rangle;t,y)PU​(⟨┌I┐w,x⟩;γU​(∣x∣+∣w∣+2)δU​(t+∣x∣+∣w∣+1)⌈log(t+2)⌉ℓU​,y)≥PI​(⟨w,x⟩;t,y).
  3. The Lemma F.7 properties of UUU with integers k≥2k\ge2k≥2, cU≥1c_U\ge1cU​≥1: (i) PU(⟨p,y⟩;t,w)=0P_U(\langle p,y\rangle;t,w)=0PU​(⟨p,y⟩;t,w)=0 for t≥1t\ge1t≥1 if ppp is not a description; (ii) PU(⟨p,y⟩;cU(∣p∣+∣y∣+s+2)k,w)≥Pp(y;s,w)P_U(\langle p,y\rangle;c_U(|p|+|y|+s+2)^k,w)\ge P_p(y;s,w)PU​(⟨p,y⟩;cU​(∣p∣+∣y∣+s+2)k,w)≥Pp​(y;s,w) for s≥0s\ge0s≥0 if ppp is a description; (iii) PU(⟨p,y⟩;t,w)≤Pp(y;⌊(kt)1/k⌋,w)P_U(\langle p,y\rangle;t,w)\le P_p(y;\lfloor(kt)^{1/k}\rfloor,w)PU​(⟨p,y⟩;t,w)≤Pp​(y;⌊(kt)1/k⌋,w) for t≥1t\ge1t≥1 if ppp is a description.

These are the objects of the model-dependence results of §9 and Appendices D and F.

Formalization Note qKtU\mathrm{qKt}_UqKtU​ takes values in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞} (ℕ∞), whose infimum of the empty set is ∞\infty∞. Machines are valid coded machines, ⌜M⌝\ulcorner M\urcorner┌M┐ is the published encoding and ⌜M⌝‾\overline{\ulcorner M\urcorner}┌M┐ its self-delimiting code (§2.1, the published sd), so the program ⌜M⌝‾ w\overline{\ulcorner M\urcorner}\,w┌M┐w is sd M.encode ++ w; real deadlines are floors, and descriptions and PeP_ePe​ are those of a glue routine set GGG.

Definition code
import Mathlib
import Definitions.Def_QuantumKtSoI_pair
import Definitions.Def_QuantumKtSoI_Desc

open Classical

noncomputable section

namespace QuantumKtSoI.Supplement

/-- The **program measure** of a machine `U` of Definition 3.1 (§9, p.117 of Myrisiotis, STOC 2027
submission, held version sha256 6616571c…):
`qKt_U(y | x) = min_{p,t} { |p| + ⌈log t⌉ : p ∈ {0,1}*, t ≥ 1, P_U(⟨p, x⟩; t, y) ≥ 2/3 }`,
with the minimum of the empty set taken to be `+∞`; `qKt_U(y) = qKt_U(y | ε)` is `qKtU U y []`.

**Formalization Note** The value lies in `ℕ∞`, whose `sInf ∅` is `⊤ = +∞`, exactly as the paper
specifies; `⌈log t⌉` is `Nat.clog 2 t`. -/
def qKtU (U : CodedMachine) (y x : List Bool) : ℕ∞ :=
  sInf {n : ℕ∞ | ∃ p : List Bool, ∃ t : ℕ, 1 ≤ t ∧
    (2 / 3 : ℝ) ≤ U.toMachine.outputProb (pair p x) t y ∧ n = ((p.length + Nat.clog 2 t : ℕ) : ℕ∞)}

/-- `U` is **polynomially universal** with constants `k_U, C_U, d_U` (Equation (23), pp.117–118):
for every description `e` there is a program `p_e` with `|p_e| ≤ |e| + k_U` and
`P_U(⟨p_e, x⟩; C_U(t + |e| + |x| + 1)^{d_U}, y) ≥ P_e(x; t, y)` for all strings `x, y` and integers
`t ≥ 1`. `U` is a machine of Definition 3.1 (a valid coded machine). -/
def PolyUniversal (G : GlueRoutines) (U : CodedMachine) (kU CU dU : ℕ) : Prop :=
  U.Valid ∧ ∀ e : Desc, ∃ pe : List Bool, pe.length ≤ e.bits.length + kU ∧
    ∀ x y : List Bool, ∀ t : ℕ, 1 ≤ t →
      e.prob G x t y ≤
        U.toMachine.outputProb (pair pe x) (CU * (t + e.bits.length + x.length + 1) ^ dU) y

/-- **Definition 9.1** (Quasi-linear universal machine, p.117): `U` satisfies condition (U-a) if
there are constants `c_a, c′_a ≥ 1` such that, for every machine `M` of Definition 3.1 (a valid
coded machine), all strings `w, x, y` and every integer `t ≥ 1`,
`P_U(⟨⌜M⌝‾w, x⟩; c_M(t + |x| + |w| + 1)⌈log(t + 2)⌉, y) ≥ P_M(⟨w, x⟩; t, y)` with
`c_M = c_a(|⌜M⌝| + 2)^{c′_a}`, where the program `⌜M⌝‾w` is the self-delimiting code (§2.1, p.14) of
the encoding of `M`, followed by `w`.

**Formalization Note** `⌜M⌝` is the published encoding `CodedMachine.encode` and `⌜M⌝‾` is its
published self-delimiting code `sd`; the real deadline is
read as `⌊·⌋` (p.22). The constants are taken real. -/
def QuasiLinUniversal (U : CodedMachine) : Prop :=
  U.Valid ∧ ∃ ca ca' : ℝ, 1 ≤ ca ∧ 1 ≤ ca' ∧ ∀ M : CodedMachine, M.Valid → ∀ w x y : List Bool, ∀ t : ℕ,
    1 ≤ t →
      M.toMachine.outputProb (pair w x) t y ≤
        U.toMachine.outputProbR (pair (sd M.encode ++ w) x)
          (ca * ((M.encode.length : ℝ) + 2) ^ ca' * ((t : ℝ) + x.length + w.length + 1) *
            (Nat.clog 2 (t + 2) : ℝ)) y

/-- The property of the machine `I` and the polynomial `p_I` in **Theorem D.30** (p.181): `p_I` has
nonnegative coefficients and, for every description `e`, all strings `x, y` and every integer
`t ≥ 1`, `P_I(⟨e, x⟩; p_I(|e| + log(t + |x| + 2))(t + |x| + |e| + 1), y) ≥ P_e(x; t, y)`.

**Formalization Note** The input `⟨e, x⟩` pairs the bit string of `e`; the real deadline is read
as `⌊·⌋` (p.22); `p_I` is a real polynomial evaluated at a real argument. -/
def InterpreterProp (G : GlueRoutines) (I : CodedMachine) (pI : Polynomial ℝ) : Prop :=
  I.Valid ∧ (∀ n, 0 ≤ pI.coeff n) ∧ ∀ e : Desc, ∀ x y : List Bool, ∀ t : ℕ, 1 ≤ t →
    e.prob G x t y ≤
      I.toMachine.outputProbR (pair e.bits x)
        (pI.eval ((e.bits.length : ℝ) + Real.logb 2 ((t : ℝ) + x.length + 2)) *
          ((t : ℝ) + x.length + e.bits.length + 1)) y

/-- **Equation (36)** (Corollary D.39, p.186) for machines `I` and `U`: there are constants
`γ_U ≥ 1` and `ℓ_U, δ_U ≥ 0` such that, for all strings `w, x, y` and every integer `t ≥ 1`,
`P_U(⟨⌜I⌝‾w, x⟩; γ_U(|x| + |w| + 2)^{δ_U}(t + |x| + |w| + 1)⌈log(t + 2)⌉^{ℓ_U}, y) ≥ P_I(⟨w, x⟩; t, y)`,
where `⌜I⌝‾` is the self-delimiting code `sd` of the published encoding of `I`.
The real deadline is read as `⌊·⌋` (p.22). -/
def Eq36 (I U : CodedMachine) : Prop :=
  U.Valid ∧ ∃ γU lU δU : ℝ, 1 ≤ γU ∧ 0 ≤ lU ∧ 0 ≤ δU ∧ ∀ w x y : List Bool, ∀ t : ℕ, 1 ≤ t →
    I.toMachine.outputProb (pair w x) t y ≤
      U.toMachine.outputProbR (pair (sd I.encode ++ w) x)
        (γU * ((x.length : ℝ) + w.length + 2) ^ δU * ((t : ℝ) + x.length + w.length + 1) *
          (Nat.clog 2 (t + 2) : ℝ) ^ lU) y

/-- Properties (i)–(iii) of the padded universal machine of **Lemma F.7** (p.242), for a machine
`U` and integers `k ≥ 2`, `c_U ≥ 1`, for all strings `p, y, w`:
(i) if `p` is not a description string, `P_U(⟨p, y⟩; t, w) = 0` for every `t ≥ 1`;
(ii) if `p = bits e`, then `P_U(⟨p, y⟩; c_U(|p| + |y| + s + 2)^k, w) ≥ P_e(y; s, w)` for every `s ≥ 0`;
(iii) if `p = bits e`, then `P_U(⟨p, y⟩; t, w) ≤ P_e(y; ⌊(kt)^{1/k}⌋, w)` for every `t ≥ 1`. -/
def PaddedUniversal (G : GlueRoutines) (U : CodedMachine) (k cU : ℕ) : Prop :=
  U.Valid ∧ 2 ≤ k ∧ 1 ≤ cU ∧
    (∀ p y w : List Bool, (∀ e : Desc, p ≠ e.bits) → ∀ t : ℕ, 1 ≤ t →
      U.toMachine.outputProb (pair p y) t w = 0) ∧
    (∀ e : Desc, ∀ y w : List Bool, ∀ s : ℕ,
      e.prob G y s w ≤ U.toMachine.outputProb (pair e.bits y) (cU * (e.bits.length + y.length + s + 2) ^ k) w) ∧
    (∀ e : Desc, ∀ y w : List Bool, ∀ t : ℕ, 1 ≤ t →
      U.toMachine.outputProb (pair e.bits y) t w ≤
        e.prob G y ⌊((k : ℝ) * t) ^ (1 / (k : ℝ))⌋₊ w)

end QuantumKtSoI.Supplement
Source
Myrisiotis, Failure of Symmetry of Information for Quantum Computations, STOC 2027 submission (held version, sha256 6616571c…), §9, pp.117–118 (qKt_U, Equation (23), Definition 9.1); Theorem D.30, p.181; Equation (36), p.186; Lemma F.7, p.242

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me