论费德勒定理中假设的尖锐性

IF 0.7 4区 数学 Q2 MATHEMATICS St Petersburg Mathematical Journal Pub Date : 2021-12-28 DOI:10.1090/spmj/1691
B. Makarov, A. Podkorytov
{"title":"论费德勒定理中假设的尖锐性","authors":"B. Makarov, A. Podkorytov","doi":"10.1090/spmj/1691","DOIUrl":null,"url":null,"abstract":"<p>The Federer theorem deals with the “massiveness” of the set of critical values for a <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"t\">\n <mml:semantics>\n <mml:mi>t</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">t</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>-smooth map acting from <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"double-struck upper R Superscript m\">\n <mml:semantics>\n <mml:msup>\n <mml:mrow class=\"MJX-TeXAtom-ORD\">\n <mml:mi mathvariant=\"double-struck\">R</mml:mi>\n </mml:mrow>\n <mml:mi>m</mml:mi>\n </mml:msup>\n <mml:annotation encoding=\"application/x-tex\">\\mathbb R^m</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> to <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"double-struck upper R Superscript n\">\n <mml:semantics>\n <mml:msup>\n <mml:mrow class=\"MJX-TeXAtom-ORD\">\n <mml:mi mathvariant=\"double-struck\">R</mml:mi>\n </mml:mrow>\n <mml:mi>n</mml:mi>\n </mml:msup>\n <mml:annotation encoding=\"application/x-tex\">\\mathbb R^n</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>: it claims that the Hausdorff <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"p\">\n <mml:semantics>\n <mml:mi>p</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">p</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>-measure of this set is zero for certain <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"p\">\n <mml:semantics>\n <mml:mi>p</mml:mi>\n <mml:annotation encoding=\"application/x-tex\">p</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>. If <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"n greater-than-or-equal-to m\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>n</mml:mi>\n <mml:mo>≥<!-- ≥ --></mml:mo>\n <mml:mi>m</mml:mi>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">n\\ge m</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>, it has long been known that the assumption of that theorem relating the parameters <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"m comma n comma t comma p\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>m</mml:mi>\n <mml:mo>,</mml:mo>\n <mml:mi>n</mml:mi>\n <mml:mo>,</mml:mo>\n <mml:mi>t</mml:mi>\n <mml:mo>,</mml:mo>\n <mml:mi>p</mml:mi>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">m,n,t,p</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula> is sharp. Here it is shown by an example that this assumption is also sharp for <inline-formula content-type=\"math/mathml\">\n<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"n greater-than m\">\n <mml:semantics>\n <mml:mrow>\n <mml:mi>n</mml:mi>\n <mml:mo>></mml:mo>\n <mml:mi>m</mml:mi>\n </mml:mrow>\n <mml:annotation encoding=\"application/x-tex\">n>m</mml:annotation>\n </mml:semantics>\n</mml:math>\n</inline-formula>.</p>","PeriodicalId":51162,"journal":{"name":"St Petersburg Mathematical Journal","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2021-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the sharpness of assumptions in the Federer theorem\",\"authors\":\"B. Makarov, A. Podkorytov\",\"doi\":\"10.1090/spmj/1691\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The Federer theorem deals with the “massiveness” of the set of critical values for a <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"t\\\">\\n <mml:semantics>\\n <mml:mi>t</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">t</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>-smooth map acting from <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"double-struck upper R Superscript m\\\">\\n <mml:semantics>\\n <mml:msup>\\n <mml:mrow class=\\\"MJX-TeXAtom-ORD\\\">\\n <mml:mi mathvariant=\\\"double-struck\\\">R</mml:mi>\\n </mml:mrow>\\n <mml:mi>m</mml:mi>\\n </mml:msup>\\n <mml:annotation encoding=\\\"application/x-tex\\\">\\\\mathbb R^m</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> to <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"double-struck upper R Superscript n\\\">\\n <mml:semantics>\\n <mml:msup>\\n <mml:mrow class=\\\"MJX-TeXAtom-ORD\\\">\\n <mml:mi mathvariant=\\\"double-struck\\\">R</mml:mi>\\n </mml:mrow>\\n <mml:mi>n</mml:mi>\\n </mml:msup>\\n <mml:annotation encoding=\\\"application/x-tex\\\">\\\\mathbb R^n</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>: it claims that the Hausdorff <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"p\\\">\\n <mml:semantics>\\n <mml:mi>p</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">p</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>-measure of this set is zero for certain <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"p\\\">\\n <mml:semantics>\\n <mml:mi>p</mml:mi>\\n <mml:annotation encoding=\\\"application/x-tex\\\">p</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>. If <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"n greater-than-or-equal-to m\\\">\\n <mml:semantics>\\n <mml:mrow>\\n <mml:mi>n</mml:mi>\\n <mml:mo>≥<!-- ≥ --></mml:mo>\\n <mml:mi>m</mml:mi>\\n </mml:mrow>\\n <mml:annotation encoding=\\\"application/x-tex\\\">n\\\\ge m</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>, it has long been known that the assumption of that theorem relating the parameters <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"m comma n comma t comma p\\\">\\n <mml:semantics>\\n <mml:mrow>\\n <mml:mi>m</mml:mi>\\n <mml:mo>,</mml:mo>\\n <mml:mi>n</mml:mi>\\n <mml:mo>,</mml:mo>\\n <mml:mi>t</mml:mi>\\n <mml:mo>,</mml:mo>\\n <mml:mi>p</mml:mi>\\n </mml:mrow>\\n <mml:annotation encoding=\\\"application/x-tex\\\">m,n,t,p</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula> is sharp. Here it is shown by an example that this assumption is also sharp for <inline-formula content-type=\\\"math/mathml\\\">\\n<mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"n greater-than m\\\">\\n <mml:semantics>\\n <mml:mrow>\\n <mml:mi>n</mml:mi>\\n <mml:mo>></mml:mo>\\n <mml:mi>m</mml:mi>\\n </mml:mrow>\\n <mml:annotation encoding=\\\"application/x-tex\\\">n>m</mml:annotation>\\n </mml:semantics>\\n</mml:math>\\n</inline-formula>.</p>\",\"PeriodicalId\":51162,\"journal\":{\"name\":\"St Petersburg Mathematical Journal\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2021-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"St Petersburg Mathematical Journal\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1090/spmj/1691\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"St Petersburg Mathematical Journal","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1090/spmj/1691","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

费德勒定理处理的是从R m \mathbb R^m到R n \mathbb R^n的光滑映射的临界值集合的“海量性”:它声称该集合的Hausdorff p p -测度在特定的p p下为零。如果n≥m n\ge m,我们早就知道关于参数m,n,t,p m,n,t,p的定理的假设是尖锐的。这里的一个例子表明,这个假设对于n b>00 m和n bb11m也是尖锐的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the sharpness of assumptions in the Federer theorem

The Federer theorem deals with the “massiveness” of the set of critical values for a t t -smooth map acting from R m \mathbb R^m to R n \mathbb R^n : it claims that the Hausdorff p p -measure of this set is zero for certain p p . If n m n\ge m , it has long been known that the assumption of that theorem relating the parameters m , n , t , p m,n,t,p is sharp. Here it is shown by an example that this assumption is also sharp for n > m n>m .

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.00
自引率
12.50%
发文量
52
审稿时长
>12 weeks
期刊介绍: This journal is a cover-to-cover translation into English of Algebra i Analiz, published six times a year by the mathematics section of the Russian Academy of Sciences.
期刊最新文献
Shape, velocity, and exact controllability for the wave equation on a graph with cycle On Kitaev’s determinant formula Resolvent stochastic processes Complete nonselfadjointness for Schrödinger operators on the semi-axis Behavior of large eigenvalues for the two-photon asymmetric quantum Rabi model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1