dephased_path_local_noise_criterion
def
For n : ℕ and q : Fin n → ℝ, dephased_path_local_noise_criterion n q holds if for every natural number i with 1 ≤ i and i + 1 < n, q ⟨i, by omega⟩ ≥ q ⟨i - 1, by omega⟩ * q ⟨i + 1, by omega⟩.
Statement
def dephased_path_local_noise_criterion (n : ℕ) (q : Fin n → ℝ) : Prop
- Defined in
- arXiv:2511.19585, Monogamy of Mutual Information in Graph States
- Verified
- 02 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a natural number n and a sequence q : Fin n → ℝ, the predicate dephased_path_local_noise_criterion n q asserts that for every natural number i such that 1 ≤ i and i + 1 < n, q(i) ≥ q(i - 1) * q(i + 1).
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
/-- Local noise criterion q_i >= q_{i-1} * q_{i+1} for all 1 <= i <= n-2 on a path of length n. -/ def dephased_path_local_noise_criterion (n : ℕ) (q : Fin n → ℝ) : Prop := ∀ (i : ℕ) (h1 : 1 ≤ i) (h2 : i + 1 < n), q ⟨i, by omega⟩ ≥ q ⟨i - 1, by omega⟩ * q ⟨i + 1, by omega⟩