Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 22: lemma 22

Proved
QAlgorithms.Papers.Independent.Bridge50.P50.lemma_22

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let (Θn)n≥1(\Theta_n)_{n\ge1}(Θn​)n≥1​ be decreasing compact sets in a metric space with nonempty intersection Θ∞\Theta_\inftyΘ∞​. Let f:Θ1→Rf:\Theta_1\to\mathbb Rf:Θ1​→R be continuous and bounded. Then

lim⁡n→∞inf⁡x∈Θnf(x)=inf⁡x∈Θ∞f(x).\lim_{n\to\infty}\inf_{x\in\Theta_n}f(x)=\inf_{x\in\Theta_\infty}f(x).n→∞lim​x∈Θn​inf​f(x)=x∈Θ∞​inf​f(x).

All feasible sets are nonempty compact, so these are finite attained infima. No global continuous extension of fff is assumed.

This gives continuity of nested constrained extrema. Formalization Note The first set has Lean index zero.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P50
Formal statement
noncomputable section

open scoped Topology BigOperators ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator

open MeasureTheory Filter Set

namespace QAlgorithms.Papers.Independent.Bridge50.P50

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact accepted primitives; these names do not create local declarations.

open QAlgorithms.Papers.Independent.Information100.P63 (Mat logTwo testingBeta normalCDF normalQuantile)

open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble ensembleAverage)

open QAlgorithms.Papers.Independent.Information100.P69 (entropy)

open QAlgorithms.Papers.Independent.Dependency50.P35 (Dominates)

open QAlgorithms.Papers.Independent.Dependency50.P36 (pairInformationVariance)

open QAlgorithms (vnEntropy traceDistance minEigenvalue)

attribute [local instance] QAlgorithms.Papers.Independent.Bridge50.P50.matrixBorelMeasurable

attribute [local instance] QAlgorithms.Papers.Independent.Bridge50.P50.matrixBorelSpace

/-- Lemma 22, PDF pp.22,30–31: f is continuous and bounded only on Theta_1.
The intersection hypothesis ensures all these finite infima are genuine minima. -/
theorem lemma_22 {X : Type*} [MetricSpace X]
    (Theta : ℕ → Set X) (hc : ∀ n, IsCompact (Theta n)) (hn : Antitone Theta)
    (hi : (⋂ n, Theta n).Nonempty) (f : Theta 0 → ℝ) (hf : Continuous f)
    (hb : ∃ C : ℝ, ∀ x, |f x| ≤ C) :
    Tendsto (fun n => restrictedInf Theta f (Theta n)) atTop
      (𝓝 (restrictedInf Theta f (⋂ n, Theta n))) := by sorry

end QAlgorithms.Papers.Independent.Bridge50.P50

end
Source
Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels, arXiv:1308.6503v3, PDF p. 22, Lemma 22
Read-back

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

Let XXX be any metric space, and let (Θn)n≥0(\Theta_n)_{n\ge0}(Θn​)n≥0​ be compact subsets of XXX such that Θm⊆Θn\Theta_m\subseteq\Theta_nΘm​⊆Θn​ whenever n≤mn\le mn≤m, with ⋂n≥0Θn≠∅\bigcap_{n\ge0}\Theta_n\ne\varnothing⋂n≥0​Θn​=∅. Let f:Θ0→Rf:\Theta_0\to\mathbb Rf:Θ0​→R be continuous for the subspace topology, and suppose there exists a real CCC such that ∣f(x)∣≤C|f(x)|\le C∣f(x)∣≤C for every x∈Θ0x\in\Theta_0x∈Θ0​. For any subset A⊆XA\subseteq XA⊆X, write

m(A)=inf⁡{f(x):x∈Θ0, x∈A},m(A)=\inf\{f(x):x\in\Theta_0,\ x\in A\},m(A)=inf{f(x):x∈Θ0​, x∈A},

where membership in AAA refers to the underlying point of XXX. Then m(Θn)m(\Theta_n)m(Θn​) converges, as n→∞n\to\inftyn→∞, to m(⋂n≥0Θn)m(\bigcap_{n\ge0}\Theta_n)m(⋂n≥0​Θn​). The sequence includes n=0n=0n=0; the nonempty-intersection hypothesis makes all these restricted indexing sets nonempty.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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