Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 — Statistical recovery of the complete orbit label

Open
ZLIPPadding.Padding.Supplement.orbit_label_recovery

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

computational-complexitylattice-algorithmsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let n≥2n\ge2n≥2, integer m≥1m\ge1m≥1, L≅ZnL\cong\mathbb Z^nL≅Zn, and suppose the nonempty uniform shell has ∣κ∣≥κ0>0|\kappa|\ge\kappa_0>0∣κ∣≥κ0​>0. For a prescribed x=∑iaivi∈Sm(L)x=\sum_i a_iv_i\in S_m(L)x=∑i​ai​vi​∈Sm​(L) and every 0<η<10<\eta<10<η<1, a uniform executable algorithm returns the multiset {a12,…,an2}\{a_1^2,\ldots,a_n^2\}{a12​,…,an2​} with probability at least 1−η1-\eta1−η. It uses two independent batches of positive integer sizes satisfying

N4≥max⁡ ⁣{2,1024m10cn2κ04log⁡4η},Nx≥512m6κ02log⁡4nη,cn=n(n−1)n+2.N_4\ge\max\!\left\{2,\frac{1024m^{10}}{c_n^2\kappa_0^4}\log\frac4\eta\right\},\qquad N_x\ge\frac{512m^6}{\kappa_0^2}\log\frac{4n}{\eta},\quad c_n=\frac{n(n-1)}{n+2}.N4​≥max{2,cn2​κ04​1024m10​logη4​},Nx​≥κ02​512m6​logη4n​,cn​=n+2n(n−1)​.

The sign is determined by exact shell counting with O(nm3/2)O(nm^{3/2})O(nm3/2) integer operations. Remaining computation is polynomial in n,m,κ0−1,log⁡(1/η)n,m,\kappa_0^{-1},\log(1/\eta)n,m,κ0−1​,log(1/η) and input and sample representation lengths. The numerical contract uses all ordered eigenvalues to error at most 1/81/81/8, with multiplicities and zeros, and reports failure at zero estimated contrast. The hidden basis and true label are never inputs. This is a companion theorem to the padding goal.

Differences from the source:

  • encoding: a randomized algorithm consuming two independent batches → a deterministic finite program on the two supplied batches, then its law under independent iid batches; reason: all randomness is in the oracle samples; exact rational encoding and spectral rounding recover the identical multiset
Preamble
import Definitions.Def_ZLIPPadding_Padding_Supplement_Reductions
Formal statement
namespace ZLIPPadding.Padding.Supplement
open scoped BigOperators ENNReal

theorem orbit_label_recovery :
    ∃ (P : Program) (c d C : ℕ), LabelProgram P c d ∧ 0 < C ∧
      (∀ n m, 2 ≤ n → 1 ≤ m →
        ((countLog n m).operations : ℝ) ≤ (C : ℝ)*n*m*Real.sqrt m) ∧
      ∀ (n m : ℕ) (μ : PMF (ZVec n)) (kap0 : ℝ), 2 ≤ n → 1 ≤ m →
        UniformOn μ (shell n m) → 0 < kap0 → kap0 ≤ |shellKappa n m| →
        LabelGuarantee P c d false n m μ kap0 := by sorry

end ZLIPPadding.Padding.Supplement
Source
Shengmao Jiang, STOC 2027 submission #496 (October 2026), printed p. 16 (PDF p. 17), Theorem 4.1

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