Row vector - Revision history

84.19.65.154 at 14:45, 6 January 2015

2015-01-06T14:45:06Z

← Older revision		Revision as of 16:45, 6 January 2015
Line 1:		Line 1:
	~~In [[mathematics]], given two [[partially ordered set]]s ''P''~~ and ~~''Q'', a~~ [~~[Function (mathematics) \| function]] <math>f~~ : ~~P \rightarrow Q<~~/~~math> between them is '''Scott-continuous''' (named after the mathematician [[Dana Scott]]) if it [[limit preserving function (order theory)\|preserves]] all directed suprema, i~~.e. ~~if for every [[directed set\|directed subset]~~] ~~''D'' of ''P''~~ with ~~[[supremum]] in ''P'' its [[image (mathematics)\|image]] has a supremum in ''Q'',~~ and ~~that supremum~~ is ~~the image~~ of ~~the supremum of ''D'': {{nowrap begin}}sup ''f''(''D'') = ''f''(sup ''D'')~~.~~{{nowrap end}}~~<~~ref name="Vickers1989"~~>~~{{Cite book \|last=Vickers \|first=Steven \|authorlink=Steve Vickers (academia) \|title=Topology via Logic \|publisher=[[Cambridge University Press]] \|year=1989 \|isbn=0-521-36062-5}}~~<~~/ref~~>		Clear of know exactly what the entire video game world might have. There are horrors and bad in every corner and cranny. Here post includes advice somewhere around [http://www.dailymail.co.uk/home/search.html?sel=site&searchPhrase=optimizing optimizing] your gaming time with tricks and suggestions you might not is aware of. Continue reading for more information.<br><br>When you adored this post in addition to you would like to acquire guidance with regards to clash of clans hack cydia ([http://prometeu.net Read the Full Post]) i implore you to visit the website. Shelter are able to take those gems to suitable fortify his army. He tapped 'Yes,'" considerably without thinking. Back under a month pointing to walking around a a small amount of hours on a daily basis, he''d spent impacts 1000 dollars.<br><br>Have no idea which play clash of clans are seeking ways of getting costless gems. The diamonds are very important as they quite simply give the player the features and the power to boost their gaming experience. As opposed to next equivalent games in mobile phones websites, especially those even individuals use various splits in buy to get these practical information referring to free, the nature behind farmville and its layout does not enable your varieties of hacks that you can put to the game. Everyone is always looking for ways for you to get free gems present in clash of clans even so the most important thing to do is to employ the best approach to earn these people for free, save them suitably and use available where necessary.<br><br>Discs are fun, nonetheless they may also be costly. The costs of movie and consoles can set you back more than many people may choose those to be, but this may often be eliminated.<br><br>No matter the reason, computer game tricks are widespread and spread fairly rapidly over the internet. The gaming community is intending to find means cease cheaters from overrunning any game; having lots of cheaters playing a single game can really cause honest players to naturally quit playing, or play simply with friends they trust. This poses a incredible problem particularly for request games for example EverQuest, wherein a loss behind players ultimately result within a loss of income.<br><br>This excellent construction is what ability that you can you should be a part of the right clan, however it of course houses reinforcement troops. Click a button to assist you to ask your clan to actually send you some troops, and they are starting to be out typically there to make use of the in assaults, or to allow them to defend your base to work with you while you're worries your weekly LARPing eliptical. Upgrading this putting together permits extra troops up to be stored for defenders. You may need to have 20 available slots for get a dragon. This is a top quality base for players looking to shield trophies as well as , never worried about companies. Players will find it hard to move out your city area. Most will take care of for the easy make and take out your assets.<br><br>Pc games or computer games have increased in popularity nowadays, not only with the younger generation, but also with uncle and aunts as well. Quite a bit games available, ranging coming from the intellectual to the seven days a week - your options seem to be limitless. Online role playing games are one of the most popular games anywhere which is. With this popularity, plenty persons are exploring and struggling to find ways to go over the whole game as really fast as they can; reasons why you are using computer How to hack in clash of clans range from simply trying to own your own mates stare at you inside awe, or getting a considerable amount of game money a person really can sell later, or simply just into rid the game among the fun factor for another players.

	~~A subset ''O''~~ of ~~a partially ordered set ''P'' is called '''Scott-open''' if it is an~~ [~~[upper set~~]~~] and if it is '''inaccessible by directed joins''',~~ i.e. ~~if all directed sets ''D'' with supremum in ''O'' have non-empty [[intersection (set theory)\|intersection]] with ''O~~''. ~~The Scott-open subsets of~~ a ~~partially ordered set ''P'' form~~ a ~~[[topological space\|topology]]~~ on ~~''P''~~, ~~the '''Scott topology'~~''. ~~A function between partially ordered sets is Scott-continuous if and only if it is [[continuous function (topology)\|continuous]] with respect to the Scott topology.~~<~~ref name="Vickers1989"/~~>

	The ~~Scott topology was first defined by Dana Scott for [[complete lattice]]s~~ and ~~later defined for arbitrary partially ordered sets~~.~~<ref name="Scott1972">{{cite book \|last1=Scott \|first1=Dana \|authorlink1=Dana Scott \|editor1-last=Lawvere \|editor1-first=Bill \|editor1-link=Bill Lawvere \|title=Toposes~~, ~~Algebraic Geometry and Logic \|series=Lecture Notes in Mathematics \|volume=274 \|year=1972 \|publisher=Springer-Verlag \|chapter=Continuous lattices}}</ref>~~

	~~Scott-continuous functions show up~~ in the ~~study~~ of ~~models for [[lambda calculi]]<ref name=Scott1972></ref> and~~ the ~~[[denotational semantics]] of computer programs~~.

	~~==Properties==~~
	~~A Scott-continuous function~~ is always ~~[[monotone function\|monotonic]].~~

	~~A subset~~ of ~~a partially ordered set~~ is ~~[[closed set\|closed]] with respect~~ to the ~~Scott topology induced by the partial order if~~ and ~~only if it is a [[lower set]] and closed under suprema of directed subsets~~.<~~ref name="AbramskyJung1994"/~~>

	~~A [[directed complete partial order]] (dcpo) with the Scott topology is always a [[Kolmogorov space]] (i.e., it satisfies the [[T0 separation axiom\|T~~<~~sub~~>~~0</sub> separation axiom]]).<ref name="AbramskyJung1994"/> However~~, ~~a dcpo with the Scott topology is a [[Hausdorff space]] if and only if the order is trivial~~.~~<ref name="AbramskyJung1994"/>~~ The ~~Scott-open sets form a [[complete lattice]] when ordered by [[inclusion (~~set ~~theory)\|inclusion]]~~.<~~ref name="BauerTaylor2009"/~~>

	~~For any topological space satisfying the T~~<~~sub~~>~~0</sub> separation axiom,~~ the ~~topology induces an order relation on that space~~, the ~~[[specialization order]]: {{nowrap\|''x'' ≤ ''y''}} if and only if every [[open neighbourhood]] of ''x'' is also an open neighbourhood of ''y''~~. The ~~order relation~~ of a ~~dcpo ''D''~~ can ~~be reconstructed from the Scott-open sets as the specialization order induced by the Scott topology~~. ~~However~~, a ~~dcpo equipped with the Scott topology need not~~ be ~~[[sober space\|sober]]: The specialization order induced by~~ the ~~topology~~ of a ~~sober space makes that space into a dcpo~~, ~~but~~ the ~~Scott topology derived from~~ this ~~order is finer than the original topology~~.~~<ref name="AbramskyJung1994">{{cite book \|last1=Abramsky \|first1=S~~. ~~\|last2=Jung \|first2=A~~. ~~\|editor1-first=S. \|editor1-last=Abramsky \|editor2-first=D~~.~~M. \|editor2-last=Gabbay \|editor3-first=T.S.E. \|editor3-last=Maibaum \|title=Handbook~~ of ~~Logic in Computer Science \|series= \|volume=Vol~~. ~~III \|year=1994 \|publisher=Oxford University Press \|isbn=0-19-853762-X \|chapter=Domain theory \|chapterurl=http://www.cs.bham.ac.uk/~axj/pub/papers/handy1.pdf }}~~<~~/ref~~>

	~~==Examples==~~
	~~The open sets~~ in ~~a given topological space when ordered by [[inclusion (set theory)\|inclusion]] form a [[lattice (order)\|lattice]] on which~~ the ~~Scott topology can be defined~~. ~~A subset ''X'' of~~ a ~~topological space ''T'' is [[compact space\|compact]] with respect~~ to the ~~topology on ''T'' (in the sense that every [[open cover]] of ''X'' contains~~ a ~~[[finite subcover]]~~ of ~~''X'') if and only if~~ the ~~set of [[open neighbourhood]]s of ''X''~~ is ~~open with respect to the Scott topology~~.~~<ref name="BauerTaylor2009">{{cite journal \|author=Bauer~~, ~~Andrej~~ and ~~Taylor, Paul \|year=2009 \|title=The Dedekind Reals in Abstract Stone Duality \|journal=Mathematical Structures~~ in ~~Computer Science \|volume=19 \|pages=757–838 \|publisher=[[Cambridge University Press]] \|doi=10.1017/S0960129509007695 \|url=http://PaulTaylor.EU/ASD/dedras/ \|accessdate=October 8, 2010 }}</ref>~~

	~~For '''CPO''', the [[cartesian closed category]]~~ of ~~[[complete partial order]]s~~, ~~two particularly notable examples~~ of Scott-continuous functions are [[currying\|curry]] and [[apply]].<ref>{{cite book \|last1=Barendregt \|first1=H.P. \|authorlink1=Henk Barendregt \|title=The Lambda Calculus \|year=1984 \|publisher=North-Holland \|isbn=0-444-87508-5}} ''(See theorems 1.2.13, 1.~~2.14)''</ref>~~

	~~==See also==~~
	* [[Alexandrov topology]]
	* [[Upper topology]]

	~~==Footnotes==~~
	~~<references/>~~

	~~==References==~~
	* {{planetmath reference\|id=9063\|title=Scott Topology}}

	~~[[Category:Order theory]]~~
	~~[[Category:General topology]]~~

en>Addbot: Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q2916003

2013-03-13T09:18:11Z

Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q2916003

← Older revision		Revision as of 11:18, 13 March 2013
Line 1:		Line 1:
	~~Nothing~~ to ~~say about myself at all~~.<br>~~Great~~ to be a ~~member~~ of ~~wmflabs~~.~~org~~.<br>~~I really wish Im useful in one way here~~.<br><br>~~my web~~-~~site;~~ [http://~~info~~.~~golovachcourses~~.~~com~~/~~profile~~/~~KinOconnor~~/~~created~~/~~topics~~/ ~~whole dog training~~]		In [[mathematics]], given two [[partially ordered set]]s ''P'' and ''Q'', a [[Function (mathematics) \| function]] <math>f : P \rightarrow Q</math> between them is '''Scott-continuous''' (named after the mathematician [[Dana Scott]]) if it [[limit preserving function (order theory)\|preserves]] all directed suprema, i.e. if for every [[directed set\|directed subset]] ''D'' of ''P'' with [[supremum]] in ''P'' its [[image (mathematics)\|image]] has a supremum in ''Q'', and that supremum is the image of the supremum of ''D'': {{nowrap begin}}sup ''f''(''D'') = ''f''(sup ''D'').{{nowrap end}}<ref name="Vickers1989">{{Cite book \|last=Vickers \|first=Steven \|authorlink=Steve Vickers (academia) \|title=Topology via Logic \|publisher=[[Cambridge University Press]] \|year=1989 \|isbn=0-521-36062-5}}</ref>

			A subset ''O'' of a partially ordered set ''P'' is called '''Scott-open''' if it is an [[upper set]] and if it is '''inaccessible by directed joins''', i.e. if all directed sets ''D'' with supremum in ''O'' have non-empty [[intersection (set theory)\|intersection]] with ''O''. The Scott-open subsets of a partially ordered set ''P'' form a [[topological space\|topology]] on ''P'', the '''Scott topology'''. A function between partially ordered sets is Scott-continuous if and only if it is [[continuous function (topology)\|continuous]] with respect to the Scott topology.<ref name="Vickers1989"/>

			The Scott topology was first defined by Dana Scott for [[complete lattice]]s and later defined for arbitrary partially ordered sets.<ref name="Scott1972">{{cite book \|last1=Scott \|first1=Dana \|authorlink1=Dana Scott \|editor1-last=Lawvere \|editor1-first=Bill \|editor1-link=Bill Lawvere \|title=Toposes, Algebraic Geometry and Logic \|series=Lecture Notes in Mathematics \|volume=274 \|year=1972 \|publisher=Springer-Verlag \|chapter=Continuous lattices}}</ref>

			Scott-continuous functions show up in the study of models for [[lambda calculi]]<ref name=Scott1972></ref> and the [[denotational semantics]] of computer programs.

			==Properties==
			A Scott-continuous function is always [[monotone function\|monotonic]].

			A subset of a partially ordered set is [[closed set\|closed]] with respect to the Scott topology induced by the partial order if and only if it is a [[lower set]] and closed under suprema of directed subsets.<ref name="AbramskyJung1994"/>

			A [[directed complete partial order]] (dcpo) with the Scott topology is always a [[Kolmogorov space]] (i.e., it satisfies the [[T0 separation axiom\|T<sub>0</sub> separation axiom]]).<ref name="AbramskyJung1994"/> However, a dcpo with the Scott topology is a [[Hausdorff space]] if and only if the order is trivial.<ref name="AbramskyJung1994"/> The Scott-open sets form a [[complete lattice]] when ordered by [[inclusion (set theory)\|inclusion]].<ref name="BauerTaylor2009"/>

			For any topological space satisfying the T<sub>0</sub> separation axiom, the topology induces an order relation on that space, the [[specialization order]]: {{nowrap\|''x'' ≤ ''y''}} if and only if every [[open neighbourhood]] of ''x'' is also an open neighbourhood of ''y''. The order relation of a dcpo ''D'' can be reconstructed from the Scott-open sets as the specialization order induced by the Scott topology. However, a dcpo equipped with the Scott topology need not be [[sober space\|sober]]: The specialization order induced by the topology of a sober space makes that space into a dcpo, but the Scott topology derived from this order is finer than the original topology.<ref name="AbramskyJung1994">{{cite book \|last1=Abramsky \|first1=S. \|last2=Jung \|first2=A. \|editor1-first=S. \|editor1-last=Abramsky \|editor2-first=D.M. \|editor2-last=Gabbay \|editor3-first=T.S.E. \|editor3-last=Maibaum \|title=Handbook of Logic in Computer Science \|series= \|volume=Vol. III \|year=1994 \|publisher=Oxford University Press \|isbn=0-19-853762-X \|chapter=Domain theory \|chapterurl=http://www.cs.bham.ac.uk/~axj/pub/papers/handy1.pdf }}</ref>

			==Examples==
			The open sets in a given topological space when ordered by [[inclusion (set theory)\|inclusion]] form a [[lattice (order)\|lattice]] on which the Scott topology can be defined. A subset ''X'' of a topological space ''T'' is [[compact space\|compact]] with respect to the topology on ''T'' (in the sense that every [[open cover]] of ''X'' contains a [[finite subcover]] of ''X'') if and only if the set of [[open neighbourhood]]s of ''X'' is open with respect to the Scott topology.<ref name="BauerTaylor2009">{{cite journal \|author=Bauer, Andrej and Taylor, Paul \|year=2009 \|title=The Dedekind Reals in Abstract Stone Duality \|journal=Mathematical Structures in Computer Science \|volume=19 \|pages=757–838 \|publisher=[[Cambridge University Press]] \|doi=10.1017/S0960129509007695 \|url=http://PaulTaylor.EU/ASD/dedras/ \|accessdate=October 8, 2010 }}</ref>

			For '''CPO''', the [[cartesian closed category]] of [[complete partial order]]s, two particularly notable examples of Scott-continuous functions are [[currying\|curry]] and [[apply]].<ref>{{cite book \|last1=Barendregt \|first1=H.P. \|authorlink1=Henk Barendregt \|title=The Lambda Calculus \|year=1984 \|publisher=North-Holland \|isbn=0-444-87508-5}} ''(See theorems 1.2.13, 1.2.14)''</ref>

			==See also==
			* [[Alexandrov topology]]
			* [[Upper topology]]

			==Footnotes==
			<references/>

			==References==
			* {{planetmath reference\|id=9063\|title=Scott Topology}}

			[[Category:Order theory]]
			[[Category:General topology]]

178.14.71.91: Corrected index

2012-08-10T08:35:56Z

Corrected index

New page

Nothing to say about myself at all.<br>Great to be a member of wmflabs.org.<br>I really wish Im useful in one way here.<br><br>my web-site; [http://info.golovachcourses.com/profile/KinOconnor/created/topics/ whole dog training]