Simultaneous Least/Greatest Fixed PointsLeast common fixed-pointConnection between codata and greatest fixed pointsFunction iteration and intervals of attraction for fixed pointsConfirmation needed of the fact that subcategory $mathbfLat$ is not full in $mathbfPos$How is a complete lattice defined solely by a least-upper bound?What are conditions for Tarski's fixed point theorem so that greatest and least fixed points are not the same?If $f$ is Lipschitz continuous on a closed interval $[a,b]$ such that $f([a,b])subseteq [a,b]$ then it has a unique fixed-pointDoes a fixed point depend smoothly on the parameters?A property of complete lattices, and its relation to continuityHow to show that $F(g)(x) = int_0^x cos(fracg(t)2) dt$ has a unique fixed point?
What does the expression "A Mann!" means
How do I handle a potential work/personal life conflict as the manager of one of my friends?
Why no variance term in Bayesian logistic regression?
One verb to replace 'be a member of' a club
Expand and Contract
Unlock My Phone! February 2018
Personal Teleportation: From Rags to Riches
Is there an expression that means doing something right before you will need it rather than doing it in case you might need it?
Detention in 1997
What is a romance in Latin?
Zip/Tar file compressed to larger size?
What do you call someone who asks many questions?
How to prevent "they're falling in love" trope
How badly should I try to prevent a user from XSSing themselves?
Do UK voters know if their MP will be the Speaker of the House?
How would I stat a creature to be immune to everything but the Magic Missile spell? (just for fun)
Why was the shrinking from 8″ made only to 5.25″ and not smaller (4″ or less)?
Can I run a new neutral wire to repair a broken circuit?
Why are the 737's rear doors unusable in a water landing?
Why didn't Miles's spider sense work before?
Are there any examples of a variable being normally distributed that is *not* due to the Central Limit Theorem?
How seriously should I take size and weight limits of hand luggage?
Is the myth that if you can play one instrument, you can learn another instrument with ease true?
Venezuelan girlfriend wants to travel the USA to be with me. What is the process?
Simultaneous Least/Greatest Fixed Points
Least common fixed-pointConnection between codata and greatest fixed pointsFunction iteration and intervals of attraction for fixed pointsConfirmation needed of the fact that subcategory $mathbfLat$ is not full in $mathbfPos$How is a complete lattice defined solely by a least-upper bound?What are conditions for Tarski's fixed point theorem so that greatest and least fixed points are not the same?If $f$ is Lipschitz continuous on a closed interval $[a,b]$ such that $f([a,b])subseteq [a,b]$ then it has a unique fixed-pointDoes a fixed point depend smoothly on the parameters?A property of complete lattices, and its relation to continuityHow to show that $F(g)(x) = int_0^x cos(fracg(t)2) dt$ has a unique fixed point?
$begingroup$
I have two functions $f : V times S to V$ and $g : V times S to S$ where $V$ and $S$ are complete lattices and $v subseteq v' wedge s subseteq s'$ implies $f(v, s) subseteq f(v', s') wedge g(v, s) subseteq g(v', s')$.
Do we have enough information to show that there exists some $v$ and $s$ such that $v$ is the least fixed point of $f'(x) = f(x, s)$ and $s$ is the greatest fixed point of $g'(x) = g(v, x)$? If so, are $v$ and $s$ unique?
I'd also love a reference for this sort of thing if possible, I've been having a hard time finding one!
fixed-point-theorems lattice-orders fixedpoints
$endgroup$
add a comment |
$begingroup$
I have two functions $f : V times S to V$ and $g : V times S to S$ where $V$ and $S$ are complete lattices and $v subseteq v' wedge s subseteq s'$ implies $f(v, s) subseteq f(v', s') wedge g(v, s) subseteq g(v', s')$.
Do we have enough information to show that there exists some $v$ and $s$ such that $v$ is the least fixed point of $f'(x) = f(x, s)$ and $s$ is the greatest fixed point of $g'(x) = g(v, x)$? If so, are $v$ and $s$ unique?
I'd also love a reference for this sort of thing if possible, I've been having a hard time finding one!
fixed-point-theorems lattice-orders fixedpoints
$endgroup$
add a comment |
$begingroup$
I have two functions $f : V times S to V$ and $g : V times S to S$ where $V$ and $S$ are complete lattices and $v subseteq v' wedge s subseteq s'$ implies $f(v, s) subseteq f(v', s') wedge g(v, s) subseteq g(v', s')$.
Do we have enough information to show that there exists some $v$ and $s$ such that $v$ is the least fixed point of $f'(x) = f(x, s)$ and $s$ is the greatest fixed point of $g'(x) = g(v, x)$? If so, are $v$ and $s$ unique?
I'd also love a reference for this sort of thing if possible, I've been having a hard time finding one!
fixed-point-theorems lattice-orders fixedpoints
$endgroup$
I have two functions $f : V times S to V$ and $g : V times S to S$ where $V$ and $S$ are complete lattices and $v subseteq v' wedge s subseteq s'$ implies $f(v, s) subseteq f(v', s') wedge g(v, s) subseteq g(v', s')$.
Do we have enough information to show that there exists some $v$ and $s$ such that $v$ is the least fixed point of $f'(x) = f(x, s)$ and $s$ is the greatest fixed point of $g'(x) = g(v, x)$? If so, are $v$ and $s$ unique?
I'd also love a reference for this sort of thing if possible, I've been having a hard time finding one!
fixed-point-theorems lattice-orders fixedpoints
fixed-point-theorems lattice-orders fixedpoints
asked Mar 30 '17 at 13:58
Nick RiouxNick Rioux
1083
1083
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Notations:
- $f_s:xmapsto f(x,s)$
- $g_v:ymapsto f(v,y)$
You question is: If $f:Vtimes Sto V$ and $g:Vtimes S to S$ are monotonic, are there $v_*$ and $s_*$ so that $v=mu f_s_*$ and $s=nu g_v_*$?
First, note that since $f$ is monotonic, so is $f_s$ for every $s$ so that $mu f_s$ always exists (by the Knaster–Tarski theorem). Similarly $nu g_v$ always exists.
But this isn't enough because if you take some random $s_0$, then you can take $v_1:=mu f_s_0$ and then $s_2:=nu g_v_1$ but there no reason to have $s_2=s_0$. We could try to go one step further by taking $v_3:=mu f_s_2$ but then again, there would be no reason to have $v_3=v_1$. Can you see where I'm going with this?
What we want is a fixpoint of $(v,s)mapsto (mu f_s,nu g_v)$. Can we have that?
-
Yes! We can just prove that $H:(v,s)mapsto (mu f_s,nu g_v)$ is monotonic. Then we're done by the Knaster–Tarski theorem.
-
Define $F:smapsto f_s$ and $M:fmapsto mu f$. Why are they monotonous?
-
$F$ is monotonic because $sle s'$ implies $forall v, f_s(v)=f(v,s)le f(v,s')=f_s'(v)$.
-
$M$ is monotonic because if $fle g$, then whenever $g(x)le x$ we have the inequality $f(x)le g(x)le x$. We therefore have the inclusion $x:f(x)le xsupseteq x:g(x)le x$. From which we can conclude that $mu f = bigwedgex:f(x)le xle bigwedge x:g(x)le x=mu g$
-
Similar arguments work for $G:vmapsto g_v$ and $N:gmapsto nu g$. If $fle g$, $xle f(x)$ implies $x le f(x) le g(x)$, so $x:x le f(x)subseteq x:x le g(x)$. And we conclude $nu f=bigvee x:x le f(x)le bigvee x:x le g(x) = nu g$
To show that it is not unique, you can take $V=S$, $f(v,s)=vlor s$ and $g(v,s)=vland s$. What's $mu f_s$?
Hint: $v=vlor s$ is equivalent to $sle v$
-
$mu f_s$ is the smallest $v$ so that $v=vlor s$. But $v=vlor s$ is equivalent to $sle v$ so that $mu f_s$ is the smallest $v$ so that $s le v$, that is $mu f_s=s$. Similarly $nu g_v=v$. So taking $s=v$ is sufficient to satisfy your conditions. Since there are complete lattices with more than one element, we can therefore conclude that the couple $(v,s)$ is not unique in general.
As for references, I don't really know. I scrolled through this and it looks nice. You could try to use induction or coinduction as keywords in your search.
$endgroup$
$begingroup$
Thanks for the answer! Sorry if I'm missing something obvious here, but it seems to me that to show $H$ is monotonous you actually need to show $s mapsto mu f_s$ and $v mapsto nu g_v$ are. I don't see how these follow from the fact that F and G are monotonous.
$endgroup$
– Nick Rioux
Mar 31 '17 at 13:22
$begingroup$
Yes. I completely forgot to write that part... I'll expand the answer later. The idea is to use the fact that the smallest fixpoint is the inf of the elements $x$ so that $f(x)le x$.
$endgroup$
– xavierm02
Mar 31 '17 at 13:48
$begingroup$
@NickRioux (I think) I fixed it.
$endgroup$
– xavierm02
Mar 31 '17 at 14:50
$begingroup$
Still digesting this but it seems really great. Thanks again! I was wondering, if we assume $V$ and $S$ are disjoint, does that change your answer to the question of uniqueness?
$endgroup$
– Nick Rioux
Mar 31 '17 at 16:34
$begingroup$
@NickRioux No. In fact this kind of condition will nearly never help. The problem is that you can make a perfect copy (i.e. an isomorphic structure) of $V$ that is disjoint from $V$. And since everything we said is just about the lattice structure, it will be preserved by isomorphism so replacing one of the two $V$s by a disjoint perfect copy won't affect the proof.
$endgroup$
– xavierm02
Mar 31 '17 at 22:44
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
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
);
);
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
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2210240%2fsimultaneous-least-greatest-fixed-points%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Notations:
- $f_s:xmapsto f(x,s)$
- $g_v:ymapsto f(v,y)$
You question is: If $f:Vtimes Sto V$ and $g:Vtimes S to S$ are monotonic, are there $v_*$ and $s_*$ so that $v=mu f_s_*$ and $s=nu g_v_*$?
First, note that since $f$ is monotonic, so is $f_s$ for every $s$ so that $mu f_s$ always exists (by the Knaster–Tarski theorem). Similarly $nu g_v$ always exists.
But this isn't enough because if you take some random $s_0$, then you can take $v_1:=mu f_s_0$ and then $s_2:=nu g_v_1$ but there no reason to have $s_2=s_0$. We could try to go one step further by taking $v_3:=mu f_s_2$ but then again, there would be no reason to have $v_3=v_1$. Can you see where I'm going with this?
What we want is a fixpoint of $(v,s)mapsto (mu f_s,nu g_v)$. Can we have that?
-
Yes! We can just prove that $H:(v,s)mapsto (mu f_s,nu g_v)$ is monotonic. Then we're done by the Knaster–Tarski theorem.
-
Define $F:smapsto f_s$ and $M:fmapsto mu f$. Why are they monotonous?
-
$F$ is monotonic because $sle s'$ implies $forall v, f_s(v)=f(v,s)le f(v,s')=f_s'(v)$.
-
$M$ is monotonic because if $fle g$, then whenever $g(x)le x$ we have the inequality $f(x)le g(x)le x$. We therefore have the inclusion $x:f(x)le xsupseteq x:g(x)le x$. From which we can conclude that $mu f = bigwedgex:f(x)le xle bigwedge x:g(x)le x=mu g$
-
Similar arguments work for $G:vmapsto g_v$ and $N:gmapsto nu g$. If $fle g$, $xle f(x)$ implies $x le f(x) le g(x)$, so $x:x le f(x)subseteq x:x le g(x)$. And we conclude $nu f=bigvee x:x le f(x)le bigvee x:x le g(x) = nu g$
To show that it is not unique, you can take $V=S$, $f(v,s)=vlor s$ and $g(v,s)=vland s$. What's $mu f_s$?
Hint: $v=vlor s$ is equivalent to $sle v$
-
$mu f_s$ is the smallest $v$ so that $v=vlor s$. But $v=vlor s$ is equivalent to $sle v$ so that $mu f_s$ is the smallest $v$ so that $s le v$, that is $mu f_s=s$. Similarly $nu g_v=v$. So taking $s=v$ is sufficient to satisfy your conditions. Since there are complete lattices with more than one element, we can therefore conclude that the couple $(v,s)$ is not unique in general.
As for references, I don't really know. I scrolled through this and it looks nice. You could try to use induction or coinduction as keywords in your search.
$endgroup$
$begingroup$
Thanks for the answer! Sorry if I'm missing something obvious here, but it seems to me that to show $H$ is monotonous you actually need to show $s mapsto mu f_s$ and $v mapsto nu g_v$ are. I don't see how these follow from the fact that F and G are monotonous.
$endgroup$
– Nick Rioux
Mar 31 '17 at 13:22
$begingroup$
Yes. I completely forgot to write that part... I'll expand the answer later. The idea is to use the fact that the smallest fixpoint is the inf of the elements $x$ so that $f(x)le x$.
$endgroup$
– xavierm02
Mar 31 '17 at 13:48
$begingroup$
@NickRioux (I think) I fixed it.
$endgroup$
– xavierm02
Mar 31 '17 at 14:50
$begingroup$
Still digesting this but it seems really great. Thanks again! I was wondering, if we assume $V$ and $S$ are disjoint, does that change your answer to the question of uniqueness?
$endgroup$
– Nick Rioux
Mar 31 '17 at 16:34
$begingroup$
@NickRioux No. In fact this kind of condition will nearly never help. The problem is that you can make a perfect copy (i.e. an isomorphic structure) of $V$ that is disjoint from $V$. And since everything we said is just about the lattice structure, it will be preserved by isomorphism so replacing one of the two $V$s by a disjoint perfect copy won't affect the proof.
$endgroup$
– xavierm02
Mar 31 '17 at 22:44
add a comment |
$begingroup$
Notations:
- $f_s:xmapsto f(x,s)$
- $g_v:ymapsto f(v,y)$
You question is: If $f:Vtimes Sto V$ and $g:Vtimes S to S$ are monotonic, are there $v_*$ and $s_*$ so that $v=mu f_s_*$ and $s=nu g_v_*$?
First, note that since $f$ is monotonic, so is $f_s$ for every $s$ so that $mu f_s$ always exists (by the Knaster–Tarski theorem). Similarly $nu g_v$ always exists.
But this isn't enough because if you take some random $s_0$, then you can take $v_1:=mu f_s_0$ and then $s_2:=nu g_v_1$ but there no reason to have $s_2=s_0$. We could try to go one step further by taking $v_3:=mu f_s_2$ but then again, there would be no reason to have $v_3=v_1$. Can you see where I'm going with this?
What we want is a fixpoint of $(v,s)mapsto (mu f_s,nu g_v)$. Can we have that?
-
Yes! We can just prove that $H:(v,s)mapsto (mu f_s,nu g_v)$ is monotonic. Then we're done by the Knaster–Tarski theorem.
-
Define $F:smapsto f_s$ and $M:fmapsto mu f$. Why are they monotonous?
-
$F$ is monotonic because $sle s'$ implies $forall v, f_s(v)=f(v,s)le f(v,s')=f_s'(v)$.
-
$M$ is monotonic because if $fle g$, then whenever $g(x)le x$ we have the inequality $f(x)le g(x)le x$. We therefore have the inclusion $x:f(x)le xsupseteq x:g(x)le x$. From which we can conclude that $mu f = bigwedgex:f(x)le xle bigwedge x:g(x)le x=mu g$
-
Similar arguments work for $G:vmapsto g_v$ and $N:gmapsto nu g$. If $fle g$, $xle f(x)$ implies $x le f(x) le g(x)$, so $x:x le f(x)subseteq x:x le g(x)$. And we conclude $nu f=bigvee x:x le f(x)le bigvee x:x le g(x) = nu g$
To show that it is not unique, you can take $V=S$, $f(v,s)=vlor s$ and $g(v,s)=vland s$. What's $mu f_s$?
Hint: $v=vlor s$ is equivalent to $sle v$
-
$mu f_s$ is the smallest $v$ so that $v=vlor s$. But $v=vlor s$ is equivalent to $sle v$ so that $mu f_s$ is the smallest $v$ so that $s le v$, that is $mu f_s=s$. Similarly $nu g_v=v$. So taking $s=v$ is sufficient to satisfy your conditions. Since there are complete lattices with more than one element, we can therefore conclude that the couple $(v,s)$ is not unique in general.
As for references, I don't really know. I scrolled through this and it looks nice. You could try to use induction or coinduction as keywords in your search.
$endgroup$
$begingroup$
Thanks for the answer! Sorry if I'm missing something obvious here, but it seems to me that to show $H$ is monotonous you actually need to show $s mapsto mu f_s$ and $v mapsto nu g_v$ are. I don't see how these follow from the fact that F and G are monotonous.
$endgroup$
– Nick Rioux
Mar 31 '17 at 13:22
$begingroup$
Yes. I completely forgot to write that part... I'll expand the answer later. The idea is to use the fact that the smallest fixpoint is the inf of the elements $x$ so that $f(x)le x$.
$endgroup$
– xavierm02
Mar 31 '17 at 13:48
$begingroup$
@NickRioux (I think) I fixed it.
$endgroup$
– xavierm02
Mar 31 '17 at 14:50
$begingroup$
Still digesting this but it seems really great. Thanks again! I was wondering, if we assume $V$ and $S$ are disjoint, does that change your answer to the question of uniqueness?
$endgroup$
– Nick Rioux
Mar 31 '17 at 16:34
$begingroup$
@NickRioux No. In fact this kind of condition will nearly never help. The problem is that you can make a perfect copy (i.e. an isomorphic structure) of $V$ that is disjoint from $V$. And since everything we said is just about the lattice structure, it will be preserved by isomorphism so replacing one of the two $V$s by a disjoint perfect copy won't affect the proof.
$endgroup$
– xavierm02
Mar 31 '17 at 22:44
add a comment |
$begingroup$
Notations:
- $f_s:xmapsto f(x,s)$
- $g_v:ymapsto f(v,y)$
You question is: If $f:Vtimes Sto V$ and $g:Vtimes S to S$ are monotonic, are there $v_*$ and $s_*$ so that $v=mu f_s_*$ and $s=nu g_v_*$?
First, note that since $f$ is monotonic, so is $f_s$ for every $s$ so that $mu f_s$ always exists (by the Knaster–Tarski theorem). Similarly $nu g_v$ always exists.
But this isn't enough because if you take some random $s_0$, then you can take $v_1:=mu f_s_0$ and then $s_2:=nu g_v_1$ but there no reason to have $s_2=s_0$. We could try to go one step further by taking $v_3:=mu f_s_2$ but then again, there would be no reason to have $v_3=v_1$. Can you see where I'm going with this?
What we want is a fixpoint of $(v,s)mapsto (mu f_s,nu g_v)$. Can we have that?
-
Yes! We can just prove that $H:(v,s)mapsto (mu f_s,nu g_v)$ is monotonic. Then we're done by the Knaster–Tarski theorem.
-
Define $F:smapsto f_s$ and $M:fmapsto mu f$. Why are they monotonous?
-
$F$ is monotonic because $sle s'$ implies $forall v, f_s(v)=f(v,s)le f(v,s')=f_s'(v)$.
-
$M$ is monotonic because if $fle g$, then whenever $g(x)le x$ we have the inequality $f(x)le g(x)le x$. We therefore have the inclusion $x:f(x)le xsupseteq x:g(x)le x$. From which we can conclude that $mu f = bigwedgex:f(x)le xle bigwedge x:g(x)le x=mu g$
-
Similar arguments work for $G:vmapsto g_v$ and $N:gmapsto nu g$. If $fle g$, $xle f(x)$ implies $x le f(x) le g(x)$, so $x:x le f(x)subseteq x:x le g(x)$. And we conclude $nu f=bigvee x:x le f(x)le bigvee x:x le g(x) = nu g$
To show that it is not unique, you can take $V=S$, $f(v,s)=vlor s$ and $g(v,s)=vland s$. What's $mu f_s$?
Hint: $v=vlor s$ is equivalent to $sle v$
-
$mu f_s$ is the smallest $v$ so that $v=vlor s$. But $v=vlor s$ is equivalent to $sle v$ so that $mu f_s$ is the smallest $v$ so that $s le v$, that is $mu f_s=s$. Similarly $nu g_v=v$. So taking $s=v$ is sufficient to satisfy your conditions. Since there are complete lattices with more than one element, we can therefore conclude that the couple $(v,s)$ is not unique in general.
As for references, I don't really know. I scrolled through this and it looks nice. You could try to use induction or coinduction as keywords in your search.
$endgroup$
Notations:
- $f_s:xmapsto f(x,s)$
- $g_v:ymapsto f(v,y)$
You question is: If $f:Vtimes Sto V$ and $g:Vtimes S to S$ are monotonic, are there $v_*$ and $s_*$ so that $v=mu f_s_*$ and $s=nu g_v_*$?
First, note that since $f$ is monotonic, so is $f_s$ for every $s$ so that $mu f_s$ always exists (by the Knaster–Tarski theorem). Similarly $nu g_v$ always exists.
But this isn't enough because if you take some random $s_0$, then you can take $v_1:=mu f_s_0$ and then $s_2:=nu g_v_1$ but there no reason to have $s_2=s_0$. We could try to go one step further by taking $v_3:=mu f_s_2$ but then again, there would be no reason to have $v_3=v_1$. Can you see where I'm going with this?
What we want is a fixpoint of $(v,s)mapsto (mu f_s,nu g_v)$. Can we have that?
-
Yes! We can just prove that $H:(v,s)mapsto (mu f_s,nu g_v)$ is monotonic. Then we're done by the Knaster–Tarski theorem.
-
Define $F:smapsto f_s$ and $M:fmapsto mu f$. Why are they monotonous?
-
$F$ is monotonic because $sle s'$ implies $forall v, f_s(v)=f(v,s)le f(v,s')=f_s'(v)$.
-
$M$ is monotonic because if $fle g$, then whenever $g(x)le x$ we have the inequality $f(x)le g(x)le x$. We therefore have the inclusion $x:f(x)le xsupseteq x:g(x)le x$. From which we can conclude that $mu f = bigwedgex:f(x)le xle bigwedge x:g(x)le x=mu g$
-
Similar arguments work for $G:vmapsto g_v$ and $N:gmapsto nu g$. If $fle g$, $xle f(x)$ implies $x le f(x) le g(x)$, so $x:x le f(x)subseteq x:x le g(x)$. And we conclude $nu f=bigvee x:x le f(x)le bigvee x:x le g(x) = nu g$
To show that it is not unique, you can take $V=S$, $f(v,s)=vlor s$ and $g(v,s)=vland s$. What's $mu f_s$?
Hint: $v=vlor s$ is equivalent to $sle v$
-
$mu f_s$ is the smallest $v$ so that $v=vlor s$. But $v=vlor s$ is equivalent to $sle v$ so that $mu f_s$ is the smallest $v$ so that $s le v$, that is $mu f_s=s$. Similarly $nu g_v=v$. So taking $s=v$ is sufficient to satisfy your conditions. Since there are complete lattices with more than one element, we can therefore conclude that the couple $(v,s)$ is not unique in general.
As for references, I don't really know. I scrolled through this and it looks nice. You could try to use induction or coinduction as keywords in your search.
edited Mar 31 '17 at 14:50
answered Mar 30 '17 at 15:14
xavierm02xavierm02
6,65211327
6,65211327
$begingroup$
Thanks for the answer! Sorry if I'm missing something obvious here, but it seems to me that to show $H$ is monotonous you actually need to show $s mapsto mu f_s$ and $v mapsto nu g_v$ are. I don't see how these follow from the fact that F and G are monotonous.
$endgroup$
– Nick Rioux
Mar 31 '17 at 13:22
$begingroup$
Yes. I completely forgot to write that part... I'll expand the answer later. The idea is to use the fact that the smallest fixpoint is the inf of the elements $x$ so that $f(x)le x$.
$endgroup$
– xavierm02
Mar 31 '17 at 13:48
$begingroup$
@NickRioux (I think) I fixed it.
$endgroup$
– xavierm02
Mar 31 '17 at 14:50
$begingroup$
Still digesting this but it seems really great. Thanks again! I was wondering, if we assume $V$ and $S$ are disjoint, does that change your answer to the question of uniqueness?
$endgroup$
– Nick Rioux
Mar 31 '17 at 16:34
$begingroup$
@NickRioux No. In fact this kind of condition will nearly never help. The problem is that you can make a perfect copy (i.e. an isomorphic structure) of $V$ that is disjoint from $V$. And since everything we said is just about the lattice structure, it will be preserved by isomorphism so replacing one of the two $V$s by a disjoint perfect copy won't affect the proof.
$endgroup$
– xavierm02
Mar 31 '17 at 22:44
add a comment |
$begingroup$
Thanks for the answer! Sorry if I'm missing something obvious here, but it seems to me that to show $H$ is monotonous you actually need to show $s mapsto mu f_s$ and $v mapsto nu g_v$ are. I don't see how these follow from the fact that F and G are monotonous.
$endgroup$
– Nick Rioux
Mar 31 '17 at 13:22
$begingroup$
Yes. I completely forgot to write that part... I'll expand the answer later. The idea is to use the fact that the smallest fixpoint is the inf of the elements $x$ so that $f(x)le x$.
$endgroup$
– xavierm02
Mar 31 '17 at 13:48
$begingroup$
@NickRioux (I think) I fixed it.
$endgroup$
– xavierm02
Mar 31 '17 at 14:50
$begingroup$
Still digesting this but it seems really great. Thanks again! I was wondering, if we assume $V$ and $S$ are disjoint, does that change your answer to the question of uniqueness?
$endgroup$
– Nick Rioux
Mar 31 '17 at 16:34
$begingroup$
@NickRioux No. In fact this kind of condition will nearly never help. The problem is that you can make a perfect copy (i.e. an isomorphic structure) of $V$ that is disjoint from $V$. And since everything we said is just about the lattice structure, it will be preserved by isomorphism so replacing one of the two $V$s by a disjoint perfect copy won't affect the proof.
$endgroup$
– xavierm02
Mar 31 '17 at 22:44
$begingroup$
Thanks for the answer! Sorry if I'm missing something obvious here, but it seems to me that to show $H$ is monotonous you actually need to show $s mapsto mu f_s$ and $v mapsto nu g_v$ are. I don't see how these follow from the fact that F and G are monotonous.
$endgroup$
– Nick Rioux
Mar 31 '17 at 13:22
$begingroup$
Thanks for the answer! Sorry if I'm missing something obvious here, but it seems to me that to show $H$ is monotonous you actually need to show $s mapsto mu f_s$ and $v mapsto nu g_v$ are. I don't see how these follow from the fact that F and G are monotonous.
$endgroup$
– Nick Rioux
Mar 31 '17 at 13:22
$begingroup$
Yes. I completely forgot to write that part... I'll expand the answer later. The idea is to use the fact that the smallest fixpoint is the inf of the elements $x$ so that $f(x)le x$.
$endgroup$
– xavierm02
Mar 31 '17 at 13:48
$begingroup$
Yes. I completely forgot to write that part... I'll expand the answer later. The idea is to use the fact that the smallest fixpoint is the inf of the elements $x$ so that $f(x)le x$.
$endgroup$
– xavierm02
Mar 31 '17 at 13:48
$begingroup$
@NickRioux (I think) I fixed it.
$endgroup$
– xavierm02
Mar 31 '17 at 14:50
$begingroup$
@NickRioux (I think) I fixed it.
$endgroup$
– xavierm02
Mar 31 '17 at 14:50
$begingroup$
Still digesting this but it seems really great. Thanks again! I was wondering, if we assume $V$ and $S$ are disjoint, does that change your answer to the question of uniqueness?
$endgroup$
– Nick Rioux
Mar 31 '17 at 16:34
$begingroup$
Still digesting this but it seems really great. Thanks again! I was wondering, if we assume $V$ and $S$ are disjoint, does that change your answer to the question of uniqueness?
$endgroup$
– Nick Rioux
Mar 31 '17 at 16:34
$begingroup$
@NickRioux No. In fact this kind of condition will nearly never help. The problem is that you can make a perfect copy (i.e. an isomorphic structure) of $V$ that is disjoint from $V$. And since everything we said is just about the lattice structure, it will be preserved by isomorphism so replacing one of the two $V$s by a disjoint perfect copy won't affect the proof.
$endgroup$
– xavierm02
Mar 31 '17 at 22:44
$begingroup$
@NickRioux No. In fact this kind of condition will nearly never help. The problem is that you can make a perfect copy (i.e. an isomorphic structure) of $V$ that is disjoint from $V$. And since everything we said is just about the lattice structure, it will be preserved by isomorphism so replacing one of the two $V$s by a disjoint perfect copy won't affect the proof.
$endgroup$
– xavierm02
Mar 31 '17 at 22:44
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2210240%2fsimultaneous-least-greatest-fixed-points%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown