Soundness (interactive proof): Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Gadget850
fix math error
 
en>박중현
m TeX command correction
 
Line 1: Line 1:
Hi there! :) My name is Edgar, I'm a student studying Medicine from Sittard, Netherlands.<br><br>My page - [http://clashofclans.free-hack.org/ clash of clans hack for gems]
{{tone|date=January 2012}}
{{inappropriate person|article|we|date=January 2012}}
In mathematics, the '''Szpilrajn extension theorem''', due to {{harvs|txt|authorlink=Edward Szpilrajn|first=Edward |last=Szpilrajn|year=1930}} (later called [[Edward Marczewski]]), is one of many examples of the use of the [[axiom of choice]] (in the form of [[Zorn's lemma]]) to find a maximal set with certain properties.
 
The theorem states that, given a [[binary relation]] ''R'' that is [[irreflexive relation|irreflexive]] and [[transitive relation|transitive]] it is always possible to find an extension of the relation (i.e. a relation ''T'' that strictly includes ''R'') which is [[asymmetric relation|asymmetric]], [[negatively transitive]] and [[Connectedness|connected]].
 
First of all, we need some definitions to be clear upon the terminology we will use speaking about relations with particular properties.
 
== Definition (negative transitivity) ==
Given a [[binary relation]] <math>R \subseteq X\times X</math> on a generic [[set (mathematics)|set]] <math>X</math>, we say that <math>R</math> is '''negatively transitive''' if
:<math> \forall \ x,y,z\in X \ \ \neg (xRz) \and \neg (zRy) \Rightarrow \neg (xRy),</math>
:where by <math>\neg(xRy)</math> we mean <math>(x,y)\not \in R.</math>
 
Note that [[negative transitivity]] can also be rewritten as :<math> \forall \ x,y,z\in X \ \ (xRy) \Rightarrow (xRz) \or (zRy) </math>, simply using the fact that <math>A \Rightarrow B</math> can be rewritten as <math>\neg A \or B
</math>
 
== Definition (connection) ==
Given a [[binary relation]] <math>R \subseteq X\times X</math> on a generic [[set (mathematics)|set]] <math>X</math>, we say that R is ''connected (weakly)'' if :<math>\forall x,y \in X : x\not = y </math> either <math>x R y</math> or <math>y R x</math>.
:Say that R is ''strictly connected'' or ''complete'' if <math>\forall x,y \in X,  xRy \or yRx</math>.
 
== Properties ==
This properties on binary relations can be easily checked by definition:
:R is ''[[irreflexive]]'' and ''[[transitive relation|transitive]]'' <math>\Rightarrow </math> R is ''[[asymmetric relation|asymmetric]]''.<ref>{{cite book|last1=Flaška|first1=V.|last2=Ježek|first2=J.|last3=Kepka|first3=T.|last4=Kortelainen|first4=J.|title=Transitive Closures of Binary Relations I|year=2007|publisher=School of Mathematics - Physics Charles University|location=Prague|page=1|url=http://www.karlin.mff.cuni.cz/~jezek/120/transitive1.pdf?}} Lemma 1.1 (iv). Note that this source refers to asymmetric relations as "strictly antisymmetric".</ref>
:R is ''asymmetric'', ''transitive'' and ''connected'' <math>\Rightarrow </math> R is ''[[negatively transitive]]''.
 
To enounce precisely the theorem, we need yet a couple of definitions and a useful, simple lemma.
 
==Definition (strict orders)==
:A binary relation R is said to be a ''[[strict partial order]]'' if it is irreflexive and transitive, and it is a ''[[strict order]]'' if it is ''asymmetric'', ''negatively transitive'' and ''complete''.
 
==Lemma==
Let R be a strict partial order on X. Then there exists another binary relation T on X which is still a strict partial order and extends R, hence:
:<math>\exists T \subseteq X\times X </math> such that <math> R\subset T </math> and T is another strict partial order on X.
 
This lemma can be easily proved, by taking <math>x\not =y \in X</math> such that  <math>\neg(xRy) \and \neg(yRx)</math>, which exists since the relation is not connected.
 
:Naming: 
:<math>Rx=\{z \in X | zRx\}</math>
:<math>yR=\{z \in X | yRz\}</math>
we can define another relation:
:<math>S=\{x\}\cup Rx \times \{y\}\cup yR \subseteq X \times X. </math>
Finally, set <math>T=R \cup S</math>
which is trivially an extension of R and another strict partial order on X.
 
==Theorem (Szpilrajn's extension theorem)==
Let ''R'' be a strict partial order on a set ''X''. Then there exists a relation ''T'' that extends ''R'' and is a strict order on ''X''.
 
==Proof==
:Let <math>\mathcal{P}=\{P: R\subset P</math>, P is a strict partial order on X<math>\}</math>.
 
We want to show the existence of a maximal element in <math>\mathcal{P}</math> with respect to set inclusion.
 
To do this, we will use Zorn's Lemma. First of all we want to verify the hypothesis of the Lemma, hence that any [[Total_order#Chains|chain]] (respect to inclusion) of <math>\mathcal{P}</math> admits an [[upper bound]] in <math>\mathcal{P}</math>.
 
Let <math>\mathcal{C}</math> be a chain in <math>\mathcal{P}</math>.
 
Define
:<math>\mathcal{M}=\bigcup_{C\in \mathcal{C}} C.</math>
 
Clearly <math>\mathcal{M}</math>  is an upper bound to the chain, but we have to show that <math>\mathcal{M}\in \mathcal{P}</math>, hence that <math>\mathcal{M}</math> is another strict partial order which extends R.
 
Obviously it contains R, as all <math>C\in \mathcal{C}</math> contains R, and it is irreflexive, as
<math>(\bigcup_{C\in \mathcal{C}} C)\cap \Delta_{X} = \bigcup_{C\in \mathcal{C}} (C \cap\Delta_{X})=\empty</math>, since any
:<math>C\in \mathcal{C}</math> is irreflexive,
:<math> \Delta_{X}=\{(x,x)|x \in X\}.</math>
 
We have to show that <math>\mathcal{M}</math> is transitive and here we use the chain properties of <math>\mathcal{C}</math>.
 
Let <math>x,y,z \in X</math> such that <math>x\mathcal{M}y \and y\mathcal{M}z</math> iff <math>(x,y),(y,z) \in \mathcal{M}</math>.
 
As <math>\mathcal{M}</math> is defined as a union of sets, there exists
:<math>P_1,P_2\in \mathcal{C}</math> such that <math>(x,y)\in P_1, (y,z)\in P_2.</math>.
 
But <math>\mathcal{C}</math> is a chain with respect to inclusion, hence it holds that  <math>P_1 \subseteq P_2</math>
or vice versa, so that the two couples of elements of X both belong to the same set in the union, and that set is a transitive relation; then also <math>(x,z)</math> is in that set, hence in <math>\mathcal{M}</math>.
 
Applying Zorn's Lemma, we deduce that <math>\mathcal{P}</math> admits an upper bound with respect to set inclusion; let's call T that bound.
 
T has to be a complete relation, as if it was not, we could construct (exactly as in the preceding Lemma) another binary relation which  strictly extends (strictly includes) T and is a strict partial order, so yet another element of <math>\mathcal{P}</math>, contradicting that T is a maximal of <math>\mathcal{P}</math>.
 
So ''T'' is an irreflexive, transitive and complete binary relation on ''X''. But as we observed above, irreflexivity and transitivity give asymmetry that, with transitivity and completeness, give negative transitivity.
 
Hence ''T'' is a strict order on ''X'' that extends the partial order&nbsp;''R''.
 
==References==
 
<references />
*{{Citation | last1=Szpilrajn | first1=E. | title=Sur l'extension de l'ordre partiel | url=http://matwbn.icm.edu.pl/tresc.php?wyd=1&tom=16 | year=1930 | journal=[[Fundamenta Mathematicae]] | issn=0016-2736 | volume=16 | pages=386–389}}
[[Category:Axiom of choice]]
[[Category:Theorems in the foundations of mathematics]]
[[Category:Articles containing proofs]]

Latest revision as of 13:26, 1 January 2014

I am Keisha from Menzingen. I love to play Lute. Other hobbies are Insect collecting.

Stop by my weblog Hostgator Discount Coupon Template:Inappropriate person In mathematics, the Szpilrajn extension theorem, due to Template:Harvs (later called Edward Marczewski), is one of many examples of the use of the axiom of choice (in the form of Zorn's lemma) to find a maximal set with certain properties.

The theorem states that, given a binary relation R that is irreflexive and transitive it is always possible to find an extension of the relation (i.e. a relation T that strictly includes R) which is asymmetric, negatively transitive and connected.

First of all, we need some definitions to be clear upon the terminology we will use speaking about relations with particular properties.

Definition (negative transitivity)

Given a binary relation RX×X on a generic set X, we say that R is negatively transitive if

x,y,zX¬(xRz)¬(zRy)¬(xRy),
where by ¬(xRy) we mean (x,y)∉R.

Note that negative transitivity can also be rewritten as :x,y,zX(xRy)(xRz)(zRy), simply using the fact that AB can be rewritten as ¬AB

Definition (connection)

Given a binary relation RX×X on a generic set X, we say that R is connected (weakly) if :x,yX:x=y either xRy or yRx.

Say that R is strictly connected or complete if x,yX,xRyyRx.

Properties

This properties on binary relations can be easily checked by definition:

R is irreflexive and transitive R is asymmetric.[1]
R is asymmetric, transitive and connected R is negatively transitive.

To enounce precisely the theorem, we need yet a couple of definitions and a useful, simple lemma.

Definition (strict orders)

A binary relation R is said to be a strict partial order if it is irreflexive and transitive, and it is a strict order if it is asymmetric, negatively transitive and complete.

Lemma

Let R be a strict partial order on X. Then there exists another binary relation T on X which is still a strict partial order and extends R, hence:

TX×X such that RT and T is another strict partial order on X.

This lemma can be easily proved, by taking x=yX such that ¬(xRy)¬(yRx), which exists since the relation is not connected.

Naming:
Rx={zX|zRx}
yR={zX|yRz}

we can define another relation:

S={x}Rx×{y}yRX×X.

Finally, set T=RS which is trivially an extension of R and another strict partial order on X.

Theorem (Szpilrajn's extension theorem)

Let R be a strict partial order on a set X. Then there exists a relation T that extends R and is a strict order on X.

Proof

Let 𝒫={P:RP, P is a strict partial order on X}.

We want to show the existence of a maximal element in 𝒫 with respect to set inclusion.

To do this, we will use Zorn's Lemma. First of all we want to verify the hypothesis of the Lemma, hence that any chain (respect to inclusion) of 𝒫 admits an upper bound in 𝒫.

Let 𝒞 be a chain in 𝒫.

Define

=C𝒞C.

Clearly is an upper bound to the chain, but we have to show that 𝒫, hence that is another strict partial order which extends R.

Obviously it contains R, as all C𝒞 contains R, and it is irreflexive, as (C𝒞C)ΔX=C𝒞(CΔX)=, since any

C𝒞 is irreflexive,
ΔX={(x,x)|xX}.

We have to show that is transitive and here we use the chain properties of 𝒞.

Let x,y,zX such that xyyz iff (x,y),(y,z).

As is defined as a union of sets, there exists

P1,P2𝒞 such that (x,y)P1,(y,z)P2..

But 𝒞 is a chain with respect to inclusion, hence it holds that P1P2 or vice versa, so that the two couples of elements of X both belong to the same set in the union, and that set is a transitive relation; then also (x,z) is in that set, hence in .

Applying Zorn's Lemma, we deduce that 𝒫 admits an upper bound with respect to set inclusion; let's call T that bound.

T has to be a complete relation, as if it was not, we could construct (exactly as in the preceding Lemma) another binary relation which strictly extends (strictly includes) T and is a strict partial order, so yet another element of 𝒫, contradicting that T is a maximal of 𝒫.

So T is an irreflexive, transitive and complete binary relation on X. But as we observed above, irreflexivity and transitivity give asymmetry that, with transitivity and completeness, give negative transitivity.

Hence T is a strict order on X that extends the partial order R.

References

  1. 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 Lemma 1.1 (iv). Note that this source refers to asymmetric relations as "strictly antisymmetric".
  • Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010