Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In Tao's book Analysis 1, he writes:

Thus, from the point of view of logic, we can define equality on a [remark by myself: I think he forgot the word "type of object" here] however we please, so long as it obeys the reflexive, symmetry, and transitive axioms, and it is consistent with all other operations on the class of objects under discussion in the sense that the substitution axiom was true for all of those operations.

Does he mean that, if one wants to define define equality on a specific type of object (like functions, ordered pairs, for example), one has to check that these axioms of equality (he refers to these four axioms of equality as "symmetry", "reflexivity", "transitivity", and "substitution") hold in the sense that one has to prove them? It seems so, because of these two passages:

[In section 3.3 Functions] We observe that functions obey the axiom of substitution: if $x=x'$, then $f(x) = f(x')$ (why?).

(My answer would be "because that's an axiom", but Tao apparently wouldn't accept that.)

And after defining equality of sets ($A=B:\iff \forall x(x\in A\iff x\in B)$), Tao writes (on page 39):

One can easily verify that this notion of equality is reflexive, symmetric, and transitive (Exercise 3.1.1). Observe that if $x\in A$ and $A = B$, then $x\in B$, by Definition 3.1.4. Thus the "is an element of" relation $\in $ obeys the axiom of substitution

So he gives the exercise to prove the axioms of equality for sets. Why does one has to prove axioms? Or, put differently: if one can prove these things, why does he state them as axioms?

share|cite|improve this question
1  
The "general" axioms of equality (the four fundamental axioms) define the properties that we expect that have to holds between mathematical objects.. With sets we define e new relation : $A=B$ in terms of the fundamental set-relation ($\in$). We want that this newly defined relation "behaves well" i.e. we want that it satisfies the axioms of equality. If so, we can use it freely in the context of set theory because it satisfy the fundamental rules. – Mauro ALLEGRANZA 10 hours ago
    
@MauroALLEGRANZA: Your comment just states the view that one has to check axioms rather than answers my question as to why one has to check/prove axioms. So it doesn't help at all. – user7280899 10 hours ago
    
Two possible approach : "standard" axiomatic set th like ZFC : first-order language with equality. Equality is part of the underlying logic, and thus it is "already there" with its axioms. We have Ax of Extensionality defining a condition for checkin when two sets are equal. – Mauro ALLEGRANZA 10 hours ago
1  
Alternative approach : see Mendelson : f-o language without equality. Equality is defined : $X=Y$ iff $\exists Z (Z \in X \leftrightarrow Z \in Y)$. In this case, we have to check that the newly defined relation "meets our expectations". – Mauro ALLEGRANZA 10 hours ago
1  
They are axioms of equality; if you have an equality relation then you can assume those axioms about it. However, when you're defining a new relation, you need to prove them in order to know that your relation is an equality relation. – immibis 6 hours ago

I believe Tao means that the axioms of reflexivity, symmetry, and transitivity are adequate to capture our pre-existing (this is the key) intuition about what "equality" between two objects ought to be. Let me try two contrasting examples to help unpack what I mean.


Version 1

You: Sets $A$ and $B$ are shmequal provided $x \in A \Leftrightarrow x \in B$ for all $x$.

Me: That sounds like a fine relation to investigate. Creative name, by the way.


Version 2

You: Sets $A$ and $B$ are equal provided $x \in A \Leftrightarrow x \in B$ for all $x$.

Me: Now, hold on just a second. By "equal", you mean "identical" or "exactly the same"? I'm not sure I'm ready to accept that this abstract definition captures all that. You would need to show me that this relation is reflexive, symmetric, and transitive before I'm willing to concede that this deserves a name like "equal".

share|cite|improve this answer
    
You forgot the axiom of substitution. And I don't think that one can always show that all of the axioms of equality hold (then one wouldn't need them as axioms!). For me it makes much more sense to say "everything is okay as long as a definition does not contradict the axioms of equality". – user7280899 10 hours ago
1  
What do you mean by "contradict the axioms of equality"? – Austin Mohr 10 hours ago
    
Something contradicts the axioms of equality if it leads to a contradiction together with the axioms of equality. – user7280899 10 hours ago
1  
@user7280899 So one must check whether the definition as stated satisfies the axioms, which is what is meant by "prove the axioms of equality for sets". – Austin Mohr 10 hours ago
1  
I think your answer is a good pedagogical explanation but let me think about it, maybe I find an example for illustrating my point. – user7280899 9 hours ago

You are probably confused because you think that axioms are (by definition) statements that we take as true without any proofs. However, this word has a slightly different meaning.

