Proving sets with structural induction

In summary: Yes, 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.
  • #1
thy
5
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
  • #2
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?
 
  • #3
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?
 

FAQ: Proving sets with structural induction

1. What is the purpose of using structural induction to prove sets?

Structural induction is a mathematical proof technique used to prove properties about recursively defined sets. It is particularly useful for proving properties of data structures and other complex sets.

2. How does structural induction differ from other proof techniques?

Structural induction is similar to mathematical induction, but instead of proving a property for a single number, it proves a property for a recursively defined set. It also differs from other proof techniques such as direct proof or proof by contradiction, as it relies on the structure of the set rather than logical arguments.

3. Can structural induction only be used for finite sets?

No, structural induction can be used for both finite and infinite sets. However, the proof may differ slightly for infinite sets, as the base case and inductive step may need to be modified.

4. Can structural induction be used for non-mathematical sets?

Yes, structural induction can be used to prove properties of sets in various fields such as computer science, linguistics, and philosophy. It can also be applied to non-numerical sets, such as sets of strings or trees.

5. What are the common mistakes to avoid when using structural induction?

One common mistake is assuming that the inductive step is true for all elements of the set, rather than just the next element in the recursive definition. It is also important to make sure the base case is correctly identified and that the inductive hypothesis is used appropriately in the proof.

Similar threads

Back
Top