Dgdrxrt

Working through the single responsibility principle (SRP) in Python when calls are expensive

Difference between "generating set" and free product?

What's the point in a preamp?

Sort list of array linked objects by keys and values

How is simplicity better than precision and clarity in prose?

Can the prologue be the backstory of your main character?

Match Roman Numerals

Why not take a picture of a closer black hole?

Finding the path in a graph from A to B then back to A with a minimum of shared edges

How does this infinite series simplify to an integral?

What are these Gizmos at Izaña Atmospheric Research Center in Spain?

How do you keep chess fun when your opponent constantly beats you?

What information about me do stores get via my credit card?

Grover's algorithm - DES circuit as oracle?

The variadic template constructor of my class cannot modify my class members, why is that so?

Simulating Exploding Dice

Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?

Does Parliament hold absolute power in the UK?

Can a 1st-level character have an ability score above 18?

Who or what is the being for whom Being is a question for Heidegger?

How does ice melt when immersed in water

What do you call a plan that's an alternative plan in case your initial plan fails?

Hopping to infinity along a string of digits

Is a pteranodon too powerful as a beast companion for a beast master?

Let $emptyset ≠A⊆F$. $exists max(A) implies exists sup(A)$ and $sup(A)=max(A)$.

1

$begingroup$

Let $∅≠A⊆F$. Prove that if $max(A)$ exists, then $sup(A)$ exists and $sup(A)=max(A)$.

How do I prove such statement?

real-analysis supremum-and-infimum

share|cite|improve this question

edited Mar 31 at 14:16

Felipe Duda

asked Mar 31 at 13:42

Felipe DudaFelipe Duda

62

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Have you checked what the definition of $max(A)$ is?
  $endgroup$
  – blub
  Mar 31 at 13:43
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Yes, my problem is not with the concept itself, but with the proof.
  $endgroup$
  – Felipe Duda
  Mar 31 at 13:44
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Also, what is your $F$?
  $endgroup$
  – blub
  Mar 31 at 13:46
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  F is a general ordered field.
  $endgroup$
  – Felipe Duda
  Mar 31 at 13:47
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  You say $emptyset = A$, twice. Surely that should be $emptysetne A$???
  $endgroup$
  – David C. Ullrich
  Mar 31 at 14:13
  

  
  
  
  

 | 
show 2 more comments

1

$begingroup$

Let $∅≠A⊆F$. Prove that if $max(A)$ exists, then $sup(A)$ exists and $sup(A)=max(A)$.

How do I prove such statement?

real-analysis supremum-and-infimum

share|cite|improve this question

edited Mar 31 at 14:16

Felipe Duda

asked Mar 31 at 13:42

Felipe DudaFelipe Duda

62

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Have you checked what the definition of $max(A)$ is?
  $endgroup$
  – blub
  Mar 31 at 13:43
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Yes, my problem is not with the concept itself, but with the proof.
  $endgroup$
  – Felipe Duda
  Mar 31 at 13:44
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Also, what is your $F$?
  $endgroup$
  – blub
  Mar 31 at 13:46
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  F is a general ordered field.
  $endgroup$
  – Felipe Duda
  Mar 31 at 13:47
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  You say $emptyset = A$, twice. Surely that should be $emptysetne A$???
  $endgroup$
  – David C. Ullrich
  Mar 31 at 14:13
  

  
  
  
  

 | 
show 2 more comments

$begingroup$

Let $∅≠A⊆F$. Prove that if $max(A)$ exists, then $sup(A)$ exists and $sup(A)=max(A)$.

How do I prove such statement?

real-analysis supremum-and-infimum

share|cite|improve this question

edited Mar 31 at 14:16

Felipe Duda

asked Mar 31 at 13:42

Felipe DudaFelipe Duda

62

$endgroup$

share|cite|improve this question

edited Mar 31 at 14:16

Felipe Duda

asked Mar 31 at 13:42

Felipe DudaFelipe Duda

62

share|cite|improve this question

edited Mar 31 at 14:16

Felipe Duda

asked Mar 31 at 13:42

Felipe DudaFelipe Duda

62

asked Mar 31 at 13:42

Felipe DudaFelipe Duda

62

asked Mar 31 at 13:42

Felipe DudaFelipe Duda

62

2 Answers
2

active

oldest

votes

0

$begingroup$

The supremum must exist, and in this case having a maximum implies the set is bounded above, so the supremum is finite. Suppose by contradiction that the max and sup are different. Then it must be the case that $sup(A)>max(A)$ since $max(A)in A$. Can you derive a contradiction?

share|cite|improve this answer

answered Mar 31 at 14:25

DaveDave

9,22211033

$endgroup$

add a comment | 

0

$begingroup$

This is straightforward enough, if you recall the definitions of a supremum of a partially ordered set and the maximum. The condition that $F$ is partially ordered is important in these definitions. Specifically:

Maximal(Maximum) : Let $(F,leq)$ be a partially ordered set and $ Asubseteq F$. Then $min A$ is a maximal element of $A$ if $forall ain A$ it is : $m leq a implies m = a$.

Supremum : An upper bound $b$ of a partially ordered set $(F,leq)$ will be called a supremum of $A$ if for all upper bounds $u_b$ of $A$ in $F$, $u_b geq b$.

Now, since $max(A)$ exists, that means that there exists $m in A$ such that for all $a in A$ it is $$ m leq a implies m=a qquad (1)$$

Suppose it is $max(A) neq sup(A)$. Since $max(A) in A$ and for all upper bounds $u_b$ of $A$ we have $u_b geq b$, it should be $sup(A) > max(A)$. But we have arrived at a contradiction, since $(1)$ holds. Thus $max(A) = sup(A)$.

