Proving sets with structural induction

Click For Summary
SUMMARY

The discussion focuses on proving that for the recursively defined set S, every element x can be expressed as x = 3n for some integer n. The set S is defined with the base case 3 ∈ S, and the operations of subtraction and multiplication by 2. Participants emphasize using structural induction to establish the proof, starting with the base case and assuming the property holds for an element x to show it holds for y = 2x and z = x - y. The proof structure is confirmed as valid through logical deductions involving integers.

PREREQUISITES
  • Understanding of structural induction
  • Familiarity with recursive set definitions
  • Basic knowledge of integer properties
  • Ability to manipulate algebraic expressions
NEXT STEPS
  • Study the principles of structural induction in depth
  • Explore recursive definitions in set theory
  • Learn about integer properties and their applications in proofs
  • Practice constructing proofs using induction with various examples
USEFUL FOR

Mathematicians, computer scientists, and students studying discrete mathematics or proof techniques will benefit from this discussion, particularly those interested in structural induction and recursive set definitions.

thy
Messages
5
Reaction score
0
Consider the set S defined recursively as follows:
• 3 ∈ S,
• if x,y ∈ S,then x−y∈S,
• if x∈S, then 2x ∈ S,
• S contains no other element.
Use Structural Induction to write a detailed, carefully structured proof that
∀ x ∈ S, ∃ n ∈ Z, x = 3n.

What I've got is since 3 is in the set, then 2 * 3 = 6 is also in the set, 6 = 3 * 2 (n=2).
Let x = 6 and y = 3, 6-3 =3 is also in the set which is 3 * 1 = 3 (n=2).

It works on x = 12, y=6 as well. Is that the way to prove it?
 
Physics news on Phys.org
No, the way to prove it is by structural induction. That means that, assuming you have an element/two elements that sastify the proposition, try to prove that a new element created from them also satisfies it.

Let me give you an example.
The trivial step is the first one: it is true for 3, taking n = 1.
Now suppose that x∈S, so there is an n such that x = 3n. Consider y = 2x. Can you find a number m such that y = 3m?

Now do something similar for z = x - y: what would be the thing to prove?
Given that there exist n and m such that x = 3n and y = 3m, find a number k such that z = 3k.

Do you see how this proves the statement for any number in S?
 
CompuChip said:
No, the way to prove it is by structural induction. That means that, assuming you have an element/two elements that sastify the proposition, try to prove that a new element created from them also satisfies it.

Let me give you an example.
The trivial step is the first one: it is true for 3, taking n = 1.
Now suppose that x∈S, so there is an n such that x = 3n. Consider y = 2x. Can you find a number m such that y = 3m?

Now do something similar for z = x - y: what would be the thing to prove?
Given that there exist n and m such that x = 3n and y = 3m, find a number k such that z = 3k.

Do you see how this proves the statement for any number in S?

so consider y = 2x,
a number m such that y = 3m, then m = 2n? because y = 2(3n).

for z = x - y, x = 3n, y=3m,
then z = 3n - 3m = 3(n-m).
that means k = n-m?
is that the right way?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
1
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K