Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Range of the regular rescaling quotient

Proved
QAlgorithms.Papers.Independent.Intakethird100.P13.rescaling_range

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let γ,s∈[0,1]\gamma,s\in[0,1]γ,s∈[0,1] and assume 1−γs>01-\gamma s>01−γs>0, the domain of the displayed real quotient. Then

0≤1−γ1−γs≤1.0\le\frac{1-\gamma}{1-\gamma s}\le1.0≤1−γs1−γ​≤1.

In the decomposition proof s=S30≥0s=S_{30}\ge0s=S30​≥0. The singular pair (1,1)(1,1)(1,1) is handled by the physical endpoint characterization and is not assigned a quotient value.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P13
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P13

attribute [local instance] Classical.propDecidable Classical.decEq

/-- arXiv:1706.05384v2 PDF p.12, Lemma 20.
Domain correction: the printed proof uses a quotient at the singular pair (1,1);
strict positivity states its ordinary real-quotient domain. -/
theorem rescaling_range (gamma s30 : ℝ) (hg0 : 0 ≤ gamma) (hg1 : gamma ≤ 1)
    (hs0 : 0 ≤ s30) (hs1 : s30 ≤ 1) (hden : 0 < 1-gamma*s30) :
    rescaling gamma s30 ∈ Set.Icc (0 : ℝ) 1 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P13

end
Source
Simulation of non-Pauli Channels, arXiv:1706.05384v2, PDF p. 12, Lemma 20
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all real γ,s30\gamma,s_{30}γ,s30​ satisfying 0≤γ≤10\le\gamma\le10≤γ≤1, 0≤s30≤10\le s_{30}\le10≤s30​≤1, and 0<1−γs300<1-\gamma s_{30}0<1−γs30​, the quotient satisfies

0≤1−γ1−γs30≤1.0\le\frac{1-\gamma}{1-\gamma s_{30}}\le1.0≤1−γs30​1−γ​≤1.

The interval bounds are non-strict; the strictly positive denominator hypothesis excludes the pair (γ,s30)=(1,1)(\gamma,s_{30})=(1,1)(γ,s30​)=(1,1), while allowing γ=1\gamma=1γ=1 whenever s30<1s_{30}<1s30​<1.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me