Axioms are a starting point of a mathematical theory. When you build a theory, for example, Arithmetics, from stratch, you need some preliminary facts, otherwise you cannot prove anything. In Arithmetics and a bunch of other mathematical theories the described properties of equality are indeed axioms, that one do not prove. The equality is a primitive notion, and the only sensible way to actually define it is to postulate that these natural (as it seems to us, humans) properties hold.

However, in set theory, these "axioms" are not the definition of equality. Rather, the equality is defined via the formula above: to sets are equal when they consist of the identical elements. But when we define an equality in this way, there is a natural question: why we are naming this as "equality" at all? This is why we prove "axioms of equality", which we already used to, to show that the naming "equality" is adequate. And when we prove them, they become the theorems of set theory and properties of equality rather than axioms. This is because set theory is more fundamental and more powerful than most mathematical theories in a sense that you can build (almost) all mathematics based on it.

share|cite|improve this answer
    
In the book, Tao isn't only talking about the equality relation on sets, but also on functions, ordered pairs, and so on. – user7280899 10 hours ago
    
@user7280899 In those other cases, "equal" would be defined in a different way, and the burden would be on the person proposing the definition to show that it satisfies reflexivity, symmetry, and transitivity (and thereby deserves to be called "equal"). – Austin Mohr 10 hours ago
1  
@user7280899 Yes, and the functions, pairs and so on are also some objects that you expect to behave in a certain way if you studied some mathematics before. So when we define them in terms of sets, we need to prove that they behave exactly how we expect. When such a situation appears, it is common to call expected properties "axioms", despite the fact that they are not actually the axioms of the set theory. – Wolfram 10 hours ago
    
@Wolfram: Your question assumes that a pure set theory where one encodes every mathematical object as a set is the only right way to go. But that hasn't anything to do with my question. – user7280899 9 hours ago
1  
That's not the only right way to go. F.e., the other possible way that is in active development today (and it's considered even more powerful than set theory) is Homotopy Type Theory. But when we define equality, functions, ordered pairs etc. in any fundamental theory, we then usually prove that they satisfy these axioms. Because we could actually define them in a way they didn't satisfy them. And if it is the case, then the naming is inappropriate (even when the definitions are sensible). This is more a philosophical question than mathematical… So I do not pretend I explained it well. – Wolfram 9 hours ago

There are axioms and then there axioms. Most of the time mathematicians use the word "axiom" they mean it in a definitional sense. Instead of "An equality is a relation satisfying the reflexivity, symmetry, transitivity, and substitutivity axioms" think instead "By definition, equality is any relation for which reflexivity, symmetry, transitivity, and substitutivity hold". In other words, you can call some relation an equality if you can show that it meets the definition, i.e. that reflexivity, symmetry, transitivity, and substitutivity are true of it. So the answer to your first question is "yes". To put it another way, these "axioms" are true of equality relations, but you have to show that your relation is in fact an equality relation. This is exactly the same situation as the definition of a mathematical group for instance.

To put it an even better way, these "axioms" are axioms in the "theory of equality" and you want to show that a particular relation is a model/interpretation/semantics for that theory. Very briefly and roughly sketching, in formal logic, a theory is a collection of symbols and a collection of rules. A theory will define certain arrangements of symbols to be formulas (or sentences or terms). There will also be a notion of "theoremhood" defined by the rules. Typically the rules will have the form "if these arrangements of symbols are theorems, then this arrangement of symbols is a theorem". You could call these rules "axioms", though in this context usually only rules with no premises, i.e. that simply baldly state "this arrangement of symbols is a theorem" with no conditions, are called "axioms". However, the "axiom of symmetry", say, corresponds more closely to a rule than an axiom in this stricter sense. A theory (and the logic in which it is formulated) thus gives rise to a language.

Of course, we usually want to talk about circles and torii and other mathematical objects that we don't (usually...) think of a "arrangements of symbols". To connect a theory to some mathematical objects we use a semantics which is an assignation of mathematical objects to the arrangements of symbols in a consistent manner (usually satisfying some conditions dependent on the logic in which the theory is formulated) such that the rules are satisfied. If the rules aren't satisfied, then the assignment is not a semantics for the theory.

So Tao is (implicitly) specifying a theory of equality and these exercises are asking you to show that particular interpretations (i.e. assignments) are semantics for that theory.

So how does this relate to set theory as the "foundation" of mathematics or axioms as "self evident truths"? As far as "foundations" are concerned the situation is that mathematicians for the most part have agreed to (pretend to) work within the language of Zermelo-Fraenkel (ZF) set theory which is a theory in first-order logic. There is no question of "true" or "false" in this scenario. We simply have some formulas that are called theorems and rules for making more theorems. The rules/axioms simply define what a "theorem" is. The axioms in the stricter sense are then the starting points for deriving theorems as Wolfram said. However, we can talk about semantics for ZF set theory and to show that an assignment is a semantics we would indeed be obliged to prove the "axiom of pairing" and the "axiom of infinity" and all the other axioms of ZF set theory hold for our interpretation. This is something that is done in set theory and logic.

