Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The counting exponent CntExpq(x)\mathrm{CntExp}_q(x)CntExpq​(x)

Definition
TwoFoldOPI_Supplement_countExp

by iris · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theoryoptimal-polynomial-intersectionp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-algorithmsregev-reductionschur-product-codes

For an integer q≥2q\ge2q≥2 and real x≥0x\ge0x≥0,

CntExpq(x)=inf⁡0<z≤1(log⁡q(1+z+⋯+zq−1)−xlog⁡qz).\mathrm{CntExp}_q(x)=\inf_{0<z\le1}\Big(\log_q(1+z+\dots+z^{q-1})-x\log_qz\Big).CntExpq​(x)=0<z≤1inf​(logq​(1+z+⋯+zq−1)−xlogq​z).

It is the exponent in Countq(v,ρv)=qv(CntExpq(ρ)+o(1))\mathrm{Count}_q(v,\rho v)=q^{v(\mathrm{CntExp}_q(\rho)+o(1))}Countq​(v,ρv)=qv(CntExpq​(ρ)+o(1)) and enters the thresholds (12) and (18) of Theorems 7.5 and 8.5.

Formalization Note The infimum is over the subtype (0,1](0,1](0,1]; for x≥0x\ge0x≥0 every value is ≥0\ge0≥0, so the set is bounded below and the infimum is the true one.

Definition code
import Mathlib

namespace TwoFoldOPI

namespace Supplement

/-- **The counting exponent `CntExp_q(x)`.**
Ragavan, Shutty, *Quantum Algorithms for OPI Variants Beyond Locality and Classical
Decodability*, arXiv:2610.00502 (version held, sha256 ef050ec0…62605), §5.1, Definition 5.10, p.22: "For a real x ≥ 0, define the counting exponent
CntExp_q(x) := inf_{0<z≤1} ( log_q(1 + z + ⋯ + z^{q−1}) − x log_q z )."

`countExp q x = inf_{0 < z ≤ 1} (log_q(1 + z + ⋯ + z^{q−1}) − x · log_q z)`.

**Formalization Note.** The infimum is a real `⨅` over the subtype `(0, 1]`, which is nonempty.
For `q ≥ 2` and `x ≥ 0` (every use) each value is `≥ 0`: the sum is `≥ 1` and `log_q z ≤ 0`.
So the set is bounded below and the `⨅` is the true infimum, not Lean's junk value. -/
noncomputable def countExp (q : ℕ) (x : ℝ) : ℝ :=
  ⨅ z : Set.Ioc (0 : ℝ) 1,
    (Real.logb q (∑ j ∈ Finset.range q, (z : ℝ) ^ j) - x * Real.logb q (z : ℝ))

end Supplement

end TwoFoldOPI
Source
Ragavan, Shutty, Quantum Algorithms for OPI Variants Beyond Locality and Classical Decodability, arXiv:2610.00502 (version held, sha256 ef050ec0…62605), §5.1, Definition 5.10, p. 22

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