Regorous and formal proof of (-1).x =-x

  • Context: Graduate 
  • Thread starter Thread starter evagelos
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The discussion centers on providing a rigorous and formal proof of the theorem \((-1) \cdot x = -x\) using axiomatic systems. Participants emphasize the distinction between formal proofs in mathematical logic and those found in calculus textbooks. The proof is constructed using axioms related to addition and multiplication, demonstrating that \((-1) \cdot x + x = 0\) leads to the conclusion \((-1) \cdot x = -x\). The conversation also touches on the complexity of formal proofs and the context of algebraic systems, such as abstract rings versus real numbers.

PREREQUISITES
  • Understanding of basic algebraic operations and properties
  • Familiarity with axiomatic systems in mathematics
  • Knowledge of formal proofs in mathematical logic
  • Concept of algebraic structures like rings and integral domains
NEXT STEPS
  • Study the axioms of algebraic structures in detail
  • Learn about formal proof techniques in mathematical logic
  • Explore the differences between abstract algebra and real analysis
  • Review examples of formal proofs in "First Order Mathematical Logic" by Angelo Margaris
USEFUL FOR

Mathematics students, educators, and anyone interested in the foundations of algebra and formal proof techniques will benefit from this discussion.

evagelos
Messages
314
Reaction score
0
Give a rigorous and then a formal proof of the theorem :

\forall x [ (-1).x = -x ]
 
Physics news on Phys.org
Hint: (-1).x = -x means that (-1).x + x = 0
This should be in a homework forum
 
mXSCNT said:
Hint: (-1).x = -x means that (-1).x + x = 0
This should be in a homework forum

Meaning that formal proofs are homework stuf??
 
Once again, we return to the question, "What do you mean by 'formal proof'?"

I think you are just talking about the kind of proof you would find in a math paper or calculus book- far from what, say, logicians would mean by "formal proof". A true "formal proof" of such a thing would probably require an entire book! How many pages did Russel and Whitehead require to prove "1+ 1= 2"?

Another question: what algebraic system are you working in? The proof for an abstract ring or integral domain would be quite different than for the real numbers.

MXSCNT's point is that the only good reason for doing such "fiddly" stuff is practise: homework.
 
Last edited by a moderator:
It would be something like:

0.x = 0
(-1+1).x = 0
-1.x + 1.x = 0
-1.x + x = 0
-1.x = -x
 
HallsofIvy said:
Once again, we return to the question, "What do you mean by 'formal proof'?"

The definition was given in another thread by tgt and is the following:

tgt said:
I would mean the kind that most people (at least all the logicians) would regard as formal.

A formal proof or derivation is a finite sequence of sentences (called well-formed formulas in the case of a formal language) each of which is an axiom or follows from the preceding sentences in the sequence by a rule of inference. The last sentence in the sequence is a theorem of a formal system.

.

With the only difference that i may add:

each formula could be, apart from axiom, a theorem or definition


HallsofIvy said:
I think you are just talking about the kind of proof you would find in a math paper or calculus book- far from what, say, logicians would mean by "formal proof". A true "formal proof" of such a thing would probably require an entire book! How many pages did Russel and Whitehead require to prove "1+ 1= 2"?

Go to pages 121 to 139 in ANGELO'S MARGARIS book :

FIRST ORDER MATHEMATICAL LOGIC.There you will find many true "formal proofs" not more than half a page long

You know how many books you need before you double integrate a function ,or write a proof in analysis??

HallsofIvy said:
Another question: what algebraic system are you working in? The proof for an abstract ring or integral domain would be quite different than for the real numbers.

MXSCNT's point is that the only good reason for doing such "fiddly" stuff is practise: homework.

On the following axiomatic system i will base any formal or rigorous proofs:

The primitive symbols are:
= for equality
+ for addition
. for multiplication
- for the inverse in addition
0 constant
1 constant
/ for inverse in multiplication

1\neq 0
AND the axioms are:

1) \forall a\forall b[ a+b = b+a]...\forall a\forall b[ a.b = b.a ]

2)\forall a\forall b\forall c[ a+(b+c) = (a+b)+c]...\forall a\forall b\forall c[ a(bc)=(ab)c]


3)\forall a[ a+0 = a]...\forall a[ 1.a =a]


4) \forall a[ a+(-a) = 0]...\forall a[ a\neq 0\Longrightarrow a.\frac{1}{a} = 1]<br />.



5)\forall a\forall b\forall c [ a(b+c) = ab + ac]


AND now the rigorous proof of (-1)x = -x



(-1)x = (-1)x + 0 =............by axiom 3 (for addition)

=(-1)x +[ x + (-x)]=............by axiom 4 (for addition)

=[(-1)x +x] + (-x) =............by axiom 2 (for addition)

=[(-1)x + 1x] + (-x)=............by axiom 3 (for multiplication)


=[x.1 + x(-1)] + (-x)=............by axiom 1 ( for addition and multiplication)


=[ x( 1 + (-1))] + (-x)=...........by axiom 5


= x.0 + (-x) = ...............by axiom 4 (for addition)


= 0 + (-x) =.............by the theorem 0.x = 0


= -x ...............by axiom 4 (for addition)

Next post the formal proof
 
Sounds like homework to me.
 
HallsofIvy said:
How many pages did Russel and Whitehead require to prove "1+ 1= 2"?

360. But it's complicated only if you're trying to prove that equation under R or C; if you restrict yourself to Peano arithmetic it follows from the definition of 2 and the symmetry of equality.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
815
  • · Replies 10 ·
Replies
10
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
15
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K