Proving reflexive, symmetric, transitive properties

In summary, the conversation discusses the different approaches of Spivak and Landau in introducing real and natural numbers, and the role of axioms of equality in defining what equality is. It also raises the question of whether the transitive property of real numbers can be proven from the field axioms given in Spivak's Calculus.
  • #1
issacnewton
1,026
36
Hello

I was reading Spivak's calculus. It starts with discussing the familiar axioms of the real numbers. He calls them properties. At some another forum, I came across the reference to Landau's "Foundation of Analysis" as a background for analysis. So I referred to that book. On the very first page , he says that reflexive, symmetric, and transitive properties of the natural numbers are taken for granted on logical grounds. So Landau is taking reflexive, symmetric and transitive properties as axioms of natural numbers. I was wondering if we can prove reflexive, symmetric and transitive properties from the field axioms given in Spivak's calculus book.

thanks
 
Physics news on Phys.org
  • #2
So first of all, the approach of Landau and the approach of Spivak are very different. What Spivak does is introduce the real number axiomatically and then construct the natural numbers as a subset of the reals. What Landau does is to take the natural numbers axiomatically, and then construct the real numbers from then. So the two approaches are kind of inverses to each other.

Now, what you are referring to are the axioms of equality. These are axioms of basic logic, they cannot be proven in the approach of Spivak or Landau. They have to be taken for granted because they define what equality actually is. Other axioms of equality are surely possible, but you need to start from something.
 
  • #3
Thanks micromass. Book like Spivak's Calculus should mention what you are saying, just for completeness. I was trying to prove something in Spivak, and I wanted to
use transitive property of real numbers. Since Spivak supposedly starts from scratch, I started wondering where does transitive property come from.
 

FAQ: Proving reflexive, symmetric, transitive properties

1. What does it mean for a relation to have reflexive property?

The reflexive property in a relation means that every element in the set is related to itself. In other words, for every element a in the set, the relation contains the ordered pair (a,a).

2. How can I prove that a relation is reflexive?

To prove that a relation is reflexive, you need to show that for every element a in the set, the ordered pair (a,a) is present in the relation. This can be done by checking each element in the set and making sure that it is related to itself.

3. What does the symmetric property in a relation mean?

The symmetric property in a relation means that if a is related to b, then b is also related to a. In other words, for every ordered pair (a,b) in the relation, there is also an ordered pair (b,a).

4. How can I prove that a relation is symmetric?

To prove that a relation is symmetric, you need to show that for every ordered pair (a,b) in the relation, there is also an ordered pair (b,a). This can be done by checking each ordered pair in the relation and making sure that the reverse pair is also present.

5. What does the transitive property in a relation mean?

The transitive property in a relation means that if a is related to b and b is related to c, then a is also related to c. In other words, for every ordered pair (a,b) and (b,c) in the relation, there is also an ordered pair (a,c).

6. How can I prove that a relation is transitive?

To prove that a relation is transitive, you need to show that for every ordered pair (a,b) and (b,c) in the relation, there is also an ordered pair (a,c). This can be done by checking each pair of ordered pairs in the relation and making sure that the resulting pair is also present.

Back
Top