Theorem 4.14
OpenQAlgorithms.Papers.Independent.Intakenext100.P35.theorem_4_14The span of constants and resolvents , , is dense in for every . However, for ,
The second assertion uses the stronger bounded-subalgebra norm, not the norm.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P35
noncomputable section
open Complex MeasureTheory Filter Set
open scoped Topology ENNReal
namespace QAlgorithms.Papers.Independent.Intakenext100.P35
open QAlgorithms.Papers.Independent.Renew46.P11 (HolomorphicBernstein)
attribute [local instance] Classical.propDecidable
universe u
/-- Theorem 4.14, arXiv:2202.03143v1, PDF page(s) 23. -/
theorem theorem_4_14
:
(∀ s : ℝ, -1 < s → ∀ f, D s f →
NormClosure (ResolventSpan hp hp true) (dSize s) f) ∧
(∀ s : ℝ, 0 < s → ∃ f, DBounded s f ∧ ¬ NormClosure BesovClass (dBoundedSize s) f) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P35
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let . For a global function , define
where is the limit of as real , or zero if no such limit exists, and the nonnegative integrals and suprema take values in . Say that holds when is holomorphic on , is almost everywhere strongly measurable for Lebesgue measure on , and . For every real and every satisfying , the following approximation holds: for every , there exist a global function , a natural number , complex numbers for , with each , such that
The case is allowed and gives a constant on ; no condition on outside is imposed by the displayed representation. In addition, for every real , there exists a global satisfying and for which approximation by Besov-class functions fails in : explicitly, there is an such that every global function holomorphic on with
satisfies .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.