关于由增生算子生成的非线性半群的证明论元定理及其应用
A proof-theoretic metatheorem for nonlinear semigroups generated by an accretive operator and applications
AI总结:
本文扩展了证明挖掘理论框架,建立了处理由增生算子生成的非线性半群的逻辑元定理,并通过两个案例研究展示了其在推导收敛速率方面的应用。
摘要:
我们进一步发展了证明挖掘的理论框架,这是数学逻辑中的一个研究计划,旨在从主流数学文献中表面上“非计算性”的证明中量化和提取计算信息。为此,我们建立了逻辑元定理,允许处理涉及由增生算子生成的非线性半群的证明,这些结构特别出现于微分方程的解和渐近行为的研究中。这样,此处建立的元定理为将证明挖掘计划中的方法应用于自20世纪70年代以来在该理论背景下确立的广泛数学结果提供了理论基础。我们特别通过提供两个案例研究来说明此处引入的新系统及其元定理的适用性,这两个研究分别针对Reich和Plant关于上述半群及其生成子预解式的渐近行为的两个核心结果,在其中我们推导了所涉极限的收敛速率,并且这些速率在所有数据上都是多项式的。
英文摘要:
We further develop the theoretical framework of proof mining, a program in mathematical logic that seeks to quantify and extract computational information from prima facie `non-computational' proofs from the mainstream mathematical literature. To that end, we establish logical metatheorems that allow for the treatment of proofs involving nonlinear semigroups generated by an accretive operator, structures which in particular arise in the study of the solutions and asymptotic behavior of differential equations. In that way, the here established metatheorems facilitate a theoretical basis for the application of methods from the proof mining program to the wide variety of mathematical results established in the context of that theory since the 1970's. We in particular illustrate the applicability of the new systems and their metatheorems introduced here by providing two case studies on two central results due to Reich and Plant, respectively, on the asymptotic behavior of said semigroups and the resolvents of their generators where we derive rates of convergence for the limits involved which are, moreover, polynomial in all data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。