Comments (8)
Your code only take care of strictly increasing monotone function.
It's non-strict.
It doesn't take into account the strictly decreasing one, IMHO
The theorem isn't true for functions which are strictly decreasing. The definition of continuous most commonly used in domain theory is that the function preserves suprema of directed subsets. That only implies monotone in the increasing direction, and this variant is commonly taken to be the definition of monotone in domain theory.
from proofs.
I removed strict which wasn't true. and thanks for the detailed answer. Domain theory looks even more interesting now !
from proofs.
What is the issue? There are a few different flavors of monotone functions. This one is not strict (because partial orders are reflexive), so it doesn't match the title of the issue.
from proofs.
This is the standard definition for monotone in domain theory (the one that is implied by Scott continuity), so I will close this. But maybe I am missing something, so feel free to re-open if that is the case.
from proofs.
Sorry I wrote it too fast
Your code only take care of strictly increasing monotone function. It doesn't take into account the strictly decreasing one, IMHO
from proofs.
But am I correct that in the sample you provide, we could use different definition for ⊑A and ⊑B, hence in this case we could say ⊑A ≝ \leq and ⊑B ≝ \geq and hence it covers increasing and decreasing monotonic ?
from proofs.
we could say ⊑A ≝ \leq and ⊑B ≝ \geq and hence it covers increasing and decreasing monotonic
You are asking whether we can define monotone as: x <= y implies f(y) <= f(x)
?
No, because this has the same problem that I mentioned before: it is not implied by Scott-continuity.
Also, that would not be very useful; think about what a monotonically decreasing function would mean in terms of the information order. It makes no sense for computable functions, which are the kind studied in domain theory.
from proofs.
Also, that would not be very useful; think about what a monotonically decreasing function would mean in terms of the information order. It makes no sense for computable functions, which are the kind studied in domain theory.
Very good point !!!
from proofs.
Related Issues (1)
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from proofs.