Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — symmetric dimension ratio

Proved
MixedCloning.Optimal.lemma_6

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-cloningsample-complexity

For integers n,d≥1n,d\ge1n,d≥1 and k≥0k\ge0k≥0, write d[j]=(j+d−1j)d[j]=\binom{j+d-1}{j}d[j]=(jj+d−1​) for the dimension of the symmetric jjj-tensor subspace of Cd\mathbb C^dCd. Then

d[n]d[n+k]≥1−kdn.\frac{d[n]}{d[n+k]}\ge1-\frac{kd}{n}.d[n+k]d[n]​≥1−nkd​.

This controls the loss of global pure-state fidelity when the number of copies is increased by kkk.

Differences from the source: none.

Preamble
import Definitions.Def_MixedCloning_Optimal_Schur

noncomputable section
open Matrix MeasureTheory
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
Formal statement
namespace MixedCloning.Optimal
attribute [local instance] Classical.propDecidable Classical.decEq

theorem lemma_6 (n d k : ℕ) (hn : 1 ≤ n) (hd : 1 ≤ d) :
    1 - (k : ℝ)*d/n ≤ (symDimension d n : ℝ) / symDimension d (n+k) := by sorry

end MixedCloning.Optimal
Source
Dmitry Grinko, Marco Fanizza, Thilo Scharnhorst, Jack Spilecki, Optimal cloning of mixed states, STOC 2027 submission #243 (October 2026), p. 11, Lemma 6
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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