Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Games / CondLinearTheorems / Reindex

Definition
QPBT_QPBT_Games_CondLinearTheorems_Reindex

by Dengnifer · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

qpbt

This bundle defines reindexing of conditionally linear maps across register embeddings. It restricts a coefficient vector, applies the original map, extends by zero outside the image, and gives the resulting application formula.

Principal definitions:

  • MIPStarRE.QPBT.reindexLinearMap: transports a linear map through a register reindexing.
  • MIPStarRE.QPBT.reindexLinearMap_apply: the embedded-coordinate and zero-complement application rule.

Formalization Credit. This Lean declaration is part of the Quantum Pauli basis test formalization by Ruixuan Deng. The source code was generated by AI agents; Ruixuan Deng is the responsible maintainer.

Mathematical Source. The mathematical source is Ji, Natarajan, Vidick, Wright, and Yuen, MIP*=RE, arXiv:2001.04383v3.

Definition code
-- Generated from QPBT/Games/CondLinearTheorems/Reindex.lean by skeleton subtraction.
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_QuantumState
import Definitions.Def_LIDT_MIPStarRE_LDT_CommutativityPoints_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core
import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Families
import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Interpolation
import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr
import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore

namespace MIPStarRE.QPBT
end MIPStarRE.QPBT

/-!
# Reindexing of conditionally linear functions

A conditionally linear function of one register space transports along an
injective map of index types.  The transported function restricts a coefficient
vector to the registers named by that map, applies the original function, and
extends the result by zero outside the image; it is conditionally linear at the
same level on the full register.  In the one-level case the predicate holds of
every linear map of the ambient coefficient space, which is the converse
direction of the remark following `def:cl-func`.

## References

The source definition is `def:cl-func` in
`blueprint/src/chapter/ch12_qpbt_games.tex`, with paper origin
`references/qpbt-paper/05_conditionally_linear_functions.tex:35-57`.
-/

@[expose] public section

namespace MIPStarRE.QPBT



/-- Transport a linear map of coefficient vectors along a reindexing `f` of
registers: restrict a vector to the registers named by `f`, apply the map, and
extend the result by zero outside the image of `f`.  This is the composition of
restriction along `f` with `Function.ExtendByZero.linearMap`, named here for the
reindexing of `def:cl-func`. -/
noncomputable def reindexLinearMap {K κ ι : Type*} [Field K] (f : κ → ι)
    (L : (κ → K) →ₗ[K] (κ → K)) : (ι → K) →ₗ[K] (ι → K) :=
  (Function.ExtendByZero.linearMap K f).comp (L.comp (LinearMap.funLeft K K f))

@[simp]
theorem reindexLinearMap_apply {K κ ι : Type*} [Field K] (f : κ → ι)
    (L : (κ → K) →ₗ[K] (κ → K)) (x : ι → K) :
    _root_.MIPStarRE.QPBT.reindexLinearMap f L x = Function.extend f (L fun k => x (f k)) 0 :=
  rfl











end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Games/CondLinearTheorems/Reindex.lean#L43-L56

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