# Double Index Array

1. Dec 4, 2007

### linuxux

I'm just don't get this question.

from my text:

$$define\ t_{mn}\ =\ \sum^{m}_{i=1}\sum^{n}_{j=1}|a_{ij}|,$$
$$[a_{ij}\ is\ a\ doubly\ indexed\ array\ of\ real\ numbers.]$$
$$(a)\ prove\ that\ the\ set\ \{t_{mn}\ :\ m,n\ \in\ N\}\ is\ bounded\ above.$$
$$(b)\ use\ (a)\ to\ conclude\ that\ (t_{nn})\ converges.$$

This has been confusing me for a couple of days, i've got the rest of the proof, but this part doesn't make any sense. The theorem i'm trying to prove states "IF the doubly indexed array converges absolutely," but if I "prove" {t_mn} is bounded, it suggest then that every doubly indexed array would converge absolutely, so i'm not sure how i can possibly answer (a).

From what i understand, the set {t_mn} is all the possible outcomes of the double summation, for instance, the first member would be a_11, the second might be a_11 + a_12 or a_11 + a_21, etc. But that set has no bound. It can grow as much as it wants, i think.

Last edited: Dec 4, 2007
2. Dec 4, 2007

### ozymandias

You're not given ANY information about the $$a_{ij}$$s?
That's odd. Take $$a_{ij}=1$$ for all i, j. Then
$$t_{mn} = m \times n$$ which is of course NOT bounded above - correct me if I'm mistaken.

--------
Assaf
http://www.physicallyincorrect.com/" [Broken]

Last edited by a moderator: May 3, 2017
3. Dec 4, 2007

### linuxux

Well, the book was introducing double sums, and at one point it defined the "rectangular partial sums":
$$s_{mn}\ =\ \sum^{m}_{i=1}\sum^{n}_{j=1}a_{ij},\ for\ m,n\ \in\ N.$$
And before it defined t_mn, it said "in the same way that we define the 'rectangular partial sums' s_mn above, define t_mn (as indicated above)"

however, it did not specifiy in any way that s_mn converged, all it said was that "in this case the order of the sum doesn't matter since the sum is finite."

Last edited by a moderator: May 3, 2017
4. Dec 4, 2007

### ozymandias

Still, without any information about the a_ijs, we cannot prove the assertion.

--------
Assaf
http://www.physicallyincorrect.com/" [Broken]

Last edited by a moderator: May 3, 2017