share|cite|improve this answer

answered Mar 31 at 14:30

RebellosRebellos

15.7k31250

$endgroup$

add a comment | 

Your Answer

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3169410%2flet-emptyset-%25e2%2589%25a0a%25e2%258a%2586f-exists-maxa-implies-exists-supa-and-supa-m%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

0

$begingroup$

The supremum must exist, and in this case having a maximum implies the set is bounded above, so the supremum is finite. Suppose by contradiction that the max and sup are different. Then it must be the case that $sup(A)>max(A)$ since $max(A)in A$. Can you derive a contradiction?

share|cite|improve this answer

answered Mar 31 at 14:25

DaveDave

9,22211033

$endgroup$

add a comment | 

0

$begingroup$

The supremum must exist, and in this case having a maximum implies the set is bounded above, so the supremum is finite. Suppose by contradiction that the max and sup are different. Then it must be the case that $sup(A)>max(A)$ since $max(A)in A$. Can you derive a contradiction?

share|cite|improve this answer

answered Mar 31 at 14:25

DaveDave

9,22211033

$endgroup$

add a comment | 

$begingroup$

The supremum must exist, and in this case having a maximum implies the set is bounded above, so the supremum is finite. Suppose by contradiction that the max and sup are different. Then it must be the case that $sup(A)>max(A)$ since $max(A)in A$. Can you derive a contradiction?

share|cite|improve this answer

answered Mar 31 at 14:25

DaveDave

9,22211033

$endgroup$

share|cite|improve this answer

answered Mar 31 at 14:25

DaveDave

9,22211033

answered Mar 31 at 14:25

DaveDave

9,22211033

answered Mar 31 at 14:25

DaveDave

9,22211033

0

$begingroup$

This is straightforward enough, if you recall the definitions of a supremum of a partially ordered set and the maximum. The condition that $F$ is partially ordered is important in these definitions. Specifically:

Maximal(Maximum) : Let $(F,leq)$ be a partially ordered set and $ Asubseteq F$. Then $min A$ is a maximal element of $A$ if $forall ain A$ it is : $m leq a implies m = a$.

Supremum : An upper bound $b$ of a partially ordered set $(F,leq)$ will be called a supremum of $A$ if for all upper bounds $u_b$ of $A$ in $F$, $u_b geq b$.

Now, since $max(A)$ exists, that means that there exists $m in A$ such that for all $a in A$ it is $$ m leq a implies m=a qquad (1)$$

Suppose it is $max(A) neq sup(A)$. Since $max(A) in A$ and for all upper bounds $u_b$ of $A$ we have $u_b geq b$, it should be $sup(A) > max(A)$. But we have arrived at a contradiction, since $(1)$ holds. Thus $max(A) = sup(A)$.

share|cite|improve this answer

answered Mar 31 at 14:30

RebellosRebellos

15.7k31250

$endgroup$

add a comment | 

0

$begingroup$

This is straightforward enough, if you recall the definitions of a supremum of a partially ordered set and the maximum. The condition that $F$ is partially ordered is important in these definitions. Specifically:

Maximal(Maximum) : Let $(F,leq)$ be a partially ordered set and $ Asubseteq F$. Then $min A$ is a maximal element of $A$ if $forall ain A$ it is : $m leq a implies m = a$.

Supremum : An upper bound $b$ of a partially ordered set $(F,leq)$ will be called a supremum of $A$ if for all upper bounds $u_b$ of $A$ in $F$, $u_b geq b$.

Now, since $max(A)$ exists, that means that there exists $m in A$ such that for all $a in A$ it is $$ m leq a implies m=a qquad (1)$$

Suppose it is $max(A) neq sup(A)$. Since $max(A) in A$ and for all upper bounds $u_b$ of $A$ we have $u_b geq b$, it should be $sup(A) > max(A)$. But we have arrived at a contradiction, since $(1)$ holds. Thus $max(A) = sup(A)$.

share|cite|improve this answer

answered Mar 31 at 14:30

RebellosRebellos

15.7k31250

$endgroup$

add a comment | 

$begingroup$

This is straightforward enough, if you recall the definitions of a supremum of a partially ordered set and the maximum. The condition that $F$ is partially ordered is important in these definitions. Specifically:

Maximal(Maximum) : Let $(F,leq)$ be a partially ordered set and $ Asubseteq F$. Then $min A$ is a maximal element of $A$ if $forall ain A$ it is : $m leq a implies m = a$.

Supremum : An upper bound $b$ of a partially ordered set $(F,leq)$ will be called a supremum of $A$ if for all upper bounds $u_b$ of $A$ in $F$, $u_b geq b$.

Now, since $max(A)$ exists, that means that there exists $m in A$ such that for all $a in A$ it is $$ m leq a implies m=a qquad (1)$$

Suppose it is $max(A) neq sup(A)$. Since $max(A) in A$ and for all upper bounds $u_b$ of $A$ we have $u_b geq b$, it should be $sup(A) > max(A)$. But we have arrived at a contradiction, since $(1)$ holds. Thus $max(A) = sup(A)$.

share|cite|improve this answer

answered Mar 31 at 14:30

RebellosRebellos

15.7k31250

$endgroup$

share|cite|improve this answer

answered Mar 31 at 14:30

RebellosRebellos

15.7k31250

answered Mar 31 at 14:30

RebellosRebellos

15.7k31250

answered Mar 31 at 14:30

RebellosRebellos

15.7k31250