Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Abstract main result (p.1), pinned to Theorem 7.1

Open
QAlgorithms.Papers.Independent.Support50.P12.theorem_7_1

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let A1⊆B(H1)\mathcal A_1\subseteq B(H_1)A1​⊆B(H1​) and A2⊆B(H2)\mathcal A_2\subseteq B(H_2)A2​⊆B(H2​) be concrete unital algebras on nonzero finite-dimensional complex Hilbert spaces, and let Φ:A1→A2\Phi:\mathcal A_1\to\mathcal A_2Φ:A1​→A2​ be complex linear. The adjoint is for ⟨X,Y⟩HS=Tr⁡X∗Y\langle X,Y\rangle_{\rm HS}=\operatorname{Tr}X^*Y⟨X,Y⟩HS​=TrX∗Y. A substochastic map has a Schwarz-contracting adjoint; stochastic additionally means trace preserving. Let A,B∈A1,+A,B\in\mathcal A_{1,+}A,B∈A1,+​. Powers are zero on kernels and traces are not normalized. Write Sα(A∥B)S_\alpha(A\Vert B)Sα​(A∥B) for the unnormalized Petz Rényi entropy, ψA,B(α)=log⁡Tr⁡AαB1−α\psi_{A,B}(\alpha)=\log\operatorname{Tr}A^\alpha B^{1-\alpha}ψA,B​(α)=logTrAαB1−α, C(A∥B)=sup⁡0≤α<1−ψA,B(α)C(A\Vert B)=\sup_{0\le\alpha<1}-\psi_{A,B}(\alpha)C(A∥B)=sup0≤α<1​−ψA,B​(α), and Hr(A∥B)=sup⁡0≤α<1[−αr−ψA,B(α)]/(1−α)H_r(A\Vert B)=\sup_{0\le\alpha<1}[-\alpha r-\psi_{A,B}(\alpha)]/(1-\alpha)Hr​(A∥B)=sup0≤α<1​[−αr−ψA,B​(α)]/(1−α). Logarithms are natural and log⁡0=−∞\log0=-\inftylog0=−∞. The Petz map is ΦB∗(Y)=B1/2Φ∗(Φ(B)−1/2YΦ(B)−1/2)B1/2\Phi_B^*(Y)=B^{1/2}\Phi^*(\Phi(B)^{-1/2}Y\Phi(B)^{-1/2})B^{1/2}ΦB∗​(Y)=B1/2Φ∗(Φ(B)−1/2YΦ(B)−1/2)B1/2. Let CCC be a nonempty set of density operators in A1\mathcal A_1A1​. Write co⁡‾C\overline{\operatorname{co}}CcoC for its closed convex hull, PCP_CPC​ for its joined support, and d2=(dim⁡H1)2+(dim⁡H2)2d^2=(\dim H_1)^2+(\dim H_2)^2d2=(dimH1​)2+(dimH2​)2.

If Φ\PhiΦ is trace preserving and two-positive, the following are equivalent: (i) one stochastic Ψ\PsiΨ recovers every state in the closed convex hull; (ii) every operator convex fff preserves every pair's divergence on that hull; (iii) one reference density σ\sigmaσ with support covering PCP_CPC​ and one operator convex fff with ∣supp⁡μf∣≥d2|\operatorname{supp}\mu_f|\ge d^2∣suppμf​∣≥d2 preserve Sf(ρ∥σ)S_f(\rho\Vert\sigma)Sf​(ρ∥σ) for all ρ∈C\rho\in Cρ∈C; (iv) one such reference and one T⊂(0,∞)T\subset(0,\infty)T⊂(0,∞), ∣T∣≥d2|T|\ge d^2∣T∣≥d2, preserve all SφtS_{\varphi_t}Sφt​​ for every code state, where φt(x)=−x/(x+t)\varphi_t(x)=-x/(x+t)φt​(x)=−x/(x+t); (v) all HrH_rHr​ preserve every pair on the hull for every real rrr; (vi) one covering reference and one δ>0\delta>0δ>0 give preservation for all code states and all 0<r<δ0<r<\delta0<r<δ; (vii) every hull state is recovered by Φσ∗\Phi_\sigma^*Φσ∗​ for every hull reference with support exactly PCP_CPC​; (viii) one density reference has that recovery property for all code states; (ix) the input/output code supports have shared orthogonal tensor-block decompositions with invertible right density operators ωk,ω~k\omega_k,\widetilde\omega_kωk​,ωk​ and left unitaries UkU_kUk​, such that every code state is ⨁kpkρk,L⊗ωk\bigoplus_kp_k\rho_{k,L}\otimes\omega_k⨁k​pk​ρk,L​⊗ωk​ and

