Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Congruence of `UniformlyImplementsOn` under matrix equality on the predicate domain

Open
GL2QFT.Circuits.uniformlyImplementsOn_eq

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

quantum-algorithmsquantum-circuitsrepresentation-theory

Let PPP be a predicate on finite-field instances D=(p,r,f,F,h)D = (p, r, f, F, h)D=(p,r,f,F,h), and let Φ,Φ′:D↦CY(D)×X(D)\Phi, \Phi' : D \mapsto \mathbb{C}^{Y(D) \times X(D)}Φ,Φ′:D↦CY(D)×X(D) be families of linear operators that agree pointwise whenever P(D)P(D)P(D) holds:

∀D,  P(D)  ⟹  Φ(D)=Φ′(D).\forall D,\; P(D) \implies \Phi(D) = \Phi'(D).∀D,P(D)⟹Φ(D)=Φ′(D).

If a uniform family of Clifford+TTT quantum circuits implements Φ\PhiΦ on PPP with input code cinc_{\mathrm{in}}cin​ and output code coutc_{\mathrm{out}}cout​, then the same circuit family uniformly implements Φ′\Phi'Φ′ on PPP.

This congruence rule allows algebraic matrix factorizations proved over P(D)P(D)P(D) to be substituted directly into uniform circuit bounds.

Preamble
import Definitions.Def_GL2QFT_Circuits_Combinators

open Classical
open GL2QFT QAlgorithms QAlgorithms.Complexity
Formal statement
namespace GL2QFT
namespace Circuits

theorem uniformlyImplementsOn_eq {P : FieldData → Prop} {X Y : FieldData → Type} [∀ D, Fintype (X D)] [∀ D, Fintype (Y D)] {inW outW : FieldData → ℕ} {cin : ∀ D, X D → Qubits (inW D)} {cout : ∀ D, Y D → Qubits (outW D)} {Φ Φ' : ∀ D, Matrix (Y D) (X D) ℂ} (h : UniformlyImplementsOn P cin cout Φ) (heq : ∀ D, P D → Φ D = Φ' D) : UniformlyImplementsOn P cin cout Φ' := by sorry

end Circuits
end GL2QFT
Source
Bruinsma, Posta, Stokvis, Grinko, Ozols (2026), Quantum Fourier transform toolbox, arXiv:2608.28573, §2.2 & §6.4 (pp. 12, 41), uniformity invariance under target equality

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