introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.55 kB
import Mathlib
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory
namespace RandomKSAT
abbrev Assignment (n : β„•) := Fin n β†’ Bool
def Clause (n k : β„•) :=
(s : {s : Finset (Fin n) // s.card = k}) Γ— (s.1 β†’ Bool)
instance clauseFintype (n k : β„•) : Fintype (Clause n k) := by
classical
unfold Clause
infer_instance
instance clauseMeasurableSpace (n k : β„•) : MeasurableSpace (Clause n k) := ⊀
instance clauseMeasurableSingletonClass (n k : β„•) :
MeasurableSingletonClass (Clause n k) := ⟨fun _ => trivial⟩
def Satisfies {n k : β„•} (c : Clause n k) (a : Assignment n) : Prop :=
βˆƒ v : c.1.1, a v = c.2 v
abbrev Stream (n k : β„•) := β„• β†’ Clause n k
def clauseLaw (n k : β„•) : Measure (Clause n k) := uniformOn Set.univ
def streamLaw (n k : β„•) : Measure (Stream n k) :=
Measure.infinitePi (fun _ : β„• => clauseLaw n k)
def PrefixSAT {n k : β„•} (Ο‰ : Stream n k) (m : β„•) : Prop :=
βˆƒ a : Assignment n, βˆ€ i < m, Satisfies (Ο‰ i) a
def firstFailure {n k : β„•} (Ο‰ : Stream n k) : β„•βˆž :=
sInf ((fun m : β„• => (m : β„•βˆž)) '' {m | Β¬ PrefixSAT Ο‰ m})
def H {n k : β„•} (Ο‰ : Stream n k) : ℝ := (firstFailure Ο‰).toNat
def cap (n : β„•) (B : ℝ) : β„• := ⌊B * nβŒ‹β‚Š
def T {n k : β„•} (B : ℝ) (Ο‰ : Stream n k) : ℝ :=
(min (firstFailure Ο‰) (cap n B : β„•βˆž)).toNat
def ell (k n : β„•) : ℝ :=
if k = 3 then Real.log (Real.exp 1 * n) else 1
def U (k : β„•) : ℝ := Real.log 2 / (-Real.log (1 - ((2 : ℝ) ^ k)⁻¹))
end RandomKSAT
end
end OAI