首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 171 毫秒
1.
The main result of this paper is a theorem about projectivities in then-dimensional complex projective spaceP n (n 2). Puttingn = 2, we showed in [3] that the theorem of Desargues inP n is a special case of this theorem. And not only the theorem of Desargues but also the converse of the theorem of Pascal, the theorem of Pappus-Pascal, the theorem of Miquel, the Newton line, the Brocard points and a lot of lesser known results in the projective, the affine and the Euchdean plane were obtained from this theorem as special cases without any further proof. Many extensions of classical theorems in the projective, affine and Euclidean plane to higher dimensions can be found in the literature and probably some of these are special cases of this theorem inP n. We only give a few examples and leave it as an open problem which other special cases could be found.  相似文献   

2.
In this paper we shall deal with a weak version of the Borsuk-Ulam theorem for G-isovariant maps, which we call the weak isovariant Borsuk-Ulam theorem. One of the results is that the weak isovariant Borsuk-Ulam theorem in linear G-spheres holds for an arbitrary compact Lie group G. On the contrary the weak isovariant Borsuk-Ulam theorem in semilinear G-(homology) spheres holds if and only if G is solvable. Received: 2 April 2002  相似文献   

3.
On the Equivalence and Generalized of Weyl Theorem Weyl Theorem   总被引:3,自引:0,他引:3  
We know that an operator T acting on a Banach space satisfying generalized Weyl's theorem also satisfies Weyl's theorem. Conversely we show that if all isolated eigenvalues of T are poles of its resolvent and if T satisfies Weyl's theorem, then it also satisfies generalized Weyl's theorem. We give also a sinlilar result for the equivalence of a-Weyl's theorem and generalized a-Weyl's theorem. Using these results, we study the case of polaroid operators, and in particular paranormal operators.  相似文献   

4.
The Assmus–Mattson theorem is known as a method to find designs in linear codes over a finite field. It is an interesting problem to find an analog of the theorem for Z 4-codes. In a previous paper, the author gave a candidate of the theorem. The purpose of this paper is to give an improvement of the theorem. It is known that the lifted Golay code over Z 4 contains 5-designs on Lee compositions. The improved method can find some of those without computational difficulty and without the help of a computer.  相似文献   

5.
In the present paper we examine the stability of Weyl’s theorem under perturbations. We show that if T is an isoloid operator on a Banach space, that satisfies Weyl’s theorem, and F is a bounded operator that commutes with T and for which there exists a positive integer n such that Fn is finite rank, then T + F obeys Weyl’s theorem. Further, we establish that if T is finite-isoloid, then Weyl’s theorem is transmitted from T to T + R, for every Riesz operator R commuting with T. Also, we consider an important class of operators that satisfy Weyl’s theorem, and we give a more general perturbation results for this class.  相似文献   

6.
We consider classical, continuous systems of particles in r dimensions described by infinite system equilibrium states which have been defined by Dobrushin [5] and Lanford/Ruelle [24]. For a large class of potentials we prove the theorem of Lee/Yang [43] together with a variational characterizafor these equilibrium states. The main idea stems from Föllmer [9] who showed that in the case of lattice systems, the theorem of Lee/Yang is intimately related to Birkhoff's ergodic theorem and McMillan's theorem (ergodic theorem of information theory). Following this idea we obtain as main results an r-dimensional ergodic theorem for random measures in r , limit theorems concerning energy and entropy and an r-dimensional version of Breiman's theorem showing that there is almost sure convergence behind McMillan's theorem.

Danken möchten wir Klaus Krickeberg, der diese Arbeit durch eine Fülle wertvoller Hinweise und Anregungen gefördert hat.  相似文献   

7.
A characterization of n-dimensional spaces via continuous selections avoiding Z n -sets is given, and a selection theorem for strongly countable-dimensional spaces is established. We apply these results to prove a generalized Ostrand's theorem, and to obtain a new alternative proof of the Hurewicz formula. It is also shown that our selection theorem yields an easy proof of a Michael's result.  相似文献   

8.
A theory of best restricted range approximation is developed for an extended n-dimensional Chebyshev subspace of C[a,b] of order n without restricting the upper and lower restraining functions. This theory includes a “zero in the convex hull” characterization, an alternation theorem, and a strong uniqueness theorem.  相似文献   

9.
In this paper, we obtain an existence theorem for fixed points of contractive set-valued mappings on a metric space endowed with a graph. This theorem unifies and extends several fixed point theorems for mappings on metric spaces and for mappings on metric spaces endowed with a graph. As an application, we obtain a theorem on the convergence of successive approximations for some linear operators on an arbitrary Banach space. This result yields the well-known Kelisky–Rivlin theorem on iterates of the Bernstein operators on C[0,1].  相似文献   

10.
Based on the established earlier general estimation method of the lengths of level sets of real functions, the paper proves a theorem which is an analog of the second fundamental theorem of the theory of Gamma-lines which, in its turn, is an analog of the second fundamental theorem of R. Nevanlinna.  相似文献   

