File size: 1,553 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 | 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
|