Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Optical cut weights differ by at most a factor of two

Proved
QAlgorithms.Papers.Independent.Intakenext100.P84.optical_cut_factor_two

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

prove2quantum

Fix a cut of a finite quantum network, and let CCC denote its labelled crossing edges in both directions. For each e∈Ce\in Ce∈C, let fe≥0f_e\ge0fe​≥0 be its frequency and let 0≤ηe<10\le\eta_e<10≤ηe​<1 be its intensity transmittance. Then

∑e∈Cfelog⁡2 ⁣(1+ηe1−ηe)≤2∑e∈Cfelog⁡2 ⁣(11−ηe).\sum_{e\in C} f_e\log_2\!\left(\frac{1+\eta_e}{1-\eta_e}\right) \le 2\sum_{e\in C} f_e\log_2\!\left(\frac{1}{1-\eta_e}\right).e∈C∑​fe​log2​(1−ηe​1+ηe​​)≤2e∈C∑​fe​log2​(1−ηe​1​).

The inequality compares the two explicit optical cut weights uniformly over the cut, network topology, and frequencies. It remains valid for an empty cut or zero transmittances. Frequencies restricted to one cut need not sum to one.

Formalization Note The finite index type in Lean is precisely the set of crossing-edge labels. The inequality uses explicit real logarithms, rather than a ratio of capacities at zero transmittance.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P84
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P84

open QAlgorithms

open scoped BigOperators

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.4, Eq.(13): the optical upper cut weight is at most twice the
achievable cut weight. `E` indexes just the crossing edges of the fixed cut;
parallel and oppositely directed links retain separate labels. No positivity
of the cut weight or normalization of its restricted frequencies is required. -/
theorem optical_cut_factor_two {E : Type*} [Fintype E]
    (frequency eta : E → ℝ)
    (hfrequency : ∀ e, 0 ≤ frequency e)
    (heta : ∀ e, 0 ≤ eta e ∧ eta e < 1) :
    (∑ e, frequency e * Real.logb 2 ((1 + eta e) / (1 - eta e))) ≤
      2 * ∑ e, frequency e * Real.logb 2 (1 / (1 - eta e)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P84

end
Source
Aggregating quantum repeaters for the quantum internet, arXiv:1606.00135v1, PDF p. 4, Eq.(13)
Read-back

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

For every finite type EEE and every pair of real-valued functions f,η:E→Rf,\eta:E\to\mathbb Rf,η:E→R, assume fe≥0f_e\ge0fe​≥0 and 0≤ηe<10\le\eta_e<10≤ηe​<1 for every e∈Ee\in Ee∈E. Then

∑e∈Efelog⁡2 ⁣(1+ηe1−ηe)≤2∑e∈Efelog⁡2 ⁣(11−ηe).\sum_{e\in E} f_e\log_2\!\left(\frac{1+\eta_e}{1-\eta_e}\right) \le 2\sum_{e\in E} f_e\log_2\!\left(\frac{1}{1-\eta_e}\right).e∈E∑​fe​log2​(1−ηe​1+ηe​​)≤2e∈E∑​fe​log2​(1−ηe​1​).

Zero weights and values ηe=0\eta_e=0ηe​=0 are allowed; all logarithm arguments are positive under the hypotheses. If EEE is empty, both sums are zero.

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

    Confirmed by the moderator at approval.

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