Return to Question

This question is about extending a result on transportation polytopes from Brualdi regarding $m\times n$ matrices to the case when $m=\infty$.

Notation: Denote an $m\times n$ matrix by $A=[a_{i,j}]$, and consider sets $K\subset\lbrace 1,2,\ldots, m\rbrace$ and $J\subset \lbrace 1,2,\ldots, n\rbrace$. Define $$A[K,J):=[a_{i,j}:i\in K, j\in\lbrace 1,2,\ldots,n\rbrace-J].$$

Denote by $N(R,S)$ by the class of all $m\times n$ nonnegative matrices with row sum given by the positive vector $R=(r_1,\ldots, r_m)$ and column sum given by the positive vector $S=(s_1,\ldots, s_n)\,\,\,$ ($N(R,S)$ is called a transportation polytope).

The following theorem is from Brualdi's Combinatorial Matrix Classes:

I am trying to construct an $\infty\times n$ matrix with $\sum_{m=1}^{\infty}r_m = \sum_{j=1}^ns_j=1.$ Will this theorem also hold when $m=\infty$? I tried extending the proof to the case $m=\infty$, but Brualdi's proof heavily relies on the fact that $m$ is finite.

Update: Let $r_i', s_j'$ denote the row and column sums in the case $m=\infty$. For a particular example, I can apply this theorem to prove the existence a $m\times n$ matrix for all sufficiently large $m$, where the column sums will necessarily be less than $s_j'$ (let's say $s_j' \epsilon$, where $\epsilon$ tends to 1 as $m$ tends to $\infty$) and I am able to verify the inequality after we replace $m$ with infinity, but I am not sure if this implies the existence of the $\infty \times n$ matrix.

This question is about extending a result on transportation polytopes from Brualdi regarding $m\times n$ matrices to the case when $m=\infty$.

Notation: Denote an $m\times n$ matrix by $A=[a_{i,j}]$, and consider sets $K\subset\lbrace 1,2,\ldots, m\rbrace$ and $J\subset \lbrace 1,2,\ldots, n\rbrace$. Define $$A[K,J):=[a_{i,j}:i\in K, j\in\lbrace 1,2,\ldots,n\rbrace-J].$$

Denote by $N(R,S)$ by the class of all $m\times n$ nonnegative matrices with row sum given by the positive vector $R=(r_1,\ldots, r_m)$ and column sum given by the positive vector $S=(s_1,\ldots, s_n)\,\,\,$ ($N(R,S)$ is called a transportation polytope).

The following theorem is from Brualdi's Combinatorial Matrix Classes:

I am trying to construct an $\infty\times n$ matrix with $\sum_{m=1}^{\infty}r_m = \sum_{j=1}^ns_j=1.$ Will this theorem also hold when $m=\infty$? I tried extending the proof to the case $m=\infty$, but Brualdi's proof heavily relies on the fact that $m$ is finite.

Update: Here's what I have. Let $r_i', s_j'$ denote the row and column sums in the case $m=\infty$. For a particular example, I can apply this theorem to prove the existence a $m\times n$ matrix for all sufficiently large $m$, where the column sums will necessarily be less than $s_j'$ (let's say $s_j' \epsilon$, where $\epsilon$ tends to 1 as $m$ tends to $\infty$) and I am able to verify the inequality after we replace $m$ with infinity, but I am not sure if this implies the existence of the $\infty \times n$ matrix.

This question is about extending a result on transportation polytopes from Brualdi regarding $m\times n$ matrices to the case when $m=\infty$.

Notation: Denote an $m\times n$ matrix by $A=[a_{i,j}]$, and consider sets $K\subset\lbrace 1,2,\ldots, m\rbrace$ and $J\subset \lbrace 1,2,\ldots, n\rbrace$. Define $$A[K,J):=[a_{i,j}:i\in K, j\in\lbrace 1,2,\ldots,n\rbrace-J].$$

Denote by $N(R,S)$ by the class of all $m\times n$ nonnegative matrices with row sum given by the vector $R=(r_1,\ldots, r_m)$ and column sum given by the vector $S=(s_1,\ldots, s_n)\,\,\,$ ($N(R,S)$ is called a transportation polytope).

The following theorem is from Brualdi's Combinatorial Matrix Classes:

I am trying to construct an $\infty\times n$ matrix with $\sum_{m=1}^{\infty}r_m = \sum_{j=1}^ns_j=1.$ Will this theorem also hold when $m=\infty$? I tried extending the proof to the case $m=\infty$, but Brualdi's proof heavily relies on the fact that $m$ is finite.

