AFTD Auto-Formalizing Theoretical Domains

biased_bit_critical_cost

def

For a bias parameter p : ℝ, biased_bit_critical_cost p is defined as the real infimum (sInf) of the set of values (l : ℝ) + a * (2 * a ^ l - 1) / (1 - a) for l : ℕ, where a = (1 - p) / p.

Statement

noncomputable def biased_bit_critical_cost (p : ℝ) : ℝ
Defined in
arXiv:2611.16066 Thm 5.4
Verified
16 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

biased_bit_critical_cost is a function of a real parameter p. Setting a = (1 - p) / p, it defines the cost as the real infimum (sInf) of the set of values (l : ℝ) + a * (2 * a ^ l - 1) / (1 - a) as l ranges over the natural numbers ℕ.

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

/-- Critical cost c_crit(p) for additive integer masks against a biased bit with parameter p. -/
noncomputable def biased_bit_critical_cost (p : ℝ) : ℝ := let a := (1 - p) / p
  sInf (Set.range fun (l : ℕ) => (l : ℝ) + a * (2 * a ^ l - 1) / (1 - a))
See it in the graphDiscuss this resultChallenge it