Generalise to any dimension some notation
$begingroup$
I would like your help to generalise to any dimension and in the most simple way the following piece of notation (written for dimension $3$).
Step 1: Consider the 3 dimensional random vector $epsilonequiv (epsilon_0, epsilon_1, epsilon_2)$ with support the 3d Euclidean space $mathbb{R}^3$.
Step 2: Consider the set $mathcal{A}$ of all possible unordered pairs of elements from the set ${epsilon_0,epsilon_1, epsilon_2}$, i.e.,
$$
mathcal{A}equiv Big({epsilon_1,epsilon_0}, {epsilon_2, epsilon_0}, {epsilon_1, epsilon_2} Big)
$$
Take the difference between the two components of each element in $mathcal{A}$ and store them in a vector $Delta epsilon$, i.e.,
$$
Delta epsilon equiv (epsilon_1-epsilon_0, epsilon_2-epsilon_0, epsilon_1-epsilon_2)
$$
Step 3: Write down the support of $Delta epsilon$, i.e.,
$$
mathcal{S}equiv {(a,b,c)in mathbb{R}^3 text{ s.t. } cequiv (a-b)}
$$
The notation that I'm struggling to generalise to any dimension is the one in Step 2, that, in turn, is crucial for Step 3. Indeed, there are many ways to represent $mathcal{A}$: we could set
$$
mathcal{A}equiv Big({epsilon_1,epsilon_0}, {epsilon_2, epsilon_0}, {epsilon_1, epsilon_2} Big)
$$
as above, but also
$$
mathcal{A}equiv Big({epsilon_0,epsilon_1}, {epsilon_2, epsilon_0}, {epsilon_2, epsilon_1} Big)
$$
or
$$
mathcal{A}equiv Big({epsilon_2, epsilon_0},{epsilon_2, epsilon_1}, {epsilon_1,epsilon_0} Big)
$$
and many more. Different representation of $mathcal{A}$ leads to different definitions of $Delta epsilon$ and in turn to different definitions of $mathcal{S}$. Any representation of $mathcal{A}$ is fine with me, but I want to notationally transmit the idea that when once the reader has fixed a certain representation of $mathcal{A}$, then the definitions of $Delta epsilon$ and $mathcal{S}$ unambiguously follow.
linear-algebra combinatorics permutations notation combinations
$endgroup$
add a comment |
$begingroup$
I would like your help to generalise to any dimension and in the most simple way the following piece of notation (written for dimension $3$).
Step 1: Consider the 3 dimensional random vector $epsilonequiv (epsilon_0, epsilon_1, epsilon_2)$ with support the 3d Euclidean space $mathbb{R}^3$.
Step 2: Consider the set $mathcal{A}$ of all possible unordered pairs of elements from the set ${epsilon_0,epsilon_1, epsilon_2}$, i.e.,
$$
mathcal{A}equiv Big({epsilon_1,epsilon_0}, {epsilon_2, epsilon_0}, {epsilon_1, epsilon_2} Big)
$$
Take the difference between the two components of each element in $mathcal{A}$ and store them in a vector $Delta epsilon$, i.e.,
$$
Delta epsilon equiv (epsilon_1-epsilon_0, epsilon_2-epsilon_0, epsilon_1-epsilon_2)
$$
Step 3: Write down the support of $Delta epsilon$, i.e.,
$$
mathcal{S}equiv {(a,b,c)in mathbb{R}^3 text{ s.t. } cequiv (a-b)}
$$
The notation that I'm struggling to generalise to any dimension is the one in Step 2, that, in turn, is crucial for Step 3. Indeed, there are many ways to represent $mathcal{A}$: we could set
$$
mathcal{A}equiv Big({epsilon_1,epsilon_0}, {epsilon_2, epsilon_0}, {epsilon_1, epsilon_2} Big)
$$
as above, but also
$$
mathcal{A}equiv Big({epsilon_0,epsilon_1}, {epsilon_2, epsilon_0}, {epsilon_2, epsilon_1} Big)
$$
or
$$
mathcal{A}equiv Big({epsilon_2, epsilon_0},{epsilon_2, epsilon_1}, {epsilon_1,epsilon_0} Big)
$$
and many more. Different representation of $mathcal{A}$ leads to different definitions of $Delta epsilon$ and in turn to different definitions of $mathcal{S}$. Any representation of $mathcal{A}$ is fine with me, but I want to notationally transmit the idea that when once the reader has fixed a certain representation of $mathcal{A}$, then the definitions of $Delta epsilon$ and $mathcal{S}$ unambiguously follow.
linear-algebra combinatorics permutations notation combinations
$endgroup$
1
$begingroup$
The problem is not the definition of $mathcal A$, but the definition of $Deltaepsilon$. The sets ${x_0,x_1}$ and ${x_1,x_0}$ are the same set, so $Deltaepsilon$ is ill-defined. (Of course, you can fix this by just taking the absolute value of the difference, and mentioning in a footnote that the sign doesn't matter here.)
$endgroup$
– Deusovi
Jan 10 at 17:55
$begingroup$
Thanks. I see the point. Still, any definition of $Delta epsilon$ is OK with me. But then how do I write $mathcal{S}$ in general?
$endgroup$
– STF
Jan 10 at 19:05
add a comment |
$begingroup$
I would like your help to generalise to any dimension and in the most simple way the following piece of notation (written for dimension $3$).
Step 1: Consider the 3 dimensional random vector $epsilonequiv (epsilon_0, epsilon_1, epsilon_2)$ with support the 3d Euclidean space $mathbb{R}^3$.
Step 2: Consider the set $mathcal{A}$ of all possible unordered pairs of elements from the set ${epsilon_0,epsilon_1, epsilon_2}$, i.e.,
$$
mathcal{A}equiv Big({epsilon_1,epsilon_0}, {epsilon_2, epsilon_0}, {epsilon_1, epsilon_2} Big)
$$
Take the difference between the two components of each element in $mathcal{A}$ and store them in a vector $Delta epsilon$, i.e.,
$$
Delta epsilon equiv (epsilon_1-epsilon_0, epsilon_2-epsilon_0, epsilon_1-epsilon_2)
$$
Step 3: Write down the support of $Delta epsilon$, i.e.,
$$
mathcal{S}equiv {(a,b,c)in mathbb{R}^3 text{ s.t. } cequiv (a-b)}
$$
The notation that I'm struggling to generalise to any dimension is the one in Step 2, that, in turn, is crucial for Step 3. Indeed, there are many ways to represent $mathcal{A}$: we could set
$$
mathcal{A}equiv Big({epsilon_1,epsilon_0}, {epsilon_2, epsilon_0}, {epsilon_1, epsilon_2} Big)
$$
as above, but also
$$
mathcal{A}equiv Big({epsilon_0,epsilon_1}, {epsilon_2, epsilon_0}, {epsilon_2, epsilon_1} Big)
$$
or
$$
mathcal{A}equiv Big({epsilon_2, epsilon_0},{epsilon_2, epsilon_1}, {epsilon_1,epsilon_0} Big)
$$
and many more. Different representation of $mathcal{A}$ leads to different definitions of $Delta epsilon$ and in turn to different definitions of $mathcal{S}$. Any representation of $mathcal{A}$ is fine with me, but I want to notationally transmit the idea that when once the reader has fixed a certain representation of $mathcal{A}$, then the definitions of $Delta epsilon$ and $mathcal{S}$ unambiguously follow.
linear-algebra combinatorics permutations notation combinations
$endgroup$
I would like your help to generalise to any dimension and in the most simple way the following piece of notation (written for dimension $3$).
Step 1: Consider the 3 dimensional random vector $epsilonequiv (epsilon_0, epsilon_1, epsilon_2)$ with support the 3d Euclidean space $mathbb{R}^3$.
Step 2: Consider the set $mathcal{A}$ of all possible unordered pairs of elements from the set ${epsilon_0,epsilon_1, epsilon_2}$, i.e.,
$$
mathcal{A}equiv Big({epsilon_1,epsilon_0}, {epsilon_2, epsilon_0}, {epsilon_1, epsilon_2} Big)
$$
Take the difference between the two components of each element in $mathcal{A}$ and store them in a vector $Delta epsilon$, i.e.,
$$
Delta epsilon equiv (epsilon_1-epsilon_0, epsilon_2-epsilon_0, epsilon_1-epsilon_2)
$$
Step 3: Write down the support of $Delta epsilon$, i.e.,
$$
mathcal{S}equiv {(a,b,c)in mathbb{R}^3 text{ s.t. } cequiv (a-b)}
$$
The notation that I'm struggling to generalise to any dimension is the one in Step 2, that, in turn, is crucial for Step 3. Indeed, there are many ways to represent $mathcal{A}$: we could set
$$
mathcal{A}equiv Big({epsilon_1,epsilon_0}, {epsilon_2, epsilon_0}, {epsilon_1, epsilon_2} Big)
$$
as above, but also
$$
mathcal{A}equiv Big({epsilon_0,epsilon_1}, {epsilon_2, epsilon_0}, {epsilon_2, epsilon_1} Big)
$$
or
$$
mathcal{A}equiv Big({epsilon_2, epsilon_0},{epsilon_2, epsilon_1}, {epsilon_1,epsilon_0} Big)
$$
and many more. Different representation of $mathcal{A}$ leads to different definitions of $Delta epsilon$ and in turn to different definitions of $mathcal{S}$. Any representation of $mathcal{A}$ is fine with me, but I want to notationally transmit the idea that when once the reader has fixed a certain representation of $mathcal{A}$, then the definitions of $Delta epsilon$ and $mathcal{S}$ unambiguously follow.
linear-algebra combinatorics permutations notation combinations
linear-algebra combinatorics permutations notation combinations
edited Feb 7 at 9:20
Servaes
26.4k33997
26.4k33997
asked Jan 10 at 12:18
STFSTF
431422
431422
1
$begingroup$
The problem is not the definition of $mathcal A$, but the definition of $Deltaepsilon$. The sets ${x_0,x_1}$ and ${x_1,x_0}$ are the same set, so $Deltaepsilon$ is ill-defined. (Of course, you can fix this by just taking the absolute value of the difference, and mentioning in a footnote that the sign doesn't matter here.)
$endgroup$
– Deusovi
Jan 10 at 17:55
$begingroup$
Thanks. I see the point. Still, any definition of $Delta epsilon$ is OK with me. But then how do I write $mathcal{S}$ in general?
$endgroup$
– STF
Jan 10 at 19:05
add a comment |
1
$begingroup$
The problem is not the definition of $mathcal A$, but the definition of $Deltaepsilon$. The sets ${x_0,x_1}$ and ${x_1,x_0}$ are the same set, so $Deltaepsilon$ is ill-defined. (Of course, you can fix this by just taking the absolute value of the difference, and mentioning in a footnote that the sign doesn't matter here.)
$endgroup$
– Deusovi
Jan 10 at 17:55
$begingroup$
Thanks. I see the point. Still, any definition of $Delta epsilon$ is OK with me. But then how do I write $mathcal{S}$ in general?
$endgroup$
– STF
Jan 10 at 19:05
1
1
$begingroup$
The problem is not the definition of $mathcal A$, but the definition of $Deltaepsilon$. The sets ${x_0,x_1}$ and ${x_1,x_0}$ are the same set, so $Deltaepsilon$ is ill-defined. (Of course, you can fix this by just taking the absolute value of the difference, and mentioning in a footnote that the sign doesn't matter here.)
$endgroup$
– Deusovi
Jan 10 at 17:55
$begingroup$
The problem is not the definition of $mathcal A$, but the definition of $Deltaepsilon$. The sets ${x_0,x_1}$ and ${x_1,x_0}$ are the same set, so $Deltaepsilon$ is ill-defined. (Of course, you can fix this by just taking the absolute value of the difference, and mentioning in a footnote that the sign doesn't matter here.)
$endgroup$
– Deusovi
Jan 10 at 17:55
$begingroup$
Thanks. I see the point. Still, any definition of $Delta epsilon$ is OK with me. But then how do I write $mathcal{S}$ in general?
$endgroup$
– STF
Jan 10 at 19:05
$begingroup$
Thanks. I see the point. Still, any definition of $Delta epsilon$ is OK with me. But then how do I write $mathcal{S}$ in general?
$endgroup$
– STF
Jan 10 at 19:05
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For every positive integer $n$ define the $ntimes(n-1)$-matrix $D_n$ as
$$D_n:=begin{pmatrix}
1&-1&hphantom{-}0&cdots&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&cdots&hphantom{-}0&hphantom{-}0\
vdots&hphantom{-}vdots&hphantom{-}vdots&ddots&hphantom{-}vdots&hphantom{-}vdots\
1&hphantom{-}0&hphantom{-}0&cdots&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&cdots&hphantom{-}0&-1
end{pmatrix}.$$
Then for any vector $epsilon=(e_1,ldots,e_n)inBbb{R}^n$ you have
$$D_nepsilon=(e_1-e_2,e_1-e_3,ldots,e_1-e_n).$$
Now you want $Delta_{epsilon}$ to be, up to signs and ordering, the concatenation of the vectors
$$D_n(e_1,ldots,e_n),quad D_{n-1}(e_2,ldots,e_n),quad D_{n-2}(e_3,ldots,e_n), qquadldots,qquad D_2(e_{n-1},e_n).$$
Note that these vectors of the form $(e_m,ldots,e_n)$ can be written as a product $(0_{(n-m)times m}|I_{n-m})epsilon$ where $0_{(n-m)times m}$ denotes the $(n-m)times m$-matix with all zeros, and $I_{n-m}$ the square identity matrix of size $n-m$. This makes the matrix $E_{m,n}:=(0_{(n-m)times m}|I_{n-m})$ an $(m-n)times n$-matrix, and so we can write $Delta_{epsilon}$ as a product of $epsilon$ with the block matrix $Delta$ defined as;
$$Delta:=begin{pmatrix}
D_n\
D_{n-1}E_{1,n}\
D_{n-2}E_{2,n}\
vdots\
D_2E_{n-2,n}
end{pmatrix}
qquadtext{ so that}qquad
Delta_{epsilon}=Deltaepsilon.$$
The support of $Delta_{epsilon}$ is then the image of this block matrix. Note that the matrix $Delta$ above has $n$ columns and $binom{n}{2}$ rows, so the codimension of the support (i.e. the number of equations to define $mathcal{S}$) grows quadratically as $n$ grows. The fact that the vector $(1,1,ldots,1)$ is in the kernel of $Delta$ shows that the codimension is in fact even larger; it turns out that the dimension of $mathcal{S}$ equals $n-1$, and so you will need $binom{n}{2}-(n-1)=binom{n-1}{2}$ equations to define $mathcal{S}$.
To make this a bit more tangible (if only for myself!), I'll illustrate the case $n=4$. Then
begin{eqnarray*}
D_4&=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1
end{pmatrix},
qquad
& D_3=begin{pmatrix}
1&-1&hphantom{-}0\
1&hphantom{-}0&-1
end{pmatrix},
qquad
& D_2=begin{pmatrix}
1&-1
end{pmatrix}\
& &E_{1,4}=begin{pmatrix}
0&1&0&0\
0&0&1&0\
0&0&0&1
end{pmatrix},qquad
&E_{2,4}=begin{pmatrix}
0&0&1&0\
0&0&0&1\
end{pmatrix}.
end{eqnarray*}
Then the block matrix is given by
$$Delta:=begin{pmatrix}
D_4\
D_3E_{1,4}\
D_2E_{2,4}
end{pmatrix}
=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1\
0&hphantom{-}1&-1&hphantom{-}0\
0&hphantom{-}1&hphantom{-}0&-1\
0&hphantom{-}0&hphantom{-}1&-1
end{pmatrix}.$$
Then an arbitrary vector $epsilon=(epsilon_1,epsilon_2,epsilon_3,epsilon_4)inBbb{R}^4$ is mapped to
$$Deltaepsilon=(e_1-e_2,e_1-e_3,e_1-e_4,e_2-e_3,e_2-e_4,e_3-e_4).$$
The image of $Delta$, which is the same as the support $mathcal{S}$, is then the subspace of $Bbb{R}^6$ defined by
$$x_1-x_2+x_4=0,qquad x_1-x_3+x_5=0,qquad x_2-x_3+x_5=0.$$
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3068569%2fgeneralise-to-any-dimension-some-notation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
For every positive integer $n$ define the $ntimes(n-1)$-matrix $D_n$ as
$$D_n:=begin{pmatrix}
1&-1&hphantom{-}0&cdots&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&cdots&hphantom{-}0&hphantom{-}0\
vdots&hphantom{-}vdots&hphantom{-}vdots&ddots&hphantom{-}vdots&hphantom{-}vdots\
1&hphantom{-}0&hphantom{-}0&cdots&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&cdots&hphantom{-}0&-1
end{pmatrix}.$$
Then for any vector $epsilon=(e_1,ldots,e_n)inBbb{R}^n$ you have
$$D_nepsilon=(e_1-e_2,e_1-e_3,ldots,e_1-e_n).$$
Now you want $Delta_{epsilon}$ to be, up to signs and ordering, the concatenation of the vectors
$$D_n(e_1,ldots,e_n),quad D_{n-1}(e_2,ldots,e_n),quad D_{n-2}(e_3,ldots,e_n), qquadldots,qquad D_2(e_{n-1},e_n).$$
Note that these vectors of the form $(e_m,ldots,e_n)$ can be written as a product $(0_{(n-m)times m}|I_{n-m})epsilon$ where $0_{(n-m)times m}$ denotes the $(n-m)times m$-matix with all zeros, and $I_{n-m}$ the square identity matrix of size $n-m$. This makes the matrix $E_{m,n}:=(0_{(n-m)times m}|I_{n-m})$ an $(m-n)times n$-matrix, and so we can write $Delta_{epsilon}$ as a product of $epsilon$ with the block matrix $Delta$ defined as;
$$Delta:=begin{pmatrix}
D_n\
D_{n-1}E_{1,n}\
D_{n-2}E_{2,n}\
vdots\
D_2E_{n-2,n}
end{pmatrix}
qquadtext{ so that}qquad
Delta_{epsilon}=Deltaepsilon.$$
The support of $Delta_{epsilon}$ is then the image of this block matrix. Note that the matrix $Delta$ above has $n$ columns and $binom{n}{2}$ rows, so the codimension of the support (i.e. the number of equations to define $mathcal{S}$) grows quadratically as $n$ grows. The fact that the vector $(1,1,ldots,1)$ is in the kernel of $Delta$ shows that the codimension is in fact even larger; it turns out that the dimension of $mathcal{S}$ equals $n-1$, and so you will need $binom{n}{2}-(n-1)=binom{n-1}{2}$ equations to define $mathcal{S}$.
To make this a bit more tangible (if only for myself!), I'll illustrate the case $n=4$. Then
begin{eqnarray*}
D_4&=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1
end{pmatrix},
qquad
& D_3=begin{pmatrix}
1&-1&hphantom{-}0\
1&hphantom{-}0&-1
end{pmatrix},
qquad
& D_2=begin{pmatrix}
1&-1
end{pmatrix}\
& &E_{1,4}=begin{pmatrix}
0&1&0&0\
0&0&1&0\
0&0&0&1
end{pmatrix},qquad
&E_{2,4}=begin{pmatrix}
0&0&1&0\
0&0&0&1\
end{pmatrix}.
end{eqnarray*}
Then the block matrix is given by
$$Delta:=begin{pmatrix}
D_4\
D_3E_{1,4}\
D_2E_{2,4}
end{pmatrix}
=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1\
0&hphantom{-}1&-1&hphantom{-}0\
0&hphantom{-}1&hphantom{-}0&-1\
0&hphantom{-}0&hphantom{-}1&-1
end{pmatrix}.$$
Then an arbitrary vector $epsilon=(epsilon_1,epsilon_2,epsilon_3,epsilon_4)inBbb{R}^4$ is mapped to
$$Deltaepsilon=(e_1-e_2,e_1-e_3,e_1-e_4,e_2-e_3,e_2-e_4,e_3-e_4).$$
The image of $Delta$, which is the same as the support $mathcal{S}$, is then the subspace of $Bbb{R}^6$ defined by
$$x_1-x_2+x_4=0,qquad x_1-x_3+x_5=0,qquad x_2-x_3+x_5=0.$$
$endgroup$
add a comment |
$begingroup$
For every positive integer $n$ define the $ntimes(n-1)$-matrix $D_n$ as
$$D_n:=begin{pmatrix}
1&-1&hphantom{-}0&cdots&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&cdots&hphantom{-}0&hphantom{-}0\
vdots&hphantom{-}vdots&hphantom{-}vdots&ddots&hphantom{-}vdots&hphantom{-}vdots\
1&hphantom{-}0&hphantom{-}0&cdots&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&cdots&hphantom{-}0&-1
end{pmatrix}.$$
Then for any vector $epsilon=(e_1,ldots,e_n)inBbb{R}^n$ you have
$$D_nepsilon=(e_1-e_2,e_1-e_3,ldots,e_1-e_n).$$
Now you want $Delta_{epsilon}$ to be, up to signs and ordering, the concatenation of the vectors
$$D_n(e_1,ldots,e_n),quad D_{n-1}(e_2,ldots,e_n),quad D_{n-2}(e_3,ldots,e_n), qquadldots,qquad D_2(e_{n-1},e_n).$$
Note that these vectors of the form $(e_m,ldots,e_n)$ can be written as a product $(0_{(n-m)times m}|I_{n-m})epsilon$ where $0_{(n-m)times m}$ denotes the $(n-m)times m$-matix with all zeros, and $I_{n-m}$ the square identity matrix of size $n-m$. This makes the matrix $E_{m,n}:=(0_{(n-m)times m}|I_{n-m})$ an $(m-n)times n$-matrix, and so we can write $Delta_{epsilon}$ as a product of $epsilon$ with the block matrix $Delta$ defined as;
$$Delta:=begin{pmatrix}
D_n\
D_{n-1}E_{1,n}\
D_{n-2}E_{2,n}\
vdots\
D_2E_{n-2,n}
end{pmatrix}
qquadtext{ so that}qquad
Delta_{epsilon}=Deltaepsilon.$$
The support of $Delta_{epsilon}$ is then the image of this block matrix. Note that the matrix $Delta$ above has $n$ columns and $binom{n}{2}$ rows, so the codimension of the support (i.e. the number of equations to define $mathcal{S}$) grows quadratically as $n$ grows. The fact that the vector $(1,1,ldots,1)$ is in the kernel of $Delta$ shows that the codimension is in fact even larger; it turns out that the dimension of $mathcal{S}$ equals $n-1$, and so you will need $binom{n}{2}-(n-1)=binom{n-1}{2}$ equations to define $mathcal{S}$.
To make this a bit more tangible (if only for myself!), I'll illustrate the case $n=4$. Then
begin{eqnarray*}
D_4&=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1
end{pmatrix},
qquad
& D_3=begin{pmatrix}
1&-1&hphantom{-}0\
1&hphantom{-}0&-1
end{pmatrix},
qquad
& D_2=begin{pmatrix}
1&-1
end{pmatrix}\
& &E_{1,4}=begin{pmatrix}
0&1&0&0\
0&0&1&0\
0&0&0&1
end{pmatrix},qquad
&E_{2,4}=begin{pmatrix}
0&0&1&0\
0&0&0&1\
end{pmatrix}.
end{eqnarray*}
Then the block matrix is given by
$$Delta:=begin{pmatrix}
D_4\
D_3E_{1,4}\
D_2E_{2,4}
end{pmatrix}
=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1\
0&hphantom{-}1&-1&hphantom{-}0\
0&hphantom{-}1&hphantom{-}0&-1\
0&hphantom{-}0&hphantom{-}1&-1
end{pmatrix}.$$
Then an arbitrary vector $epsilon=(epsilon_1,epsilon_2,epsilon_3,epsilon_4)inBbb{R}^4$ is mapped to
$$Deltaepsilon=(e_1-e_2,e_1-e_3,e_1-e_4,e_2-e_3,e_2-e_4,e_3-e_4).$$
The image of $Delta$, which is the same as the support $mathcal{S}$, is then the subspace of $Bbb{R}^6$ defined by
$$x_1-x_2+x_4=0,qquad x_1-x_3+x_5=0,qquad x_2-x_3+x_5=0.$$
$endgroup$
add a comment |
$begingroup$
For every positive integer $n$ define the $ntimes(n-1)$-matrix $D_n$ as
$$D_n:=begin{pmatrix}
1&-1&hphantom{-}0&cdots&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&cdots&hphantom{-}0&hphantom{-}0\
vdots&hphantom{-}vdots&hphantom{-}vdots&ddots&hphantom{-}vdots&hphantom{-}vdots\
1&hphantom{-}0&hphantom{-}0&cdots&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&cdots&hphantom{-}0&-1
end{pmatrix}.$$
Then for any vector $epsilon=(e_1,ldots,e_n)inBbb{R}^n$ you have
$$D_nepsilon=(e_1-e_2,e_1-e_3,ldots,e_1-e_n).$$
Now you want $Delta_{epsilon}$ to be, up to signs and ordering, the concatenation of the vectors
$$D_n(e_1,ldots,e_n),quad D_{n-1}(e_2,ldots,e_n),quad D_{n-2}(e_3,ldots,e_n), qquadldots,qquad D_2(e_{n-1},e_n).$$
Note that these vectors of the form $(e_m,ldots,e_n)$ can be written as a product $(0_{(n-m)times m}|I_{n-m})epsilon$ where $0_{(n-m)times m}$ denotes the $(n-m)times m$-matix with all zeros, and $I_{n-m}$ the square identity matrix of size $n-m$. This makes the matrix $E_{m,n}:=(0_{(n-m)times m}|I_{n-m})$ an $(m-n)times n$-matrix, and so we can write $Delta_{epsilon}$ as a product of $epsilon$ with the block matrix $Delta$ defined as;
$$Delta:=begin{pmatrix}
D_n\
D_{n-1}E_{1,n}\
D_{n-2}E_{2,n}\
vdots\
D_2E_{n-2,n}
end{pmatrix}
qquadtext{ so that}qquad
Delta_{epsilon}=Deltaepsilon.$$
The support of $Delta_{epsilon}$ is then the image of this block matrix. Note that the matrix $Delta$ above has $n$ columns and $binom{n}{2}$ rows, so the codimension of the support (i.e. the number of equations to define $mathcal{S}$) grows quadratically as $n$ grows. The fact that the vector $(1,1,ldots,1)$ is in the kernel of $Delta$ shows that the codimension is in fact even larger; it turns out that the dimension of $mathcal{S}$ equals $n-1$, and so you will need $binom{n}{2}-(n-1)=binom{n-1}{2}$ equations to define $mathcal{S}$.
To make this a bit more tangible (if only for myself!), I'll illustrate the case $n=4$. Then
begin{eqnarray*}
D_4&=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1
end{pmatrix},
qquad
& D_3=begin{pmatrix}
1&-1&hphantom{-}0\
1&hphantom{-}0&-1
end{pmatrix},
qquad
& D_2=begin{pmatrix}
1&-1
end{pmatrix}\
& &E_{1,4}=begin{pmatrix}
0&1&0&0\
0&0&1&0\
0&0&0&1
end{pmatrix},qquad
&E_{2,4}=begin{pmatrix}
0&0&1&0\
0&0&0&1\
end{pmatrix}.
end{eqnarray*}
Then the block matrix is given by
$$Delta:=begin{pmatrix}
D_4\
D_3E_{1,4}\
D_2E_{2,4}
end{pmatrix}
=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1\
0&hphantom{-}1&-1&hphantom{-}0\
0&hphantom{-}1&hphantom{-}0&-1\
0&hphantom{-}0&hphantom{-}1&-1
end{pmatrix}.$$
Then an arbitrary vector $epsilon=(epsilon_1,epsilon_2,epsilon_3,epsilon_4)inBbb{R}^4$ is mapped to
$$Deltaepsilon=(e_1-e_2,e_1-e_3,e_1-e_4,e_2-e_3,e_2-e_4,e_3-e_4).$$
The image of $Delta$, which is the same as the support $mathcal{S}$, is then the subspace of $Bbb{R}^6$ defined by
$$x_1-x_2+x_4=0,qquad x_1-x_3+x_5=0,qquad x_2-x_3+x_5=0.$$
$endgroup$
For every positive integer $n$ define the $ntimes(n-1)$-matrix $D_n$ as
$$D_n:=begin{pmatrix}
1&-1&hphantom{-}0&cdots&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&cdots&hphantom{-}0&hphantom{-}0\
vdots&hphantom{-}vdots&hphantom{-}vdots&ddots&hphantom{-}vdots&hphantom{-}vdots\
1&hphantom{-}0&hphantom{-}0&cdots&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&cdots&hphantom{-}0&-1
end{pmatrix}.$$
Then for any vector $epsilon=(e_1,ldots,e_n)inBbb{R}^n$ you have
$$D_nepsilon=(e_1-e_2,e_1-e_3,ldots,e_1-e_n).$$
Now you want $Delta_{epsilon}$ to be, up to signs and ordering, the concatenation of the vectors
$$D_n(e_1,ldots,e_n),quad D_{n-1}(e_2,ldots,e_n),quad D_{n-2}(e_3,ldots,e_n), qquadldots,qquad D_2(e_{n-1},e_n).$$
Note that these vectors of the form $(e_m,ldots,e_n)$ can be written as a product $(0_{(n-m)times m}|I_{n-m})epsilon$ where $0_{(n-m)times m}$ denotes the $(n-m)times m$-matix with all zeros, and $I_{n-m}$ the square identity matrix of size $n-m$. This makes the matrix $E_{m,n}:=(0_{(n-m)times m}|I_{n-m})$ an $(m-n)times n$-matrix, and so we can write $Delta_{epsilon}$ as a product of $epsilon$ with the block matrix $Delta$ defined as;
$$Delta:=begin{pmatrix}
D_n\
D_{n-1}E_{1,n}\
D_{n-2}E_{2,n}\
vdots\
D_2E_{n-2,n}
end{pmatrix}
qquadtext{ so that}qquad
Delta_{epsilon}=Deltaepsilon.$$
The support of $Delta_{epsilon}$ is then the image of this block matrix. Note that the matrix $Delta$ above has $n$ columns and $binom{n}{2}$ rows, so the codimension of the support (i.e. the number of equations to define $mathcal{S}$) grows quadratically as $n$ grows. The fact that the vector $(1,1,ldots,1)$ is in the kernel of $Delta$ shows that the codimension is in fact even larger; it turns out that the dimension of $mathcal{S}$ equals $n-1$, and so you will need $binom{n}{2}-(n-1)=binom{n-1}{2}$ equations to define $mathcal{S}$.
To make this a bit more tangible (if only for myself!), I'll illustrate the case $n=4$. Then
begin{eqnarray*}
D_4&=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1
end{pmatrix},
qquad
& D_3=begin{pmatrix}
1&-1&hphantom{-}0\
1&hphantom{-}0&-1
end{pmatrix},
qquad
& D_2=begin{pmatrix}
1&-1
end{pmatrix}\
& &E_{1,4}=begin{pmatrix}
0&1&0&0\
0&0&1&0\
0&0&0&1
end{pmatrix},qquad
&E_{2,4}=begin{pmatrix}
0&0&1&0\
0&0&0&1\
end{pmatrix}.
end{eqnarray*}
Then the block matrix is given by
$$Delta:=begin{pmatrix}
D_4\
D_3E_{1,4}\
D_2E_{2,4}
end{pmatrix}
=begin{pmatrix}
1&-1&hphantom{-}0&hphantom{-}0\
1&hphantom{-}0&-1&hphantom{-}0\
1&hphantom{-}0&hphantom{-}0&-1\
0&hphantom{-}1&-1&hphantom{-}0\
0&hphantom{-}1&hphantom{-}0&-1\
0&hphantom{-}0&hphantom{-}1&-1
end{pmatrix}.$$
Then an arbitrary vector $epsilon=(epsilon_1,epsilon_2,epsilon_3,epsilon_4)inBbb{R}^4$ is mapped to
$$Deltaepsilon=(e_1-e_2,e_1-e_3,e_1-e_4,e_2-e_3,e_2-e_4,e_3-e_4).$$
The image of $Delta$, which is the same as the support $mathcal{S}$, is then the subspace of $Bbb{R}^6$ defined by
$$x_1-x_2+x_4=0,qquad x_1-x_3+x_5=0,qquad x_2-x_3+x_5=0.$$
edited Feb 7 at 9:19
answered Feb 7 at 8:49
ServaesServaes
26.4k33997
26.4k33997
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3068569%2fgeneralise-to-any-dimension-some-notation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
The problem is not the definition of $mathcal A$, but the definition of $Deltaepsilon$. The sets ${x_0,x_1}$ and ${x_1,x_0}$ are the same set, so $Deltaepsilon$ is ill-defined. (Of course, you can fix this by just taking the absolute value of the difference, and mentioning in a footnote that the sign doesn't matter here.)
$endgroup$
– Deusovi
Jan 10 at 17:55
$begingroup$
Thanks. I see the point. Still, any definition of $Delta epsilon$ is OK with me. But then how do I write $mathcal{S}$ in general?
$endgroup$
– STF
Jan 10 at 19:05