Update: Let $r_i, s_j$ denote the row and column sums in the case $m=\infty$. For a particular example, I can apply this theorem to prove the existence a $m\times n$ matrix for all sufficiently large $m$, where the column sums will necessarily be less than $s_j$ (let's say $s_j \epsilon$, where $\epsilon$ tends to 1 as $m$ tends to $\infty$) and I am able to verify the inequality after we replace $m$ with infinity, but I am not sure if this implies the existence of the $\infty \times n$ matrix.

This question is about extending a result on transportation polytopes from Brualdi regarding $m\times n$ matrices to the case when $m=\infty$.

Notation: Denote an $m\times n$ matrix by $A=[a_{i,j}]$, and consider sets $K\subset\lbrace 1,2,\ldots, m\rbrace$ and $J\subset \lbrace 1,2,\ldots, n\rbrace$. Define $$A[K,J):=[a_{i,j}:i\in K, j\in\lbrace 1,2,\ldots,n\rbrace-J].$$

Denote by $N(R,S)$ by the class of all $m\times n$ nonnegative matrices with row sum given by the positive vector $R=(r_1,\ldots, r_m)$ and column sum given by the positive vector $S=(s_1,\ldots, s_n)\,\,\,$ ($N(R,S)$ is called a transportation polytope).

The following theorem is from Brualdi's Combinatorial Matrix Classes:

I am trying to construct an $\infty\times n$ matrix with $\sum_{m=1}^{\infty}r_m = \sum_{j=1}^ns_j=1.$ Will this theorem also hold when $m=\infty$? I tried extending the proof to the case $m=\infty$, but Brualdi's proof heavily relies on the fact that $m$ is finite.

Update: Let $r_i', s_j'$ denote the row and column sums in the case $m=\infty$. For a particular example, I can apply this theorem to prove the existence a $m\times n$ matrix for all sufficiently large $m$, where the column sums will necessarily be less than $s_j'$ (let's say $s_j' \epsilon$, where $\epsilon$ tends to 1 as $m$ tends to $\infty$) and I am able to verify the inequality after we replace $m$ with infinity, but I am not sure if this implies the existence of the $\infty \times n$ matrix.

This question is about extending a result on transportation polytopes from Brualdi regarding $m\times n$ matrices to the case when $m=\infty$.

Notation: Denote an $m\times n$ matrix by $A=[a_{i,j}]$, and consider sets $K\subset\lbrace 1,2,\ldots, m\rbrace$ and $J\subset \lbrace 1,2,\ldots, n\rbrace$. Define $$A[K,J):=[a_{i,j}:i\in K, j\in\lbrace 1,2,\ldots,n\rbrace-J].$$

Denote by $N(R,S)$ by the class of all $m\times n$ nonnegative matrices with row sum given by the vector $R=(r_1,\ldots, r_m)$ and column sum given by the vector $S=(s_1,\ldots, s_n)\,\,\,$ ($N(R,S)$ is called a transportation polytope).

The following theorem is from Brualdi's Combinatorial Matrix Classes:

I am trying to construct an $\infty\times n$ matrix with $\sum_{m=1}^{\infty}r_m = \sum_{j=1}^ns_j=1.$ Will this theorem also hold when $m=\infty$? I tried extending the proof to the case $m=\infty$, but Brualdi's proof heavily relies on the fact that $m$ is finite.

For a particular example, I can apply this theorem to prove the existence of such a $m\times n$ matrix for all sufficiently large $m$, but I am unsure of how to conclude the existence of the $\infty \times n$ matrix.

This question is about extending a result on transportation polytopes from Brualdi regarding $m\times n$ matrices to the case when $m=\infty$.

Notation: Denote an $m\times n$ matrix by $A=[a_{i,j}]$, and consider sets $K\subset\lbrace 1,2,\ldots, m\rbrace$ and $J\subset \lbrace 1,2,\ldots, n\rbrace$. Define $$A[K,J):=[a_{i,j}:i\in K, j\in\lbrace 1,2,\ldots,n\rbrace-J].$$

Denote by $N(R,S)$ by the class of all $m\times n$ nonnegative matrices with row sum given by the vector $R=(r_1,\ldots, r_m)$ and column sum given by the vector $S=(s_1,\ldots, s_n)\,\,\,$ ($N(R,S)$ is called a transportation polytope).

The following theorem is from Brualdi's Combinatorial Matrix Classes:

I am trying to construct an $\infty\times n$ matrix with $\sum_{m=1}^{\infty}r_m = \sum_{j=1}^ns_j=1.$ Will this theorem also hold when $m=\infty$? I tried extending the proof to the case $m=\infty$, but Brualdi's proof heavily relies on the fact that $m$ is finite.

Update: Let $r_i, s_j$ denote the row and column sums in the case $m=\infty$. For a particular example, I can apply this theorem to prove the existence a $m\times n$ matrix for all sufficiently large $m$, where the column sums will necessarily be less than $s_j$ (let's say $s_j \epsilon$, where $\epsilon$ tends to 1 as $m$ tends to $\infty$) and I am able to verify the inequality after we replace $m$ with infinity, but I am not sure if this implies the existence of the $\infty \times n$ matrix.