Greetings ladies and gentlemen! I am a new member in this well-structured and appropriately regulated community, introducing you to a general diagonal formula. I have shown few of my geometry teachers of this discovery; however, they disapprove of its use. Why do they disapprove of it? In addition, how can I further its use?
Our original, modern use of the formula for diagonal number (in the case of convex polygons).
Gen. Diagonal Formula
Where represents the total number of vertices in a given form or shape, and represents the number of adjacent vertices in a given form or shape.
Here a few identities for this formula
Where represents the number of non-adjacent vertices in a given form or shape
These formulas were primarily derived from this vertex identity.
Hello, brianjesusdiaz!
Welcime aboard!
I am introducing you to a general diagonal formula.
I have shown few of my geometry teachers of this discovery;
. . however, they disapprove of its use.
Why do they disapprove of it?
In addition, how can I further its use?
Our original, modern use of the formula for diagonal number.
. .
Did you test your formula?
We know that a square has two diagonals . . . right?
But your formula gives: .
So, your formula doesn't work!
. . And you wonder why they disapprove?
The number of diagonals in a polygon with sides
. . is: .
Your formula produces a number which is twice as large.
. . Here is the reason why.
You say there are choices for a vertex.
Then it can be connected to any of the other vertices.
Hence, there are possible diagonals.
Consider a pentagon with vertices
. .
It seems that there are ten diagonals.
But we note that and represent the same diagonal.
. . And: .
Since all the diagonals are duplicated,
. . we must divide by two.
Well, I tried to stick with the school textbooks statement of what denotes the index. was not the original variable I used to denote the number of adjacent vertices in a given form of shape. Would you mind showing the combination way?
Then how can you stretch this formula to dimensions above two?
A friend of mine demonstrated that with prisms...
is total number of vertices of a given prism.
However this lacks usage, the fact that it only functions for prisms. The general formula for diagonals, which is in the first post, not only connects pyramids and concave shapes and forms, but dimensions above three as well.
Let me state a proof for this equation. I may have misunderstood you, or vice versa, by the division of two, so let me restate myself...
Proof(?):
Hopefully, we're familiar with this two dimensional
The fallacy with this formula is that it is only attributed to a two dimensional field. Finding a general formula is the case here.
Alright, we want to find a diagonal formula for a cube. Would we use the 2D formula? Of course not!
Let's take a cube.
We would take two bases, using the 2D formula for both. For the exterior center bases, including the inside, we would use this formula.
Add the formulas together
Here I would use an identity. A polygon and its prism counterpart are related in that a polygon's # of sides equal to the number of vertices of its prism counterpart divided by two.
With this in mind, let's return to our equation.
Would this function with pyramids? Any concave shape? Well no...the fact that this formula was derived from prisms, it only functions for prisms.
In addition, as we enter dimensions above three, we realize this function has no use. Therefore, a general formula must be established.
The constant we see in two and three dimensions is 3 and 4 respectively.
Let's call this constant .
In addition, we see a relationship involving vertices.
Where represents the total number of vertices in a given form or shape, represents the number of adjacent vertices in a given form or shape, and represents the number of non-adjacent vertices in a given form or shape
With this in mind.
Back to the Equation.
Lets define this.
Alright, we jotted down two dimensions and three dimensions. Let's add the fourth.
We take a tesseract for example.
We see that there are a total of 16 vertices, and 5 adjacent vertices for each given vertex.
This is also intertwined with Euler's characteristic.
Who minds this?
Side-note: The number of sides of a polygon is equal to its number of vertices.
Therefore
This equation is used for geometry and probability purposes. If anyone can find other uses for this, thank you.
-Brian Diaz
Since I am disallowed from editing the previous message, I would also like to state that in order to move up to concave shapes, you need to define "diagonal". A simple formula
Where is equal to total number of interior diagonals, and with this fact stated, it is no wonder why interior diagonals just equal to total number of diagonals ( ).
Of course, represents no other than exterior diagonals.
For example...
In the first image, I am using the right two.
If I am looking for interiors (using the middle image), it would be only one.
But for both...
Absolutely sounds ridiculous, however, it helps to deal with ideas of what we refer to as a "diagonal".
For the right image, obviously it's zero. In the interior diagonals.
If looking for total diagonals, we would have two.
-Brian Diaz