AFTD Auto-Formalizing Theoretical Domains

thermomajorization_full_budget_zero_error

theoremverifiedformalization

For any natural number n with 1 ≤ n, measuring all n - 1 binary probes gives zero minimax missed error: thermomajorization_minimax_error n (n - 1) = 0.

Statement

theorem thermomajorization_full_budget_zero_error (n : ℕ) (hn : 1 ≤ n) : thermomajorization_minimax_error n (n - 1) = 0
Formalizes
arXiv:2610.35433, Corollary 2
Verified
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
  • thermomajorization_minimax_errorFor dimension n and budget m : ℕ, the minimax missed error thermomajorization_minimax_error n m is the infimum of…
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • thermomajorization_missed_errorFor dimension n and probe set F : Finset ℕ, thermomajorization_missed_error n F is the supremum over all nonincreasing probability vectors…
  • thermomajorization_probe_errorFor population vectors x, y : Fin n → ℝ and a finite set of probe ranks F : Finset ℕ, the detected conversion error…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.

Read back from the Lean

For every natural number $n \ge 1$, the thermomajorization minimax error with budget $n - 1$, denoted thermomajorization_minimax_error n (n - 1), is equal to $0$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Full probe budget of n - 1 ranks achieves zero missed thermomajorization error. -/
theorem thermomajorization_full_budget_zero_error (n : ℕ) (hn : 1 ≤ n) : thermomajorization_minimax_error n (n - 1) = 0 := by
  have hmiss : thermomajorization_missed_error n (Finset.Ioo 0 n) = 0 := by
    unfold thermomajorization_missed_error
    simp only [sub_self]
    simp
  unfold thermomajorization_minimax_error
  have hcard : (Finset.Ioo 0 n).card = n - 1 := by simp
  rw [← hcard, Finset.powersetCard_self]
  simp only [Finset.mem_singleton]
  have key : ∀ F, (⨅ (_ : F = Finset.Ioo 0 n), thermomajorization_missed_error n F) = 0 := by
    intro F
    by_cases hF : F = Finset.Ioo 0 n
    · subst hF
      rw [ciInf_subsingleton rfl]
      exact hmiss
    · haveI : IsEmpty (F = Finset.Ioo 0 n) := ⟨fun h => hF h⟩
      rw [iInf_of_isEmpty]
      exact Real.sInf_empty
  simp_rw [key]
  exact ciInf_const
See it in the graphDiscuss this resultChallenge it