Euler characteristic of this polyhedron?
Clash Royale CLAN TAG#URR8PPP
$begingroup$
I´m trying to obtain the Euler characteristic of this polyhedron $P$, that is homeomorphic to the torus $T$ (I think):
So it should be $mathcalX(P)=mathcalX(T)=0$.
But we get $V=16, F=10, E=24$, so $mathcalX(P)=2$.
However, if we consider a triangulation as this two cases:
it is $mathcalX(P)=0$, because $V=C=16$ and $E=32$, and $V=16, F=32, E=48$, respectively.
So, what is it wrong?
Thanks for the support!
algebraic-topology
edited Feb 18 at 13:10
J. W. Tanner
3,2401320
asked Feb 18 at 10:35
LH8LH8
1438
$endgroup$
add a comment |
$begingroup$
I´m trying to obtain the Euler characteristic of this polyhedron $P$, that is homeomorphic to the torus $T$ (I think):
So it should be $mathcalX(P)=mathcalX(T)=0$.
But we get $V=16, F=10, E=24$, so $mathcalX(P)=2$.
However, if we consider a triangulation as this two cases:
it is $mathcalX(P)=0$, because $V=C=16$ and $E=32$, and $V=16, F=32, E=48$, respectively.
So, what is it wrong?
Thanks for the support!
algebraic-topology
edited Feb 18 at 13:10
J. W. Tanner
3,2401320
asked Feb 18 at 10:35
LH8LH8
1438
$endgroup$
$begingroup$
The leftmost image in the second figure a quadrangulation, not a triangulation!
$endgroup$
– Pedro Tamaroff♦
Feb 18 at 10:39
$begingroup$
Ok, I really notice that a triangulation can be done for any convex polygon.
$endgroup$
– LH8
Feb 18 at 10:43
add a comment |
$begingroup$
I´m trying to obtain the Euler characteristic of this polyhedron $P$, that is homeomorphic to the torus $T$ (I think):
So it should be $mathcalX(P)=mathcalX(T)=0$.
But we get $V=16, F=10, E=24$, so $mathcalX(P)=2$.
However, if we consider a triangulation as this two cases:
it is $mathcalX(P)=0$, because $V=C=16$ and $E=32$, and $V=16, F=32, E=48$, respectively.
So, what is it wrong?
Thanks for the support!
algebraic-topology
edited Feb 18 at 13:10
J. W. Tanner
3,2401320
asked Feb 18 at 10:35
LH8LH8
1438
$endgroup$
I´m trying to obtain the Euler characteristic of this polyhedron $P$, that is homeomorphic to the torus $T$ (I think):
So it should be $mathcalX(P)=mathcalX(T)=0$.
But we get $V=16, F=10, E=24$, so $mathcalX(P)=2$.
However, if we consider a triangulation as this two cases:
it is $mathcalX(P)=0$, because $V=C=16$ and $E=32$, and $V=16, F=32, E=48$, respectively.
So, what is it wrong?
Thanks for the support!
algebraic-topology
algebraic-topology
edited Feb 18 at 13:10
J. W. Tanner
3,2401320
asked Feb 18 at 10:35
LH8LH8
1438
edited Feb 18 at 13:10
J. W. Tanner
3,2401320
asked Feb 18 at 10:35
LH8LH8
1438
edited Feb 18 at 13:10
J. W. Tanner
3,2401320
edited Feb 18 at 13:10
J. W. Tanner
3,2401320
edited Feb 18 at 13:10
J. W. Tanner
3,2401320
3,2401320
asked Feb 18 at 10:35
LH8LH8
1438
asked Feb 18 at 10:35
LH8LH8
1438
asked Feb 18 at 10:35
LH8LH8
1438
1438
$begingroup$
The leftmost image in the second figure a quadrangulation, not a triangulation!
$endgroup$
– Pedro Tamaroff♦
Feb 18 at 10:39
$begingroup$
Ok, I really notice that a triangulation can be done for any convex polygon.
$endgroup$
– LH8
Feb 18 at 10:43
add a comment |
$begingroup$
The leftmost image in the second figure a quadrangulation, not a triangulation!
$endgroup$
– Pedro Tamaroff♦
Feb 18 at 10:39
$begingroup$
Ok, I really notice that a triangulation can be done for any convex polygon.
$endgroup$
– LH8
Feb 18 at 10:43
$begingroup$
The leftmost image in the second figure a quadrangulation, not a triangulation!
$endgroup$
– Pedro Tamaroff♦
Feb 18 at 10:39
$begingroup$
The leftmost image in the second figure a quadrangulation, not a triangulation!
$endgroup$
– Pedro Tamaroff♦
Feb 18 at 10:39
$begingroup$
Ok, I really notice that a triangulation can be done for any convex polygon.
$endgroup$
– LH8
Feb 18 at 10:43
$begingroup$
Ok, I really notice that a triangulation can be done for any convex polygon.
$endgroup$
– LH8
Feb 18 at 10:43
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The problem is that your first polygon setup uses non-simple polygons. add single edge to each donut shaped face and it will work better.
Cauchy's basic proof for Euler's formula for characteristic requires that we triangulate the polygons and takes advantage of a particular property of this triangulation: adding a single edge via splitting a polygon must also add a single face. This is true of simple polygons, yes, but complex polygons like the donut shape don't have this property: adding an edge may not split the polygon into two.
answered Feb 18 at 10:38
Dan UznanskiDan Uznanski
6,94521528
$endgroup$
$begingroup$
Yes, that´s what I do in the first triangulation, yeah? But what means non-simple polygons? Maybe you mean convex? In what sense it disturb a Euler characteristic? Since it´s homeomorphic to the torus, they should have same Euler characteristic, directly. Thanks!
$endgroup$
– LH8
Feb 18 at 10:39
$begingroup$
Your polygons on the 'top' and 'bottom' goes around the hole in the torus. This is not allowed since then they are not contractable.
$endgroup$
– An.Ditlev
Feb 18 at 10:48
$begingroup$
So, a polyedron has different Euler characteristic depending the triangulation? I´m confuse. Thanks.
$endgroup$
– LH8
Feb 18 at 11:19
1
$begingroup$
Not at all: all triangulations of a polyhedron should have the same Euler characteristic... But in order to get an Euler characteristic that makes sense all the polygons need to be simple. A triangle within a triangle doesn't have the same layout as a hexagon, despite having technically the same number of edges and vertices.
$endgroup$
– Dan Uznanski
Feb 18 at 11:24
3
$begingroup$
"Simple" here is "simply connected", meaning you can draw any loop in the polygon and shrink it down to a point without crossing any boundaries. That does not work for your top and bottom faces without triangulation, because a loop drawn around the inner boundary gets "trapped" around that boundary. Cutting the faces from inside to outside, thus excluding those offending loops, is what makes the faces simply connected again.
$endgroup$
– Oscar Lanzi
Feb 18 at 12:19
|
show 1 more 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%2f3117423%2feuler-characteristic-of-this-polyhedron%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$
The problem is that your first polygon setup uses non-simple polygons. add single edge to each donut shaped face and it will work better.
Cauchy's basic proof for Euler's formula for characteristic requires that we triangulate the polygons and takes advantage of a particular property of this triangulation: adding a single edge via splitting a polygon must also add a single face. This is true of simple polygons, yes, but complex polygons like the donut shape don't have this property: adding an edge may not split the polygon into two.
answered Feb 18 at 10:38
Dan UznanskiDan Uznanski
6,94521528
$endgroup$
$begingroup$
Yes, that´s what I do in the first triangulation, yeah? But what means non-simple polygons? Maybe you mean convex? In what sense it disturb a Euler characteristic? Since it´s homeomorphic to the torus, they should have same Euler characteristic, directly. Thanks!
$endgroup$
– LH8
Feb 18 at 10:39
$begingroup$
Your polygons on the 'top' and 'bottom' goes around the hole in the torus. This is not allowed since then they are not contractable.
$endgroup$
– An.Ditlev
Feb 18 at 10:48
$begingroup$
So, a polyedron has different Euler characteristic depending the triangulation? I´m confuse. Thanks.
$endgroup$
– LH8
Feb 18 at 11:19
1
$begingroup$
Not at all: all triangulations of a polyhedron should have the same Euler characteristic... But in order to get an Euler characteristic that makes sense all the polygons need to be simple. A triangle within a triangle doesn't have the same layout as a hexagon, despite having technically the same number of edges and vertices.
$endgroup$
– Dan Uznanski
Feb 18 at 11:24
3
$begingroup$
"Simple" here is "simply connected", meaning you can draw any loop in the polygon and shrink it down to a point without crossing any boundaries. That does not work for your top and bottom faces without triangulation, because a loop drawn around the inner boundary gets "trapped" around that boundary. Cutting the faces from inside to outside, thus excluding those offending loops, is what makes the faces simply connected again.
$endgroup$
– Oscar Lanzi
Feb 18 at 12:19
|
show 1 more comment
$begingroup$
The problem is that your first polygon setup uses non-simple polygons. add single edge to each donut shaped face and it will work better.
Cauchy's basic proof for Euler's formula for characteristic requires that we triangulate the polygons and takes advantage of a particular property of this triangulation: adding a single edge via splitting a polygon must also add a single face. This is true of simple polygons, yes, but complex polygons like the donut shape don't have this property: adding an edge may not split the polygon into two.
answered Feb 18 at 10:38
Dan UznanskiDan Uznanski
6,94521528
$endgroup$
$begingroup$
Yes, that´s what I do in the first triangulation, yeah? But what means non-simple polygons? Maybe you mean convex? In what sense it disturb a Euler characteristic? Since it´s homeomorphic to the torus, they should have same Euler characteristic, directly. Thanks!
$endgroup$
– LH8
Feb 18 at 10:39
$begingroup$
Your polygons on the 'top' and 'bottom' goes around the hole in the torus. This is not allowed since then they are not contractable.
$endgroup$
– An.Ditlev
Feb 18 at 10:48
$begingroup$
So, a polyedron has different Euler characteristic depending the triangulation? I´m confuse. Thanks.
$endgroup$
– LH8
Feb 18 at 11:19
1
$begingroup$
Not at all: all triangulations of a polyhedron should have the same Euler characteristic... But in order to get an Euler characteristic that makes sense all the polygons need to be simple. A triangle within a triangle doesn't have the same layout as a hexagon, despite having technically the same number of edges and vertices.
$endgroup$
– Dan Uznanski
Feb 18 at 11:24
3
$begingroup$
"Simple" here is "simply connected", meaning you can draw any loop in the polygon and shrink it down to a point without crossing any boundaries. That does not work for your top and bottom faces without triangulation, because a loop drawn around the inner boundary gets "trapped" around that boundary. Cutting the faces from inside to outside, thus excluding those offending loops, is what makes the faces simply connected again.
$endgroup$
– Oscar Lanzi
Feb 18 at 12:19
|
show 1 more comment
$begingroup$
The problem is that your first polygon setup uses non-simple polygons. add single edge to each donut shaped face and it will work better.
Cauchy's basic proof for Euler's formula for characteristic requires that we triangulate the polygons and takes advantage of a particular property of this triangulation: adding a single edge via splitting a polygon must also add a single face. This is true of simple polygons, yes, but complex polygons like the donut shape don't have this property: adding an edge may not split the polygon into two.
answered Feb 18 at 10:38
Dan UznanskiDan Uznanski
6,94521528
$endgroup$
The problem is that your first polygon setup uses non-simple polygons. add single edge to each donut shaped face and it will work better.
Cauchy's basic proof for Euler's formula for characteristic requires that we triangulate the polygons and takes advantage of a particular property of this triangulation: adding a single edge via splitting a polygon must also add a single face. This is true of simple polygons, yes, but complex polygons like the donut shape don't have this property: adding an edge may not split the polygon into two.
answered Feb 18 at 10:38
Dan UznanskiDan Uznanski
6,94521528
edited Feb 18 at 10:48
answered Feb 18 at 10:38
Dan UznanskiDan Uznanski
6,94521528
answered Feb 18 at 10:38
Dan UznanskiDan Uznanski
6,94521528
answered Feb 18 at 10:38
Dan UznanskiDan Uznanski
6,94521528
6,94521528
$begingroup$
Yes, that´s what I do in the first triangulation, yeah? But what means non-simple polygons? Maybe you mean convex? In what sense it disturb a Euler characteristic? Since it´s homeomorphic to the torus, they should have same Euler characteristic, directly. Thanks!
$endgroup$
– LH8
Feb 18 at 10:39
$begingroup$
Your polygons on the 'top' and 'bottom' goes around the hole in the torus. This is not allowed since then they are not contractable.
$endgroup$
– An.Ditlev
Feb 18 at 10:48
$begingroup$
So, a polyedron has different Euler characteristic depending the triangulation? I´m confuse. Thanks.
$endgroup$
– LH8
Feb 18 at 11:19
1
$begingroup$
Not at all: all triangulations of a polyhedron should have the same Euler characteristic... But in order to get an Euler characteristic that makes sense all the polygons need to be simple. A triangle within a triangle doesn't have the same layout as a hexagon, despite having technically the same number of edges and vertices.
$endgroup$
– Dan Uznanski
Feb 18 at 11:24
3
$begingroup$
"Simple" here is "simply connected", meaning you can draw any loop in the polygon and shrink it down to a point without crossing any boundaries. That does not work for your top and bottom faces without triangulation, because a loop drawn around the inner boundary gets "trapped" around that boundary. Cutting the faces from inside to outside, thus excluding those offending loops, is what makes the faces simply connected again.
$endgroup$
– Oscar Lanzi
Feb 18 at 12:19
|
show 1 more comment
$begingroup$
Yes, that´s what I do in the first triangulation, yeah? But what means non-simple polygons? Maybe you mean convex? In what sense it disturb a Euler characteristic? Since it´s homeomorphic to the torus, they should have same Euler characteristic, directly. Thanks!
$endgroup$
– LH8
Feb 18 at 10:39
$begingroup$
Your polygons on the 'top' and 'bottom' goes around the hole in the torus. This is not allowed since then they are not contractable.
$endgroup$
– An.Ditlev
Feb 18 at 10:48
$begingroup$
So, a polyedron has different Euler characteristic depending the triangulation? I´m confuse. Thanks.
$endgroup$
– LH8
Feb 18 at 11:19
1
$begingroup$
Not at all: all triangulations of a polyhedron should have the same Euler characteristic... But in order to get an Euler characteristic that makes sense all the polygons need to be simple. A triangle within a triangle doesn't have the same layout as a hexagon, despite having technically the same number of edges and vertices.
$endgroup$
– Dan Uznanski
Feb 18 at 11:24
3
$begingroup$
"Simple" here is "simply connected", meaning you can draw any loop in the polygon and shrink it down to a point without crossing any boundaries. That does not work for your top and bottom faces without triangulation, because a loop drawn around the inner boundary gets "trapped" around that boundary. Cutting the faces from inside to outside, thus excluding those offending loops, is what makes the faces simply connected again.
$endgroup$
– Oscar Lanzi
Feb 18 at 12:19
$begingroup$
Yes, that´s what I do in the first triangulation, yeah? But what means non-simple polygons? Maybe you mean convex? In what sense it disturb a Euler characteristic? Since it´s homeomorphic to the torus, they should have same Euler characteristic, directly. Thanks!
$endgroup$
– LH8
Feb 18 at 10:39
$begingroup$
Yes, that´s what I do in the first triangulation, yeah? But what means non-simple polygons? Maybe you mean convex? In what sense it disturb a Euler characteristic? Since it´s homeomorphic to the torus, they should have same Euler characteristic, directly. Thanks!
$endgroup$
– LH8
Feb 18 at 10:39
$begingroup$
Your polygons on the 'top' and 'bottom' goes around the hole in the torus. This is not allowed since then they are not contractable.
$endgroup$
– An.Ditlev
Feb 18 at 10:48
$begingroup$
Your polygons on the 'top' and 'bottom' goes around the hole in the torus. This is not allowed since then they are not contractable.
$endgroup$
– An.Ditlev
Feb 18 at 10:48
$begingroup$
So, a polyedron has different Euler characteristic depending the triangulation? I´m confuse. Thanks.
$endgroup$
– LH8
Feb 18 at 11:19
$begingroup$
So, a polyedron has different Euler characteristic depending the triangulation? I´m confuse. Thanks.
$endgroup$
– LH8
Feb 18 at 11:19
1
1
$begingroup$
Not at all: all triangulations of a polyhedron should have the same Euler characteristic... But in order to get an Euler characteristic that makes sense all the polygons need to be simple. A triangle within a triangle doesn't have the same layout as a hexagon, despite having technically the same number of edges and vertices.
$endgroup$
– Dan Uznanski
Feb 18 at 11:24
$begingroup$
Not at all: all triangulations of a polyhedron should have the same Euler characteristic... But in order to get an Euler characteristic that makes sense all the polygons need to be simple. A triangle within a triangle doesn't have the same layout as a hexagon, despite having technically the same number of edges and vertices.
$endgroup$
– Dan Uznanski
Feb 18 at 11:24
3
3
$begingroup$
"Simple" here is "simply connected", meaning you can draw any loop in the polygon and shrink it down to a point without crossing any boundaries. That does not work for your top and bottom faces without triangulation, because a loop drawn around the inner boundary gets "trapped" around that boundary. Cutting the faces from inside to outside, thus excluding those offending loops, is what makes the faces simply connected again.
$endgroup$
– Oscar Lanzi
Feb 18 at 12:19
$begingroup$
"Simple" here is "simply connected", meaning you can draw any loop in the polygon and shrink it down to a point without crossing any boundaries. That does not work for your top and bottom faces without triangulation, because a loop drawn around the inner boundary gets "trapped" around that boundary. Cutting the faces from inside to outside, thus excluding those offending loops, is what makes the faces simply connected again.
$endgroup$
– Oscar Lanzi
Feb 18 at 12:19
|
show 1 more 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%2f3117423%2feuler-characteristic-of-this-polyhedron%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
$begingroup$
The leftmost image in the second figure a quadrangulation, not a triangulation!
$endgroup$
– Pedro Tamaroff♦
Feb 18 at 10:39
$begingroup$
Ok, I really notice that a triangulation can be done for any convex polygon.
$endgroup$
– LH8
Feb 18 at 10:43