Proof Check: Prove a | 1 iff a = ±1

  • Thread starter Thread starter SithsNGiggles
  • Start date Start date
Click For Summary
SUMMARY

The proof demonstrates that for any integer \( a \), the statement \( a | 1 \) is equivalent to \( a = \pm 1 \). The left-to-right proof establishes that if \( a | 1 \), then \( a \) must be either 1 or -1, as all other integer multiples lead to contradictions. The right-to-left proof confirms that if \( a = \pm 1 \), then \( a | 1 \) holds true. The discussion emphasizes the importance of using integer properties and multiplication definitions without referencing rational numbers or reciprocals.

PREREQUISITES
  • Understanding of integer divisibility and notation (e.g., \( a | b \))
  • Familiarity with proof techniques in number theory
  • Knowledge of properties of integers and multiplication
  • Basic understanding of logical implications and equivalences
NEXT STEPS
  • Study integer divisibility rules and their implications
  • Learn about proof techniques specific to number theory, such as direct proof and proof by contradiction
  • Explore the properties of integers in relation to multiplication and division
  • Investigate the definitions of natural numbers and their operations
USEFUL FOR

Mathematics students, particularly those studying number theory, educators teaching proof techniques, and anyone interested in formal mathematical reasoning.

SithsNGiggles
Messages
183
Reaction score
0
Hi, can I get someone to look over this proof? I'm okay with the first part, but can I get some reassurance or feedback on the second part? Namely, am I right about what I'm intending to show? Thanks.

Homework Statement


The following statement holds for all a,b,c,d \in \mathbb{Z}:
a | 1\mbox{ iff } a=\pm 1

Write a proof for this part of Theorem 2.3.6 (which just lists other properties I've written proofs for).

Homework Equations



The Attempt at a Solution



First I wrote a proof for the left-to-right conditional:
Assume a|1. Then, by definition, \exists k\in\mathbb{Z} such that ak = 1.

Suppose k>1. Then ak = 1 \Rightarrow a = \frac{1}{k} \not\in\mathbb{Z}.
Suppose k=1. Then ak = 1 \Rightarrow a = 1.
Suppose -1 < k < 1. Then k = 0, but 0a \not=1 for any a.
Suppose k=-1. Then ak = 1 \Rightarrow a = -1.
Suppose k<-1. Then ak = 1 \Rightarrow a = -\frac{1}{k} \not\in\mathbb{Z}.

The first, third, and fifth scenarios all lead to contradictions. In the remaining cases, a=\pm1.

(I had a feeling my approach here was a bit tedious, but if it's acceptable, I'm fine with it.)

Right-to-left:
Assume a=\pm1. To show that a|1, suppose that ak=1 for some k. If k \in\mathbb{Z}, then both k|1 and a|1, the latter of which I want to show.

Case 1: Let a=1. Then we have (1)k = 1 \Rightarrow k = 1 \in\mathbb{Z}.
Case 2: Let a=-1. Then we have (-1)k = 1 \Rightarrow k=-1 \in\mathbb{Z}.

Since both cases imply that k \in\mathbb{Z}, I conclude that a|1.
 
Physics news on Phys.org
SithsNGiggles said:
(I had a feeling my approach here was a bit tedious, but if it's acceptable, I'm fine with it.)
You could reduce this to the cases k=0, |k|=1, |k|>1, but I think the idea is fine.

You can prove "<=" like that, but you can simply give some specific k, you don't have to derive that there is no other value.
 
You use the fact that ##k\not\in\{1,-1\}\Rightarrow \frac{1}{k}\not\in\mathbb{Z}##, when that is essentially what you're trying to prove for ##a##. Actually that's the contrapositive of what you're trying to prove; ##\frac{1}{a}\in\mathbb{Z}\Rightarrow a\in\{1,-1\}##. So that's bad.

Actually, you're working in ##\mathbb{Z}##, so what does ##\frac{1}{k}## even mean? If you are learning this stuff the way that I learned it, all of the statements about division for integers have been expressed in terms of multiplication. So it's probably a good idea to restrict yourself to using only facts about multiplication. It's OK to use what you know from other classes to gain insight into the problem or figure out how the solutions should go, but that doesn't mean you're free to use that information in the proof.

For instance, you know that the rational reciprocals of integers larger than 1 must be between 0 and 1. How do you go about saying that without referencing rationals or reciprocals? Can you get away with saying something slightly different (perhaps like ##nm>m## if ##n,m>1##*) that only uses facts about integers and integer multiplication? That's the problem that you're being asked to do here.

*You should be able to prove this from the definitions of multiplication for natural numbers and the definition of < for natural numbers if you've seen these definitions.
 
You can use multiplication and division in the real numbers, and see that the solutions are not integers afterwards. As operations with integers give the same result as operations with the corresponding real numbers, this works.
 

Similar threads

Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
12
Views
2K
  • · Replies 12 ·
Replies
12
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K