OAI/Probability/DilutedSpin/TreeMarkLaw.lean
12 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.DilutedSpinGlass.PrescribedTree.Edgeline 12Source documentation
Every nonroot vertex is retained, including unary vertices.
def Edge : {n : ℕ} → PrescribedTree n → Type | 0, .leaf => Empty | _+1, .node _ C => (i : _) × Option (Edge (C i))Mentions: OAI.DilutedSpinGlass.PrescribedTree
- instance
OAI.DilutedSpinGlass.PrescribedTree.edgeFintypeline 16 - def
OAI.DilutedSpinGlass.PrescribedTree.edgeDepthline 22 - def
OAI.DilutedSpinGlass.PrescribedTree.vertexValuesline 33 - def
OAI.DilutedSpinGlass.PrescribedTree.ofVertexValuesline 42 - lemma
OAI.DilutedSpinGlass.PrescribedTree.vertexValues_ofline 46 - lemma
OAI.DilutedSpinGlass.PrescribedTree.of_vertexValuesline 56 - def
OAI.DilutedSpinGlass.PrescribedTree.vertexEquivline 65 - lemma
OAI.DilutedSpinGlass.PrescribedTree.sampleLaw_markPrior_weightline 77Source documentation
Under the genuine independent mark prior, vertex marks have the product law at their actual depths. This is a law statement, not a coupling assumption.
lemma sampleLaw_markPrior_weight {n : ℕ} (S : PrescribedTree n) (Q : Fin n → FiniteLaw Ω) (x : Sample Ω S) : (S.sampleLaw (markPrior n Q)).weight x = ∏ e : Edge S, (Q (edgeDepth S e)).weight (vertexValues S x e) := by …Mentions: OAI.DilutedSpinGlass.PrescribedTree, OAI.DilutedSpinGlass.FiniteLaw, OAI.DilutedSpinGlass.PrescribedTree.Sample, OAI.DilutedSpinGlass.markPrior, OAI.DilutedSpinGlass.PrescribedTree.Edge, OAI.DilutedSpinGlass.PrescribedTree.edgeDepth, OAI.DilutedSpinGlass.PrescribedTree.vertexValues
- lemma
OAI.DilutedSpinGlass.PrescribedTree.expect_markPriorline 97 - theorem
OAI.DilutedSpinGlass.PrescribedTree.freshEval_constline 120 - theorem
OAI.DilutedSpinGlass.PrescribedTree.grow_projectivityline 132Source documentation
Deleting a newly sampled branch preserves the joint law of ALL old paths. The old test may be arbitrarily correlated with any retained old prefixes.
theorem grow_projectivity {n : ℕ} (S : PrescribedTree n) (K : KernelTower Ω n) (v : Internal S) (H : Sample Ω S → ℝ) : (sampleLaw (grow S v) K).expect (fun x => H (oldSample S v x)) = (sampleLaw S K).expect H := by …Mentions: OAI.DilutedSpinGlass.PrescribedTree, OAI.DilutedSpinGlass.KernelTower, OAI.DilutedSpinGlass.PrescribedTree.Internal, OAI.DilutedSpinGlass.PrescribedTree.Sample, OAI.DilutedSpinGlass.PrescribedTree.sampleLaw, OAI.DilutedSpinGlass.PrescribedTree.grow, OAI.DilutedSpinGlass.PrescribedTree.oldSample