11.
A new coincidence theorem for admissible set-valued mappings is proved in FC-spaces with a more general convexity structure. As applications, an abstract variational inequality, a KKM type theorem and a fixed point theorem are obtained. Our results generalize and improve the corresponding results in the literature.  相似文献   

12.
In this paper we focus on three fixed point theorems and an integral equation. Schaefer's fixed point theorem will yield a T-periodic solution of (0.1) x(t)= a(t) + tt-h D(t,s)g(s,x(s))ds if D and g satisfy certain sign conditions independent of their magnitude. A combination of the contraction mapping theorem and Schauder's theorem (known as Krasnoselskii's theorem) will yield a T-periodic solution of (0.2) x(t) = f(t,x(t)) + tt-h D(t,s)g(s,x(s))ds if f defines a contraction and if D and g are small enough. We prove a fixed point theorem which is a combination of the contraction mapping theorem and Schaefer's theorem which yields a T-periodic solution of (0.2) when / defines a contraction mapping, while D and g satisfy the aforementioned sign conditions.  相似文献   

13.
In this paper we propose a new proof of the well-known theorem by S. N. Bernstein, according to which among entire functions which give on (−∞,∞) the best uniform approximation of order σ of periodic functions there exists a trigonometric polynomial whose order does not exceed σ. We also prove an analog of this Bernstein theorem and an analog of the Jackson theorem for uniform almost periodic functions with an arbitrary spectrum.  相似文献   

14.
 Let G(n) and Λ(n) be two sequences of nonnegative numbers which satisfy G(0)=1 and an additive convolution equation . A Chebyshev-type upper estimate for prime elements in an additive arithmetic semigroup is essentially a tauberian theorem on Λ(n) and G(n). Suppose with real constants . The theorem proved here states that and that holds with an explicit function R(n) of order <1 in n. This theorem is sharp. It has several applications.  相似文献   

15.
This paper proves an isomorphism theorem for cochains and differential forms, before passing to cohomology. De Rham’s theorem is a consequence. This leads to an extension of much of calculus and homology theory to nonsmooth domains, called chainlets,and makes available combinatorial techniques for smooth domains that limit to the classic analytic methods. We find maximal subspaces of L 1 forms that satisfy Stokes’s theorem for domains of chainlets giving a measurable, as well as optimal, extension of the theory.  相似文献   

16.
The approximate sampling theorem with its associated aliasing error is due to J.L. Brown (1957). This theorem includes the classical Whittaker–Kotel’nikov–Shannon theorem as a special case. The converse is established in the present paper, that is, the classical sampling theorem for , 1p<∞, w>0, implies the approximate sampling theorem. Consequently, both sampling theorems are fully equivalent in the uniform norm.Turning now to -space, it is shown that the classical sampling theorem for , 1<p<∞ (here p=1 must be excluded), implies the -approximate sampling theorem with convergence in the -norm, provided that f is locally Riemann integrable and belongs to a certain class Λp. Basic in the proof is an intricate result on the representation of the integral as the limit of an infinite Riemann sum of |f|p for a general family of partitions of ; it is related to results of O. Shisha et al. (1973–1978) on simply integrable functions and functions of bounded coarse variation on . These theorems give the missing link between two groups of major equivalent theorems; this will lead to the solution of a conjecture raised a dozen years ago.  相似文献   

17.
In the present work we prove a coincidence point theorem in Menger spaces with a t-norm T which satisfies the condition sup{T(t,t):t<1}=1. As a corollary of our theorem we obtain some existing results in metric spaces and probabilistic metric spaces. Particularly our result implies a probabilistic generalization of Banach contraction mapping theorem. We also support our result by an example.  相似文献   

18.
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note that previous work on degrees and factors has focused primarily on finding conditions for a degree sequence to be potentially k-factor graphical. We first give a theorem for π to be forcibly 1-factor graphical and, more generally, forcibly graphical with deficiency at most β ≥ 0. These theorems are equal in strength to Chvátal’s well-known hamiltonian theorem, i.e., the best monotone degree condition for hamiltonicity. We then give an equally strong theorem for π to be forcibly 2-factor graphical. Unfortunately, the number of nonredundant conditions that must be checked increases significantly in moving from k = 1 to k = 2, and we conjecture that the number of nonredundant conditions in a best monotone theorem for a k-factor will increase superpolynomially in k. This suggests the desirability of finding a theorem for π to be forcibly k-factor graphical whose algorithmic complexity grows more slowly. In the final section, we present such a theorem for any k ≥ 2, based on Tutte’s well-known factor theorem. While this theorem is not best monotone, we show that it is nevertheless tight in a precise way, and give examples illustrating this tightness.  相似文献   

19.
We bring an example which shows that in a theorem due to Cartwright, Spencer and Hayman concerning areally meanp-valent functions a multiplicative constant cannot be reduced to 1. (This is possible in the corresponding theorem for circumferentially meanp-valent functions).  相似文献   

20.
Concepts of g-supersolution ,g-martingale,g-supermartingale are introduced,wihch are related to BSDE with Brownian motion and Poisson Point process.A strict comparison theorem,monotonic limit theorem related to this type of BSDE are also discussed.As an application of these results,a nonlinear Doob-Meyer decomposition theorem is obtained.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号