OAI/Probability/InvariantIsing/Fields/SpinPriorRestrictedCap.lean

GitHub source file

4 declarations, 0 contain sorry, 0 declared as axioms

A fixed field cap for constrained contact objectives, uniform in the finite constraint and with its cube mass canceled.

  1. lemma OAI.InvariantIsing.constrainedBlockValue_le_fieldValue line 13
  2. lemma OAI.InvariantIsing.spinPriorRestrictedContactPressure_field_le line 25
  3. theorem OAI.InvariantIsing.spinPriorRestrictedContactObjective_cap_bound line 57

    Source documentation

    A coercive lower bound in the total nonnegative field increment.

    theorem spinPriorRestrictedContactObjective_cap_bound
        (hhaar : HaarConcentrationInput) (hgauss : GaussianLipschitzVarianceInput)
        {N m n : ℕ} (hN : 3 ≤ N)
        (μ : Measure (SpecialOrthogonal N)) [IsProbabilityMeasure μ] (hμ : μ.IsMulLeftInvariant)
        (C : Finset (Spin N)) (hC : C.Nonempty)
        (eig : Fin N → ℝ) (I : Fin m → Finset (Fin N)) (K : ℝ)
        (heig : ∀ i, |eig i| ≤ K)
        (cut : Fin (n + 2) → ℝ) (hc : StrictMono cut)
        (hfirst : cut 0 = 0) (hlast : cut (Fin.last (n + 1)) = 1)
        (trial : OverlapPath) (values : Fin (n + 1) → ℝ)
        (hvalues : ∀ i s, s ∈ Ioo (cut i.castSucc) (cut i.succ) → trial s = values i)
        (d : ℝ) (hd : 0 ≤ d) (htrial : ∀ᵐ s ∂pathMeasure, trial s ≤ 1 - d)
    …

    Mentions: OAI.InvariantIsing.HaarConcentrationInput, OAI.InvariantIsing.GaussianLipschitzVarianceInput, OAI.InvariantIsing.SpecialOrthogonal, OAI.InvariantIsing.Spin, OAI.InvariantIsing.OverlapPath

  4. theorem OAI.InvariantIsing.exists_spinPriorRestrictedContactObjective_cap line 102

    Source documentation

    One fixed cap works for every dimension and every allowed perturbation parameter. Thus a negative contact sublevel cannot touch its field face.

    theorem exists_spinPriorRestrictedContactObjective_cap
        (hhaar : HaarConcentrationInput) (hgauss : GaussianLipschitzVarianceInput)
        (m n : ℕ) (cut : Fin (n + 2) → ℝ) (hc : StrictMono cut)
        (hfirst : cut 0 = 0) (hlast : cut (Fin.last (n + 1)) = 1)
        (trial : OverlapPath) (values : Fin (n + 1) → ℝ)
        (hvalues : ∀ i s, s ∈ Ioo (cut i.castSucc) (cut i.succ) → trial s = values i)
        (d : ℝ) (hd : 0 < d) (htrial : ∀ᵐ s ∂pathMeasure, trial s ≤ 1 - d)
        (K S L : ℝ) :
        ∃ H : ℝ, 0 < H ∧ ∀ (N : ℕ) (_hN : 3 ≤ N)
          (μ : Measure (SpecialOrthogonal N)) (_hμprob : IsProbabilityMeasure μ)
          (_hμ : μ.IsMulLeftInvariant) (C : Finset (Spin N)) (hC : C.Nonempty) (eig : Fin N → ℝ) (I : Fin m → Finset (Fin N))
          (_heig : ∀ i, |eig i| ≤ K) (V : ℝ → ℝ)
    …

    Mentions: OAI.InvariantIsing.HaarConcentrationInput, OAI.InvariantIsing.GaussianLipschitzVarianceInput, OAI.InvariantIsing.OverlapPath, OAI.InvariantIsing.SpecialOrthogonal, OAI.InvariantIsing.Spin