Finite Subset Max in Set S: Proof

invisible_man
Messages
16
Reaction score
0
Let S be a set on which a linear order <= (less or equal) , is defined. Show that a non-empty finite subset has a max.
 
Physics news on Phys.org
Sounds like a homework problem all right.

You didn't say it, but I assume you're looking for help? What have you done (successful or not), and where are you stuck?
 
This is not really my homework assignment. It's my practice exam. I don't know how to do it
 
Induction?
 

Similar threads

I Characterizing linear independence in terms of span
Replies
3
Views
1K
I Uniqueness of reduced row echelon form (proof verification)
Replies
4
Views
1K
Prove every subset of countable set is either finite or else countable
Replies
1
Views
2K
MHB Finitely Generated Modules - Bland Problem 1(a), Problem Set 2.2
Replies
1
Views
1K
I Proof by induction of block diagonal decomposition of a matrix
Replies
4
Views
1K
I Confused about small detail in rank-nullity theorem
Replies
1
Views
2K
I Showing ##k[x_1,\ldots,x_n]/\mathfrak{a}## is finite dimensional
Replies
40
Views
2K
Prove that every subset ##B## of ##A=\{1,...,n\}## is finite
Replies
4
Views
1K
I Question from a proof in Axler 2nd Ed, 'Linear Algebra Done Right'
Replies
3
Views
2K
A Question regarding proof of convex body theorem
Replies
21
Views
2K

Hot Threads

Recent Insights

Back
Top