Φ(X⊗ωk)=UkXUk∗⊗ω~k(X∈B(H1,k,L)).\Phi(X\otimes\omega_k)=U_kXU_k^*\otimes\widetilde\omega_k\qquad(X\in B(H_{1,k,L})).Φ(X⊗ωk​)=Uk​XUk∗​⊗ωk​(X∈B(H1,k,L​)).

The same recovery can retain each given nnn-positivity level of Φ\PhiΦ, or complete positivity. For merely substochastic Φ\PhiΦ, (i)⇒(ii)⇒(iii)⇒(iv)⇒(viii)(i)\Rightarrow(ii)\Rightarrow(iii)\Rightarrow(iv)\Rightarrow(viii)(i)⇒(ii)⇒(iii)⇒(iv)⇒(viii) still holds. Finally, (x) one covering density reference σ\sigmaσ gives

Tp(Φ⊗n(ρ⊗n)∥Φ⊗n(σ⊗n))=Tp(ρ⊗n∥σ⊗n)(ρ∈C, 0<p<1, n∈N),T_p(\Phi^{\otimes n}(\rho^{\otimes n})\Vert\Phi^{\otimes n}(\sigma^{\otimes n}))=T_p(\rho^{\otimes n}\Vert\sigma^{\otimes n})\quad(\rho\in C,\ 0<p<1,\ n\in\mathbb N),Tp​(Φ⊗n(ρ⊗n)∥Φ⊗n(σ⊗n))=Tp​(ρ⊗n∥σ⊗n)(ρ∈C, 0<p<1, n∈N),

where Tp=−log⁡(Popt/min⁡(p,1−p))T_p=-\log(P_{\rm opt}/\min(p,1-p))Tp​=−log(Popt​/min(p,1−p)), is sufficient for (i)–(viii), and necessary when Φ\PhiΦ is completely positive. References, generators, parameter sets and block data are chosen before all states being tested. This is the full error-correction equivalence.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P12

open Filter MeasureTheory Set

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)

open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)

open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)

open QAlgorithms.Papers.Independent.Next46.P23 (Supports)

open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)

open QAlgorithms (spectralProjector)

open QAlgorithms.Learning (IsDistribution)

open QAlgorithms.Papers.Independent.Information100.P04 (absOp)

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
  [Fintype K] [DecidableEq K]

