Classification of mathematical objects

Click For Summary
The completion of a classification of mathematical objects is often indicated by the existence of a theorem that proves all possible types within a category, as seen in the classification of finite simple groups. However, many mathematical objects, such as differentiable manifolds or nilpotent groups, remain unclassified due to their complexity and the sheer number of examples. Classifications typically require additional properties or constraints to be manageable, as broad classifications can be impossible. The process of proving a classification theorem involves demonstrating that no other types exist beyond those identified, often through contradiction. Overall, while some classifications are achievable, many areas in mathematics face inherent limitations due to the vast diversity of objects.
  • #61
trees and plants said:
1) ##m-1\geq1 \Rightarrow m\geq2 \Rightarrow m\in S## contradiction because ##m-1\leq m ## and m is the smallest element of S.

2) (i)##m## is of the form ##2k## ##\Rightarrow## ##m-1## is an odd,

or (ii) ##m## is of the form ##2k-1## ##\Rightarrow## ##m-1## is an even, but we said that m-1 is not a natural number , contradiction.

Both cases show that there is no such ##m\in S##

I don't get this at all. ##m-1\notin S## means that ##m-## can be written as ##2k## or ##2k+1##. You need to use that.
 
Last edited by a moderator:
  • Like
Likes Vanadium 50
Mathematics news on Phys.org
  • #62
<sigh>
Writing random statements hoping you will accidentally prove this is not a good strategy.

<double sigh>
If m is the smallest number that is neither even nor odd, is m-2 even? Is it odd? Is it neither?
 
  • #63
Office_Shredder said:
I don't get this at all. ##m-1\notin S## means that ##m-## can be written as ##2k## or ##2k+1#. You need to use that.
I am sorry for the mistakes before.
a) ##m-1\notin S##
(i) if ##m-1=2k## ##\Rightarrow## ##m=2k+1## ##m## is odd contradiction because we said that ##m\in S##

(ii) if ##m-1=2k-1## ##\Rightarrow## ##m=2k-2## ##\Rightarrow## ##m## is even, contradiction because we said that ##m\in S##

(b) if it is neither of these two forms then it is a contradiction because then ##m-1\leq m## but we know that ##m## is the smallest element of ##S##.
 
  • #64
Is this effort correct?
 
  • #65
So, i had to suppose that there is a set ##S## that contains the rest of the natural numbers and prove that it is empty.

Thank you for your help and time.
 
  • #66
If m-1=2k-1 then m=2k, not 2k-2. But now what you have looks a lot more like a correct proof.

I think you are still not handling the m-1 not a natural number case. That just means m is 1 or 0 depending on your definition of natural numbers. You need to confirm that is either even or odd also.
 
  • Like
Likes Vanadium 50
  • #67
Office_Shredder said:
I think you are still not handling the m-1 not a natural number case.
This proof requires careful examination of the edge cases. Also, as originally posed (by you) it was a statement about integers, not natural numbers, and that will make zero an edge case as well.
 
  • #68
Vanadium 50 said:
This proof requires careful examination of the edge cases. Also, as originally posed (by you) it was a statement about integers, not natural numbers, and that will make zero an edge case as well.
Is the proof for integers analogous to the one i made? Is there anything else needed?
 
  • #69
trees and plants said:
Is the proof for integers analogous to the one i made?
You tell me. You won't get very far asking other people to prove things. You want to get better, you need to work yourself.
 

Similar threads

  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 72 ·
3
Replies
72
Views
7K
  • · Replies 29 ·
Replies
29
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K