Proof clarification: Catalan numbers and lattice paths
$begingroup$
I'm reading a proof of the fact that the number of monotonic lattice paths from (0,0) to (n,n) not crossing over the diagonal y=x is given by the Catalan numbers. The proof uses the reflection technique (about y = x+1) that a number of other proofs seem to employ as well. That is, you find a bijection between the "bad" paths (ones crossing y = x) and the lattice paths from (0,0) to (n-1,n+1). However, I don't understand this part in the attached image about showing it is indeed a bijection. How does this establish that the reflection transformation described is one-to-one and onto? (In the text below, $mathcal{B}$ denotes the set of paths crossing the diagonal, and the lattice paths are described as binary strings in V and H, H denoting horizontal movements and V denoting vertical. The position $i$ refers to the $i$-th character in such a string.)
combinatorics proof-explanation integer-lattices catalan-numbers
edited Dec 30 '18 at 7:28
Alex Ravsky
42.5k32383
asked Dec 24 '18 at 22:57
Zain SiddiquiZain Siddiqui
645
$endgroup$
add a comment |
$begingroup$
I'm reading a proof of the fact that the number of monotonic lattice paths from (0,0) to (n,n) not crossing over the diagonal y=x is given by the Catalan numbers. The proof uses the reflection technique (about y = x+1) that a number of other proofs seem to employ as well. That is, you find a bijection between the "bad" paths (ones crossing y = x) and the lattice paths from (0,0) to (n-1,n+1). However, I don't understand this part in the attached image about showing it is indeed a bijection. How does this establish that the reflection transformation described is one-to-one and onto? (In the text below, $mathcal{B}$ denotes the set of paths crossing the diagonal, and the lattice paths are described as binary strings in V and H, H denoting horizontal movements and V denoting vertical. The position $i$ refers to the $i$-th character in such a string.)
combinatorics proof-explanation integer-lattices catalan-numbers
edited Dec 30 '18 at 7:28
Alex Ravsky
42.5k32383
asked Dec 24 '18 at 22:57
Zain SiddiquiZain Siddiqui
645
$endgroup$
add a comment |
$begingroup$
I'm reading a proof of the fact that the number of monotonic lattice paths from (0,0) to (n,n) not crossing over the diagonal y=x is given by the Catalan numbers. The proof uses the reflection technique (about y = x+1) that a number of other proofs seem to employ as well. That is, you find a bijection between the "bad" paths (ones crossing y = x) and the lattice paths from (0,0) to (n-1,n+1). However, I don't understand this part in the attached image about showing it is indeed a bijection. How does this establish that the reflection transformation described is one-to-one and onto? (In the text below, $mathcal{B}$ denotes the set of paths crossing the diagonal, and the lattice paths are described as binary strings in V and H, H denoting horizontal movements and V denoting vertical. The position $i$ refers to the $i$-th character in such a string.)
combinatorics proof-explanation integer-lattices catalan-numbers
edited Dec 30 '18 at 7:28
Alex Ravsky
42.5k32383
asked Dec 24 '18 at 22:57
Zain SiddiquiZain Siddiqui
645
$endgroup$
I'm reading a proof of the fact that the number of monotonic lattice paths from (0,0) to (n,n) not crossing over the diagonal y=x is given by the Catalan numbers. The proof uses the reflection technique (about y = x+1) that a number of other proofs seem to employ as well. That is, you find a bijection between the "bad" paths (ones crossing y = x) and the lattice paths from (0,0) to (n-1,n+1). However, I don't understand this part in the attached image about showing it is indeed a bijection. How does this establish that the reflection transformation described is one-to-one and onto? (In the text below, $mathcal{B}$ denotes the set of paths crossing the diagonal, and the lattice paths are described as binary strings in V and H, H denoting horizontal movements and V denoting vertical. The position $i$ refers to the $i$-th character in such a string.)
combinatorics proof-explanation integer-lattices catalan-numbers
combinatorics proof-explanation integer-lattices catalan-numbers
edited Dec 30 '18 at 7:28
Alex Ravsky
42.5k32383
asked Dec 24 '18 at 22:57
Zain SiddiquiZain Siddiqui
645
edited Dec 30 '18 at 7:28
Alex Ravsky
42.5k32383
asked Dec 24 '18 at 22:57
Zain SiddiquiZain Siddiqui
645
edited Dec 30 '18 at 7:28
Alex Ravsky
42.5k32383
edited Dec 30 '18 at 7:28
Alex Ravsky
42.5k32383
edited Dec 30 '18 at 7:28
Alex Ravsky
42.5k32383
42.5k32383
asked Dec 24 '18 at 22:57
Zain SiddiquiZain Siddiqui
645
asked Dec 24 '18 at 22:57
Zain SiddiquiZain Siddiqui
645
asked Dec 24 '18 at 22:57
Zain SiddiquiZain Siddiqui
645
645
add a comment |
add a comment |
0
active
oldest
votes
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%2f3051701%2fproof-clarification-catalan-numbers-and-lattice-paths%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3051701%2fproof-clarification-catalan-numbers-and-lattice-paths%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