/-- Theorem 7.1, PDF pp.33–34 (abstract p.1): all nine equivalences, all uniform
choices, both positivity refinements, the substochastic chain, and criterion (x).
The bound is dim(H1)^2+dim(H2)^2. -/
theorem theorem_7_1 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
    (hc : AlgebraExtension A B Phi) (C : Set (Mat I)) (hn : C.Nonempty) (hC : ∀ rho ∈ C, AlgebraDensity A rho) :
    let c := codeConditions A B Phi C
    ((AlgebraTracePreserving A Phi ∧ AlgebraKPositive A Phi 2) →
      (∀ i : Fin 9, c (Fin.castSucc i) ↔ c 0) ∧
      (c 0 → RecoveryRefinement A B Phi (hull C)) ∧
      (c 9 → ∀ i : Fin 8, c (Fin.castLE (by omega : 8 ≤ 10) i)) ∧
      (AlgebraCompletelyPositive A Phi → (c 0 ↔ c 9))) ∧
    (Substochastic A B Phi → (c 0 → c 1) ∧ (c 1 → c 2) ∧ (c 2 → c 3) ∧ (c 3 → c 7)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P12

end
Source
Quantum f-divergences and error correction, arXiv:1008.2529v6, PDF p. 33, Theorem 7.1 (abstract main result)
Read-back

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

Let I,JI,JI,J be finite nonempty index types with decidable equality, let A⊆MI(C)\mathcal A\subseteq M_I(\mathbb C)A⊆MI​(C), B⊆MJ(C)\mathcal B\subseteq M_J(\mathbb C)B⊆MJ​(C) be unital complex star subalgebras, and let Φ:MI(C)→MJ(C)\Phi:M_I(\mathbb C)\to M_J(\mathbb C)Φ:MI​(C)→MJ​(C) be complex linear, with Φ(Z)∈B\Phi(Z)\in\mathcal BΦ(Z)∈B for every ZZZ and Φ∗(W)∈A\Phi^*(W)\in\mathcal AΦ∗(W)∈A for every WWW, where Φ∗\Phi^*Φ∗ is the Hilbert–Schmidt adjoint. Let CCC be a nonempty set of positive semidefinite matrices in A\mathcal AA, each of real trace 111, and put H=conv⁡RC‾H=\overline{\operatorname{conv}_{\mathbb R}C}H=convR​C​. Use U≤VU\le VU≤V for positive semidefiniteness of V−UV-UV−U, tr⁡R=Re⁡Tr⁡\operatorname{tr}_{\mathbb R}=\operatorname{Re}\operatorname{Tr}trR​=ReTr, and Z[a]=cfc⁡(x↦0 if x=0, xa otherwise)(Z)Z^{[a]}=\operatorname{cfc}(x\mapsto 0\text{ if }x=0,\ x^a\text{ otherwise})(Z)Z[a]=cfc(x↦0 if x=0, xa otherwise)(Z), with sZ=Z[0]s_Z=Z^{[0]}sZ​=Z[0]. Say that XXX is supported by YYY when ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and that YYY covers CCC when this holds for every X∈CX\in CX∈C. For a real function fff, let spec⁡0Z\operatorname{spec}_0 Zspec0​Z be its distinct real eigenvalues if ZZZ is Hermitian, and the empty set otherwise; let PZ,aP_{Z,a}PZ,a​ be the orthogonal projection onto the aaa-eigenspace. Define

qf(X,Y)=Re⁡Tr⁡ ⁣[(Y[1/2])†∑a∈spec⁡0Xb∈spec⁡0Yf(a/b)PX,aY[1/2]PY,b],Df(X,Y)={qf(X,Y),ker⁡Y⊆ker⁡X,lim⁡ε↓0qf(X,Y+ε1),otherwise,Hr(X,Y)=sup⁡0≤a<1−ar−log⁡+tr⁡R(X[a]Y[1−a])1−a,Rσ,Φ(Z)=σ[1/2]Φ∗ ⁣(Φ(σ)[−1/2]ZΦ(σ)[−1/2])σ[1/2].\begin{aligned} q_f(X,Y)&=\operatorname{Re}\operatorname{Tr}\!\left[ (Y^{[1/2]})^\dagger \sum_{\substack{a\in\operatorname{spec}_0X\\b\in\operatorname{spec}_0Y}} f(a/b)P_{X,a}Y^{[1/2]}P_{Y,b}\right],\\ D_f(X,Y)&= \begin{cases} q_f(X,Y),&\ker Y\subseteq\ker X,\\ \displaystyle\lim_{\varepsilon\downarrow0}q_f(X,Y+\varepsilon1),&\text{otherwise}, \end{cases}\\ \mathcal H_r(X,Y)&=\sup_{0\le a<1} \frac{-ar-\log_+\operatorname{tr}_{\mathbb R}(X^{[a]}Y^{[1-a]})}{1-a},\\ \mathcal R_{\sigma,\Phi}(Z)&= \sigma^{[1/2]}\Phi^*\!\left(\Phi(\sigma)^{[-1/2]}Z\Phi(\sigma)^{[-1/2]}\right)\sigma^{[1/2]} . \end{aligned}qf​(X,Y)Df​(X,Y)Hr​(X,Y)Rσ,Φ​(Z)​=ReTr​(Y[1/2])†a∈spec0​Xb∈spec0​Y​∑​f(a/b)PX,a​Y[1/2]PY,b​​,=⎩⎨⎧​qf​(X,Y),ε↓0lim​qf​(X,Y+ε1),​kerY⊆kerX,otherwise,​=0≤a<1sup​1−a−ar−log+​trR​(X[a]Y[1−a])​,=σ[1/2]Φ∗(Φ(σ)[−1/2]ZΦ(σ)[−1/2])σ[1/2].​

Here DfD_fDf​ takes values in the extended reals, its displayed limit is the totalized limit used by the definition, a/0=0a/0=0a/0=0, and log⁡+u=log⁡u\log_+u=\log ulog+​u=logu for u>0u>0u>0 and −∞-\infty−∞ otherwise. Call fff a generator when it is continuous on (0,∞)(0,\infty)(0,∞) and f(x)/xf(x)/xf(x)/x, regarded as extended real, converges as x→∞x\to\inftyx→∞ to its totalized limit; call it operator convex here when, for every natural matrix size, positive semidefinite U,VU,VU,V, and t∈[0,1]t\in[0,1]t∈[0,1], f(tU+(1−t)V)≤tf(U)+(1−t)f(V)f(tU+(1-t)V)\le tf(U)+(1-t)f(V)f(tU+(1−t)V)≤tf(U)+(1−t)f(V) by functional calculus. To specify the richness condition below, replace f(0)f(0)f(0) by its totalized right limit to obtain fcf_cfc​, and select by Hilbert choice a measure μf\mu_fμf​ on (0,∞)(0,\infty)(0,∞) admitting some representation

fc(x)=fc(0)+ax+bx2+∫(0,∞)(x1+t−xx+t)dμf(t)(x≥0),f_c(x)=f_c(0)+ax+bx^2+ \int_{(0,\infty)} \left(\frac{x}{1+t}-\frac{x}{x+t}\right)d\mu_f(t) \quad(x\ge0),fc​(x)=fc​(0)+ax+bx2+∫(0,∞)​(1+tx​−x+tx​)dμf​(t)(x≥0),

with b≥0b\ge0b≥0, integrable (1+t)−2(1+t)^{-2}(1+t)−2, and an integrable displayed kernel for every x≥0x\ge0x≥0; the selection is arbitrary if no such measure exists. Say that fff is rich to order ddd when ∣supp⁡μf∣≥d|\operatorname{supp}\mu_f|\ge d∣suppμf​∣≥d in cardinality. A map Ψ\PsiΨ is stochastic from one concrete algebra to another when both it and its adjoint have their entire ranges in the respective target and source algebras, its adjoint is positive on the target algebra and satisfies the Schwarz inequality with constant 111, and Ψ\PsiΨ preserves the trace on the source algebra; “substochastic” omits that last requirement. A map is nnn-positive on a concrete algebra when its entrywise amplification preserves positive semidefiniteness of n×nn\times nn×n block matrices whose blocks belong to that algebra; complete positivity on the algebra means this for every natural nnn, including 000. Define the following ten conditions: c0c_0c0​: some stochastic Ψ:B→A\Psi:\mathcal B\to\mathcal AΨ:B→A, represented on the full matrix spaces, satisfies Ψ(Φ(ρ))=ρ\Psi(\Phi(\rho))=\rhoΨ(Φ(ρ))=ρ for every ρ∈H\rho\in Hρ∈H; c1c_1c1​: Df(Φ(ρ),Φ(σ))=Df(ρ,σ)D_f(\Phi(\rho),\Phi(\sigma))=D_f(\rho,\sigma)Df​(Φ(ρ),Φ(σ))=Df​(ρ,σ) for every generator fff that is operator convex in the stated sense and every ρ,σ∈H\rho,\sigma\in Hρ,σ∈H; c2c_2c2​: there exist a density matrix σ∈A\sigma\in\mathcal Aσ∈A covering CCC and such a generator fff, rich to order ∣I∣2+∣J∣2|I|^2+|J|^2∣I∣2+∣J∣2, for which that equality holds for every ρ∈C\rho\in Cρ∈C against σ\sigmaσ; c3c_3c3​: there exist a density matrix σ∈A\sigma\in\mathcal Aσ∈A covering CCC and T⊆(0,∞)T\subseteq(0,\infty)T⊆(0,∞), with ∣T∣≥∣I∣2+∣J∣2|T|\ge |I|^2+|J|^2∣T∣≥∣I∣2+∣J∣2, such that Dft(Φ(ρ),Φ(σ))=Dft(ρ,σ)D_{f_t}(\Phi(\rho),\Phi(\sigma))=D_{f_t}(\rho,\sigma)Dft​​(Φ(ρ),Φ(σ))=Dft​​(ρ,σ) for every ρ∈C,t∈T\rho\in C,t\in Tρ∈C,t∈T, where ft(x)=−x/(x+t)f_t(x)=-x/(x+t)ft​(x)=−x/(x+t); c4c_4c4​: Hr(Φ(ρ),Φ(σ))=Hr(ρ,σ)\mathcal H_r(\Phi(\rho),\Phi(\sigma))=\mathcal H_r(\rho,\sigma)Hr​(Φ(ρ),Φ(σ))=Hr​(ρ,σ) for every ρ,σ∈H,r∈R\rho,\sigma\in H,r\in\mathbb Rρ,σ∈H,r∈R; c5c_5c5​: some density matrix σ∈A\sigma\in\mathcal Aσ∈A covering CCC and some δ>0\delta>0δ>0 give this equality for every ρ∈C\rho\in Cρ∈C and 0<r<δ0<r<\delta0<r<δ; c6c_6c6​: Rσ,Φ(Φ(ρ))=ρ\mathcal R_{\sigma,\Phi}(\Phi(\rho))=\rhoRσ,Φ​(Φ(ρ))=ρ whenever ρ,σ∈H\rho,\sigma\in Hρ,σ∈H and

ker⁡σ=⋂τ∈Cker⁡τ;\ker\sigma=\bigcap_{\tau\in C}\ker\tau;kerσ=τ∈C⋂​kerτ;

c7c_7c7​: some density matrix σ∈A\sigma\in\mathcal Aσ∈A satisfies Rσ,Φ(Φ(ρ))=ρ\mathcal R_{\sigma,\Phi}(\Phi(\rho))=\rhoRσ,Φ​(Φ(ρ))=ρ for every ρ∈C\rho\in Cρ∈C, without an additional covering requirement; c8c_8c8​: there exist finitely many blocks, possibly zero blocks, with positive integer dimensions ℓ1k,r1k,ℓ2k,r2k\ell_{1k},r_{1k},\ell_{2k},r_{2k}ℓ1k​,r1k​,ℓ2k​,r2k​, isometries E1k:Cℓ1k⊗Cr1k→CIE_{1k}:\mathbb C^{\ell_{1k}}\otimes\mathbb C^{r_{1k}}\to\mathbb C^IE1k​:Cℓ1k​⊗Cr1k​→CI and E2k:Cℓ2k⊗Cr2k→CJE_{2k}:\mathbb C^{\ell_{2k}}\otimes\mathbb C^{r_{2k}}\to\mathbb C^JE2k​:Cℓ2k​⊗Cr2k​→CJ, orthogonal ranges within each family, positive definite trace-one matrices η1k,η2k\eta_{1k},\eta_{2k}η1k​,η2k​ on the right factors, and two-sided unitaries Uk:Cℓ1k→Cℓ2kU_k:\mathbb C^{\ell_{1k}}\to\mathbb C^{\ell_{2k}}Uk​:Cℓ1k​→Cℓ2k​, such that ∑kE1kE1k†\sum_kE_{1k}E_{1k}^\dagger∑k​E1k​E1k†​ has kernel ⋂ρ∈Cker⁡ρ\bigcap_{\rho\in C}\ker\rho⋂ρ∈C​kerρ, ∑kE2kE2k†\sum_kE_{2k}E_{2k}^\dagger∑k​E2k​E2k†​ has kernel ⋂ρ∈Cker⁡Φ(ρ)\bigcap_{\rho\in C}\ker\Phi(\rho)⋂ρ∈C​kerΦ(ρ), every ρ∈C\rho\in Cρ∈C can be written

ρ=∑kpkE1k(Xk⊗η1k)E1k†\rho=\sum_k p_kE_{1k}(X_k\otimes\eta_{1k})E_{1k}^\daggerρ=k∑​pk​E1k​(Xk​⊗η1k​)E1k†​

with pk≥0,∑kpk=1p_k\ge0,\sum_kp_k=1pk​≥0,∑k​pk​=1 and positive semidefinite trace-one XkX_kXk​, and, for every block kkk and every complex matrix XXX of size ℓ1k\ell_{1k}ℓ1k​, the input block belongs to A\mathcal AA and

Φ ⁣(E1k(X⊗η1k)E1k†)=E2k(UkXUk†⊗η2k)E2k†;\Phi\!\left(E_{1k}(X\otimes\eta_{1k})E_{1k}^\dagger\right) =E_{2k}(U_kXU_k^\dagger\otimes\eta_{2k})E_{2k}^\dagger;Φ(E1k​(X⊗η1k​)E1k†​)=E2k​(Uk​XUk†​⊗η2k​)E2k†​;

c9c_9c9​: some density matrix σ∈A\sigma\in\mathcal Aσ∈A covering CCC satisfies, for every ρ∈C\rho\in Cρ∈C, 0<p<10<p<10<p<1, and natural nnn,

Bp ⁣(Φ⊗n(ρ⊗n),Φ⊗n(σ⊗n))=Bp(ρ⊗n,σ⊗n),Bp(U,V)=−log⁡+1−∥pU−(1−p)V∥12min⁡(p,1−p).B_p\!\left(\Phi^{\otimes n}(\rho^{\otimes n}), \Phi^{\otimes n}(\sigma^{\otimes n})\right) =B_p(\rho^{\otimes n},\sigma^{\otimes n}), \quad B_p(U,V)=-\log_+\frac{1-\|pU-(1-p)V\|_1}{2\min(p,1-p)} .Bp​(Φ⊗n(ρ⊗n),Φ⊗n(σ⊗n))=Bp​(ρ⊗n,σ⊗n),Bp​(U,V)=−log+​2min(p,1−p)1−∥pU−(1−p)V∥1​​.

Here tensor powers have entries given by products of the component entries, the tensor map is the linear extension of its action on elementary tensor matrices, ∥Z∥1=Re⁡Tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{Z^\dagger Z}∥Z∥1​=ReTrZ†Z​, and n=0n=0n=0 uses the empty product. The theorem asserts that, if Φ\PhiΦ preserves traces on A\mathcal AA and is 222-positive on A\mathcal AA, then ci↔c0c_i\leftrightarrow c_0ci​↔c0​ for every i=0,…,8i=0,\ldots,8i=0,…,8; c0c_0c0​ implies that, for every natural nnn for which Φ\PhiΦ is nnn-positive on A\mathcal AA, there is a stochastic recovery map that is nnn-positive on B\mathcal BB and recovers every state in HHH, and complete positivity of Φ\PhiΦ on A\mathcal AA gives such a completely positive recovery map; c9c_9c9​ implies every cic_ici​ for i=0,…,7i=0,\ldots,7i=0,…,7; and complete positivity of Φ\PhiΦ on A\mathcal AA additionally gives c0↔c9c_0\leftrightarrow c_9c0​↔c9​. Separately, if Φ\PhiΦ is substochastic, then c0⇒c1c_0\Rightarrow c_1c0​⇒c1​, c1⇒c2c_1\Rightarrow c_2c1​⇒c2​, c2⇒c3c_2\Rightarrow c_3c2​⇒c3​, and c3⇒c7c_3\Rightarrow c_7c3​⇒c7​.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me