An official website of the United States government
We construct counterexamples to classical calculus facts such as the inverse and implicit function theorems in scale calculus—a generalization of multivariable calculus to infinite-dimensional vector spaces, in which the reparameterization maps relevant to symplectic geometry are smooth. Scale calculus is a corner stone of polyfold theory, which was introduced by Hofer, Wysocki, and Zehnder as a broadly applicable tool for regularizing moduli spaces of pseudoholomorphic curves. We show how the novel nonlinear scale-Fredholm notion in polyfold theory overcomes the lack of implicit function theorems, by formally establishing an often implicitly used fact: The differentials of basic germs—the local models for scale-Fredholm maps—vary continuously in the space of bounded operators when the base point changes. We moreover demonstrate that this continuity holds only in specific coordinates, by constructing an example of a scale-diffeomorphism and scale-Fredholm map with discontinuous differentials. This justifies the high technical complexity in the foundations of polyfold theory.
more »
« less
An Innate Moving Frame on Parametric Surfaces: The Dynamics of Principal Singular Curves
This article reports an experimental work that unveils some interesting yet unknown phenomena underneath all smooth nonlinear maps. The findings are based on the fact that, generalizing the conventional gradient dynamics, the right singular vectors of the Jacobian matrix of any differentiable map point in directions that are most pertinent to the infinitesimal deformation of the underlying function and that the singular values measure the rate of deformation in the corresponding directions. A continuous adaption of these singular vectors, therefore, constitutes a natural moving frame that carries indwelling information of the variation. This structure exists in any dimensional space, but the development of the fundamental theory and algorithm for surface exploration is an important first step for immediate application and further generalization. In this case, trajectories of these singular vectors, referred to as singular curves, unveil some intriguing patterns per the given function. At points where singular values coalesce, curious and complex behaviors occur, manifesting specific landmarks for the function. Upon analyzing the dynamics, it is discovered that there is a remarkably simple and universal structure underneath all smooth two-parameter maps. This work delineates graphs with this interesting dynamical system and the possible new discovery that, analogous to the double helix with two base parings in DNA, two strands of critical curves and eight base pairings could encode properties of a generic and arbitrary surface. This innate structure suggests that this approach could provide a unifying paradigm in functional genetics, where all smooth surfaces could be genome-sequenced and classified accordingly. Such a concept has sparked curiosity and warrants further investigation.
more »
« less
- PAR ID:
- 10520546
- Publisher / Repository:
- MDPI
- Date Published:
- Journal Name:
- Mathematics
- Volume:
- 11
- Issue:
- 15
- ISSN:
- 2227-7390
- Page Range / eLocation ID:
- 3306
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)In this paper, we make partial progress on a function field version of the dynamical uniform boundedness conjecture for certain one-dimensional families $${\mathcal{F}}$$ of polynomial maps, such as the family $$f_{c}(x)=x^{m}+c$$ , where $$m\geq 2$$ . We do this by making use of the dynatomic modular curves $$Y_{1}(n)$$ (respectively $$Y_{0}(n)$$ ) which parametrize maps $$f$$ in $${\mathcal{F}}$$ together with a point (respectively orbit) of period $$n$$ for $$f$$ . The key point in our strategy is to study the set of primes $$p$$ for which the reduction of $$Y_{1}(n)$$ modulo $$p$$ fails to be smooth or irreducible. Morton gave an algorithm to construct, for each $$n$$ , a discriminant $$D_{n}$$ whose list of prime factors contains all the primes of bad reduction for $$Y_{1}(n)$$ . In this paper, we refine and strengthen Morton’s results. Specifically, we exhibit two criteria on a prime $$p$$ dividing $$D_{n}$$ : one guarantees that $$p$$ is in fact a prime of bad reduction for $$Y_{1}(n)$$ , yet this same criterion implies that $$Y_{0}(n)$$ is geometrically irreducible. The other guarantees that the reduction of $$Y_{1}(n)$$ modulo $$p$$ is actually smooth. As an application of the second criterion, we extend results of Morton, Flynn, Poonen, Schaefer, and Stoll by giving new examples of good reduction of $$Y_{1}(n)$$ for several primes dividing $$D_{n}$$ when $n=7,8,11$ , and $$f_{c}(x)=x^{2}+c$$ . The proofs involve a blend of arithmetic and complex dynamics, reduction theory for curves, ramification theory, and the combinatorics of the Mandelbrot set.more » « less
-
null (Ed.)In order to compute fast approximations to the singular value decompositions (SVD) of very large matrices, randomized sketching algorithms have become a leading approach. However, a key practical difficulty of sketching an SVD is that the user does not know how far the sketched singular vectors/values are from the exact ones. Indeed, the user may be forced to rely on analytical worst-case error bounds, which may not account for the unique structure of a given problem. As a result, the lack of tools for error estimation often leads to much more computation than is really necessary. To overcome these challenges, this paper develops a fully data-driven bootstrap method that numerically estimates the actual error of sketched singular vectors/values. Furthermore, the method is computationally inexpensive, because it operates only on sketched objects, and hence it requires no extra passes over the full matrix being factored.more » « less
-
Variable order structures model situations in which the comparison between two points depends on a point-to-cone map. In this paper, inexact projected gradient methods for solving smooth constrained vector optimization problems on variable ordered spaces are presented. It is shown that every accumulation point of the generated sequences satisfies the first-order necessary optimality condition. Moreover, under suitable convexity assumptions for the objective function, it is proved that all accumulation points of any generated sequences are weakly efficient points. The convergence results are also derived in the particular case in which the problem is unconstrained and even if inexact directions are taken as descent directions. Furthermore, we investigate the application of the proposed method to optimization models where the domain of the variable order map coincides with the image of the objective function. In this case, similar concepts and convergence results are presented. Finally, some computational experiments designed to illustrate the behavior of the proposed inexact methods versus the exact ones (in terms of CPU time) are performed.more » « less
-
The purpose of this work is to discuss the well-posedness theory of singular vortex patches. Our main results are of two types: well-posedness and ill-posedness. On the well-posedness side, we show that globally m m -fold symmetric vortex patches with corners emanating from the origin are globally well-posed in natural regularity classes as long as m ≥ 3. m\geq 3. In this case, all of the angles involved solve a closed ODE system which dictates the global-in-time dynamics of the corners and only depends on the initial locations and sizes of the corners. Along the way we obtain a global well-posedness result for a class of symmetric patches with boundary singular at the origin, which includes logarithmic spirals. On the ill-posedness side, we show that any other type of corner singularity in a vortex patch cannot evolve continuously in time except possibly when all corners involved have precisely the angle π 2 \frac {\pi }{2} for all time. Even in the case of vortex patches with corners of angle π 2 \frac {\pi }{2} or with corners which are only locally m m -fold symmetric, we prove that they are generically ill-posed. We expect that in these cases of ill-posedness, the vortex patches actually cusp immediately in a self-similar way and we derive some asymptotic models which may be useful in giving a more precise description of the dynamics. In a companion work from 2020 on singular vortex patches, we discuss the long-time behavior of symmetric vortex patches with corners and use them to construct patches on R 2 \mathbb {R}^2 with interesting dynamical behavior such as cusping and spiral formation in infinite time.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.3390/math11153306