Pragmatically, as I stated in the first paragraph, you should just interpret "axiom" in this and most cases as "condition that needs to hold to meet the definition". The rest of this answer was more explaining how this usage of the word "axiom" is, in fact, more or less consistent with the usage in e.g. "axioms of set theory" or "axioms of geometry".

share|cite|improve this answer
    
Thanks. Seems to be similar to the answer of Austin Mohr. Can you answer my last question in the comments of his answer? – user7280899 6 hours ago
    
I assume you mean the comment about ordered pairs and the following one about recursion. Equality is not the best example for all this since usually equality is part of the logic rather than the theory within the logic. Furthermore, to the extent that we're implicitly working in the language of set theory, there's a built-in notion of equality. (Equality is also trickier than it seems.) Let's just talk about an equivalence relation. It's easier to see what's happening in that context. If $\sim_X$ is an equivalence relation on $X$ and similarly for $\sim_Y$, ... – Derek Elkins 5 hours ago
    
... then we can make an equivalence relation on $X\times Y$ via $$(x_1,y_1)\sim(x_2,y_2)\iff x_1\sim_X x_2\land y_1\sim_Y y_2$$ So indeed to define this equivalence relation on ordered pairs we need to be handed equivalence relations on the components. The fact that $X$ or $Y$ might themselves be cartesian products does not make this definition recursive. In fact, maybe the framework in which we're working doesn't allow cartesian products of cartesian products. It makes no difference to this definition. So any "recursion" would be coming from the framework within which we're working. – Derek Elkins 5 hours ago

So he gives the exercise to prove the axioms of equality for sets. Why does one has to prove axioms? Or, put differently: if one can prove these things, why does he state them as axioms? $ \def\imp{\Rightarrow} \def\eq{\Leftrightarrow} $

He does not prove the axiom as stated. The axiom claims equality between two sets iff they have exactly the same members. This equality symbol "$=$" is the symbol in the foundational system itself, and there is no way you will be able to prove an axiom of the foundational system if it is independent of the other axioms. In fact, the equality symbol is part of first-order logic itself. So what exactly does Terence Tao mean?

He wrote:

One can easily verify that this notion of equality is reflexive, symmetric, and transitive (Exercise 3.1.1). Observe that if $x∈A$ and $A=B$, then $x∈B$, by Definition 3.1.4. Thus the "is an element of" relation $∈$ obeys the axiom of substitution.

This is logically not precise unless he is working in first-order logic without equality. It would be clearer to define the binary relation $\sim$ such that $A \sim B$ iff $\forall x\ ( x \in A \eq x \in B )$. Then it makes sense to ask whether $\sim$ is an equivalence relation or not, and whether it obeys substitution. It is trivial to prove that it is indeed symmetric, reflexive and transitive. In a formal system, we should think of the notion that a relation $\sim$ obeys substitution as meaning that $x \sim y$ implies that $P(x) \eq P(y)$ for any $1$-input sentence $P$. It turns out that in a first-order language we do not need to check for every $1$-input sentence, because it suffices to check for each of the non-logical symbols of the language. Since the language of set theory only has one non-logical symbol "$\in$", the precise notion of "obeys substitution" in set theory is hence:

$\forall A,B\ ( A \sim B \imp \forall C\ ( C \in A \eq C \in B ) \land \forall C\ ( A \in C \eq B \in C ) )$.

Observe that the first half of the claim is trivially true by definition of $\sim$. I don't see the second half in the quotes of Terence Tao that you have in your question. If I'm not mistaken, it is not provable, in which case Terence didn't really prove full substitutivity.

share|cite|improve this answer

I've personally come to think of axioms as little components of a big definition. For example, the axioms at the start of the Elements define what we mean by "Euclidean geometry"; the Peano axioms serve to define what we mean by "natural number", and so forth.

This gives a somewhat cleaner style than a definition that goes on for a paragraph or two with lots of conjunctions. And it serves to make the parts distinct, so that we can study the effects of maybe swapping out or changing one of them and keeping the rest the same.

So Tao is listing all the sub-parts in the definition of what we mean by "equality". What equality means is assumed in advance by these axioms. Now the question is: Does a proposed new relation really count as equality, or not? That needs to be established by proving it meets all of the criteria, that is, all of the component axioms of the definition.

share|cite|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.