The Distance from l to a Subspace of Lp
β Scribed by D. R. Lewis
- Publisher
- John Wiley and Sons
- Year
- 1984
- Tongue
- English
- Weight
- 242 KB
- Volume
- 119
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
β¦ Synopsis
For ( p -2) (r-2)-=0 andB any n-dimensional subspaw of an Lppace, the BANAVH-MAWR distance from Z : to E' is at most cn"(1og n)P, where ct is the natural exponent a --I 1 1 1 =mas { -i. 1 , -I ) and fi depends on p nud r.
'For E and F normed spaces the BANACH-MAZUR distance from E to F is defined to be d(E. F) =inf llull 11u-111. with the infimum taken over all isomorphisms 11 : R --
+F. The space 1; means Rn under the norm
The main result of this paper (Theorem 2) is an upper estimate for t.he distaiwe from 2 ; to an arhitrary n dimensional subspace of Lp which is optimal except for :t logarithmir factor. The result supjmrts the conjecture that
π SIMILAR VOLUMES
## Virtual Success The Keys to Effectiveness in Leading from a Distance As virtual teams become more prevalent, organizations need to take a close look at how they can best ensure the success of these teams. Leaders of virtual teams, who must manage from a distance, face unique issues and challe
Let Ξ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (Ξ») > n -1, then D β€ d -1, where P is the polynomial of degree d-1 which takes alternating values Β±1 at Ξ» 1 , . . . , Ξ» d . The graphs satisfying P (Ξ») = n -1, called boundary graphs, h