AFTD Auto-Formalizing Theoretical Domains

kuramoto_critical_coupling

def

The critical coupling K_H of a tree H under natural frequencies ω is the maximum over all edges e of the absolute sum of deviations (ω_v - ω_bar) over either connected component of H - e.

Statement

noncomputable def kuramoto_critical_coupling {V : Type*} [Fintype V] (H : SimpleGraph V) (ω : V → ℝ) : ℝ
Defined in
Dekker and Taylor (2013), Synchronization Properties of Trees in the Kuramoto Model, Thm 3
Verified
14 Nov 2026
Axioms
none listed
Used by 1
  • op_1710_kuramoto_coupling_iso_eqFor any two isomorphic graphs T and T' on a finite vertex set V, any probability measure μ on ℝ, and any threshold s, the probability that…

Read back from the Lean

Given a finite type V, a simple graph H on V, and a function ω : V → ℝ, kuramoto_critical_coupling H ω is defined as the supremum over all vertices u, v : V and proofs that u is adjacent to v in H of the absolute value of the sum over all w : V that are reachable from u in H with the edge {u, v} removed, of (ω w - mean), where mean is the average (∑ v : V, ω v) / Fintype.card V.

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

/-- The exact critical coupling for phase locking in the Kuramoto model on a tree H with frequencies ω. -/
noncomputable def kuramoto_critical_coupling {V : Type*} [Fintype V] (H : SimpleGraph V) (ω : V → ℝ) : ℝ := by
  classical
  let mean := (∑ v : V, ω v) / Fintype.card V
  exact ⨆ (u : V) (v : V) (_ : H.Adj u v),
    |∑ w : V, if (H.deleteEdges {s(u, v)}).Reachable u w then (ω w - mean) else 0|
See it in the graphDiscuss this resultChallenge it