1980
DOI: 10.1112/plms/s3-41.1.83
|View full text |Cite
|
Sign up to set email alerts
|

Inequalities Involving Lower-Triangular Matrices

Abstract: A subset A of o> is normal if x e A implies N(x) c A. If A <= to, a subset fi of A is said to be normal in A if and only if x e ft implies N(x)nX <= p. Clearly, if A is normal, normal in A means just normal, for subsets of A.If A is a subspace of o>, a normal topology on A is a t.v.s. topology on A for which there exists a neighbourhood base at the origin consisting of sets which are normal in A.If A is a normal subspace of co, and T is a normal topology on A, then < •, e n > is continuous on (A, T) for all n … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
18
0

Year Published

1982
1982
1994
1994

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 10 publications
0
18
0
Order By: Relevance
“…Suppose 1 < p ^ 00, and rp > 1 if p < 00, γ > 0 if Proof. It has been mentioned earlier that {n r~1 } e I (see [3], §8). Suppose be I, and b < {n r~1 }.…”
Section: (3) Il^zlitk'-'xu'£k(r P )±\X K \> Where K(r P) Is a Posimentioning
confidence: 94%
See 3 more Smart Citations
“…Suppose 1 < p ^ 00, and rp > 1 if p < 00, γ > 0 if Proof. It has been mentioned earlier that {n r~1 } e I (see [3], §8). Suppose be I, and b < {n r~1 }.…”
Section: (3) Il^zlitk'-'xu'£k(r P )±\X K \> Where K(r P) Is a Posimentioning
confidence: 94%
“…It was shown in [3,Theorem 9.3] that the inequality (2) with b = {n r~1 } is not best possible, and that, indeed, there is no best possible inequality (2) for this triple A, λ, μ. (It is interesting to note that if p = 1, r > 1, the inequality (2) with 6 = {n^1} holds and is best possible (by [3, Corollary 4.9]).)…”
Section: (3) Il^zlitk'-'xu'£k(r P )±\X K \> Where K(r P) Is a Posimentioning
confidence: 99%
See 2 more Smart Citations
“…Copson [ In this paper I replace these means by more general linear transforms, in both (1) and the companion inequality; this is done in Theorems 1, 2 and 3. In Theorems 4, 5 and 6,1 further replace the index p by a different index q on the left (but not on the right), obtaining inequalities of the form ||Ax||^C||x|| p , (2) where A is an infinite square matrix and x is a variable column, and the norms are weighted versions of the norms in l q and P. The matrix A is sometimes (but not always) lower or upper triangular, as in the work of Davies and Petersen [3], Johnson and Mohapatra [5], and Redheffer [7]. The words increasing and decreasing are used throughout in preference to nondecreasing and non-increasing.…”
Section: Introductionmentioning
confidence: 99%