A problem by E. Landis and generic behavior of non-generic sets (Q5711136)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2237327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A problem by E. Landis and generic behavior of non-generic sets |
scientific article; zbMATH DE number 2237327 |
Statements
A problem by E. Landis and generic behavior of non-generic sets (English)
0 references
9 December 2005
0 references
Zeros of analytic function
0 references
0.84525424
0 references
0.83936924
0 references
0.8389611
0 references
0.83553016
0 references
0.8337728
0 references
0 references
In the paper it is discussed the following problem of E.Landis: if \(f\in C_{\text{loc}}^{\infty}(\mathbb{R})\) and for each \(x\in \mathbb{R}\) there is some non-negative integer \(n\) such that \(f^{(n)}(x)=0,\) then \(f\) is a polynomial. (This fact was proved in the mid-1960s and was published in a Soviet journal, but that publication is now effectively inaccessible). Authors give their proof of this theorem and discuss this fact in a broader setting. They introduce the following sets \[ G(f)=\{x\in \mathbb{R}:\forall n=0,1,2,\ldots f^{(n)}(x)\neq 0\}, \quad NG(f)=\mathbb{R}\backslash G(f) \] and obtain some properties of these sets. In particular, the following theorems are proved. Theorem. If \(f\in C^{\infty}(\mathbb{R})\) is not a polynomial, then \(G(f)\) has cardinality \(\mathcal{C}\). Theorem. If \(f\in C^{\infty}(\mathbb{R})\) then \(NG(f)\) is a countable union of pairwise disjoint closed sets. The structure of \(G(f)\) in the sense of Baire category (in certain complete metric spaces of \(\mathcal{C^\infty}\) functions) or in the sense of probability measure is studied.
0 references