AFTD Auto-Formalizing Theoretical Domains

biased_bit_non_tie

def

For a bias parameter p : ℝ, biased_bit_non_tie p is the proposition that for all natural numbers j and k with 1 ≤ j and j < k, 2 * a ^ j ≠ 1 + a ^ k, where a = (1 - p) / p.

Statement

def biased_bit_non_tie (p : ℝ) : Prop
Defined in
arXiv:2611.16066 Cor 5.9
Verified
16 Nov 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a real number $p$, define $a = (1 - p) / p$. The declaration asserts that for all natural numbers $j$ and $k$, if $1 \le j$ and $j < k$, then $2 a^j \ne 1 + a^k$.

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

/-- Predicate asserting that the likelihood ratio a = (1 - p) / p satisfies the non-tie condition 2 * a^j ≠ 1 + a^k for all 1 ≤ j < k. -/
def biased_bit_non_tie (p : ℝ) : Prop := let a := (1 - p) / p
  ∀ (j k : ℕ), 1 ≤ j → j < k → 2 * a ^ j ≠ 1 + a ^ k
See it in the graphDiscuss this resultChallenge it