Leading asymptotics of the explicit crossing-root dimension product
ProvedCloning.YoungDimensionRatio.normalized_dimensionRatio_tendsto_oneasymptotic-analysismixed-state-cloning-v1weyl-dimension-product
Let be nonnegative integers with , and let and . Assume for every n, , , and for every n and i<r. For and ,
This is supporting analytic asymptotics for the explicit finite product. It does not identify that product with representation dimensions or prove the complete mixed-state cloning theorem.
This is supporting analytic material for the paper.
Withdrawn from active publication at the submitter’s request. No replacement is being published.
Preamble
import Definitions.Def_Cloning_YoungDimensionRatio import Mathlib.Analysis.SpecialFunctions.Log.Summable import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Sqrt import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring /-! # Concrete asymptotics of the crossing-root Weyl dimension product For an `r`-row label in ambient dimension `r+k`, the manuscript's explicit dimension-ratio expression is the product of `(rowᵢ+j-i)/(j-i)` over crossing roots. This file defines that actual finite product and derives its uniform relative-error bound directly from the row lengths. No dimension-ratio convergence or product approximation is assumed. The identification of this explicit Weyl product with dimensions of the particular representation spaces is a separate representation-theoretic statement. This file proves the analytic input once that formula is used. -/ open scoped BigOperators Topology open Filter open Cloning.YoungDimensionRatio
Formal statement
theorem Cloning.YoungDimensionRatio.normalized_dimensionRatio_tendsto_one (r k : ℕ) (hr : 0 < r)
(row : ℕ → Fin r → ℝ) (N δ : ℕ → ℝ)
(hNpos : ∀ n, 0 < N n) (hN : Tendsto N atTop atTop)
(hδ : Tendsto δ atTop (𝓝 0))
(hclose : ∀ n i, |row n i / N n - 1 / (r : ℝ)| ≤ δ n) :
Tendsto (fun n => dimensionRatio r k (row n) /
(leadingConstant r k * (N n) ^ (r * k))) atTop (𝓝 1) := by sorry
Source