The First Theorem of Graph Theory

What this all means:

This is a theorem which relates the number of edges in a graph to the degree of the vertices.

It is actually a very simple statement that just looks complicated because of the notation. The idea is this:

Why the fancy notation?

The need for the notation has to do with wanting to say, "When you count them all up, no matter how many there are..." This sounds just fine in conversational English, but could potentially have some loopholes for those who wish to be utterly, mathematically precise. How many is "all of them"? How will you know you have counted them all? Are you sure it doesn't matter how many there are? Mathematicians don't want to have to go back later and find that they didn't take everything into consideration, so they try to find absolutely clear, waterproof, doubtproof ways to express things.

Study what the symbols mean, and experiment with different ways of expressing the same thing. Once you get used to the symbol, it doesn't seem so intimidating or hard. Statements that look like this one are very common in mathematics, so learning to read this will help make formal mathematical statements seem less like a foreign language to you.

Decoding the notation

How you would read it?

"The sum of the degrees of all the vertices in a graph is equal to twice the number of edges."

Theorem and Proof

The statement that is made by the notation in the picture is the theorem. It is a theorem because it has been proved. Until it is proved, it is just a statement, although sometime it is called a claim, or a conjecture (depending on how confident the person making the statement is that it will turn out to be true.)

The proof of the First Theorm of Graph Theory is not presented here, because you can write a proof yourself and demonstrate once and for all that writing proofs doesn't have to be scary. Here's all you have to do:

Deduction and proof

A proof of the First Theorem of Graph Theory is likely to be a deductive proof, or a proof that relies on the technique called deduction (It wouldn't be very hard to think up an inductive proof, but deductive reasoning in this case is probably easier.)

At some point you are likely to say to yourself as you are thinking about this: Because each edge (or line) has two ends, I can be sure that... That is deductive reasoning. When the logical consequences of a true statement lead to other statements that must be true, the path of our thinking is deductive reasoning.