OAI/Analysis/TreePotential/StartMass.lean
23 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.BoundedTreePotentials.Segments.startArrayline 15Source documentation
Start masses indexed by the literal (component,prefix) array. There is one entry per actual segment, not one entry per path or per chain.
def startArray (w : Segment → ℝ≥0∞) (n : ℕ) (s : List ℕ) : ℝ≥0∞ := …
- lemma
OAI.BoundedTreePotentials.Segments.startArray_monoline 18 - lemma
OAI.BoundedTreePotentials.Segments.startArray_addline 26 - lemma
OAI.BoundedTreePotentials.Segments.startArray_mulline 35 - lemma
OAI.BoundedTreePotentials.Segments.startArray_tsumline 40 - lemma
OAI.BoundedTreePotentials.Segments.startArray_zeroline 50 - lemma
OAI.BoundedTreePotentials.Segments.forest_treeSum_startArrayline 52 - lemma
OAI.BoundedTreePotentials.Segments.representation_test_energyline 82 - def
OAI.BoundedTreePotentials.Segments.representationCostline 99Source documentation
The start cost of a signed segment representation.
def representationCost (a : Segment → ℝ) : ℝ≥0∞ := …
- lemma
OAI.BoundedTreePotentials.Segments.representationCost_addline 102 - lemma
OAI.BoundedTreePotentials.Segments.representationCost_smulline 114 - lemma
OAI.BoundedTreePotentials.Segments.representationCost_zeroline 119 - lemma
OAI.BoundedTreePotentials.Segments.startArray_nonzeroline 128 - def
OAI.BoundedTreePotentials.Segments.Atom.representationline 141 - lemma
OAI.BoundedTreePotentials.Segments.Atom.representation_applyline 143 - lemma
OAI.BoundedTreePotentials.Segments.Atom.start_injectiveline 147 - lemma
OAI.BoundedTreePotentials.Segments.Atom.mass_antichainline 152 - lemma
OAI.BoundedTreePotentials.Segments.Atom.mass_at_startline 169 - lemma
OAI.BoundedTreePotentials.Segments.Atom.representation_costline 190 - lemma
OAI.BoundedTreePotentials.Segments.representation_finite_energyline 217 - lemma
OAI.BoundedTreePotentials.Segments.real_series_boundline 249 - lemma
OAI.BoundedTreePotentials.Segments.representation_series_boundline 263 - def
OAI.BoundedTreePotentials.Segments.representationPairingline 272Source documentation
The absolutely convergent countable representation pairing on finitely supported tests.
def representationPairing (a : Segment → ℝ) (ha : representationCost a≠∞) : (Node →₀ ℝ) →ₗ[ℝ] ℝ where …
Mentions: OAI.BoundedTreePotentials.Segments.Segment, OAI.BoundedTreePotentials.Segments.representationCost, OAI.BoundedTreePotentials.Segments.Node