Total internal reflection: Difference between revisions
No edit summary |
en>Ulflund m Undid revision 593687018 by 50.184.8.151 (talk) |
||
Line 1: | Line 1: | ||
'''Transfinite induction''' is an extension of [[mathematical induction]] to [[well-order|well-ordered sets]], for example to sets of [[ordinal number]]s or [[cardinal number]]s. | |||
== Transfinite induction == | |||
Let P(α) be a [[Property (philosophy)|property]] defined for all ordinals α. Suppose that whenever P(β) is true for all β < α, then P(α) is also true (including the case that P(0) is true given the [[vacuously true]] statement that P(α) is true for all <math>\alpha\in\emptyset</math>). Then transfinite induction tells us that P is true for all ordinals. | |||
That is, if P(α) is true whenever P(β) is true for all β < α, then P(α) is true for all α. Or, more practically: in order to prove a property P for all ordinals α, one can assume that it is already known for all smaller β < α. | |||
Usually the proof is broken down into three cases: | |||
* '''Zero case:''' Prove that <math>P(0)</math> is true. | |||
* '''Successor case:''' Prove that for any [[successor ordinal]] α+1, P(α+1) follows from P(α) (and, if necessary, P(β) for all β < α). | |||
* '''Limit case:''' Prove that for any [[limit ordinal]] λ, P(λ) follows from [P(β) for all β < λ]. | |||
Notice that all three cases are identical except for the type of ordinal considered. They do not formally need to be considered separately, but in practice the proofs are typically so different as to require separate presentations. Zero is sometimes considered a [[limit ordinal]] and then may sometimes be treated in proofs in the same case as limit ordinals. | |||
==Transfinite recursion== | |||
{{technical|section|date=October 2013}} | |||
'''Transfinite recursion''' is a method of constructing or defining something and is closely related to the concept of transfinite induction. As an example, a sequence of sets ''A''<sub>α</sub> is defined for every ordinal α, by specifying how to determine ''A''<sub>α</sub> from the sequence of ''A''<sub>β</sub> for β < α. | |||
More formally, we can state the Transfinite Recursion Theorem as follows. Given a class function ''G'': ''V'' → ''V'', there exists a unique [[transfinite sequence]] ''F'': Ord → ''V'' (where Ord is the class of all ordinals) such that | |||
:''F''(α) = ''G''(''F'' <math>\upharpoonright</math> α) for all ordinals α. | |||
As in the case of induction, we may treat different types of ordinals separately: another formulation of transfinite recursion is that given a set ''g''<sub>1</sub>, and class functions ''G''<sub>2</sub>, ''G''<sub>3</sub>, there exists a unique function ''F'': Ord → ''V'' such that | |||
* ''F''(0) = ''g''<sub>1</sub>, | |||
* ''F''(α + 1) = ''G''<sub>2</sub>(''F''(α)), for all α ∈ Ord, | |||
* ''F''(λ) = ''G''<sub>3</sub>(''F'' <math>\upharpoonright</math> λ), for all limit λ ≠ 0. | |||
Note that we require the domains of ''G''<sub>2</sub>, ''G''<sub>3</sub> to be broad enough to make the above properties meaningful. The uniqueness of the sequence satisfying these properties can be proven using transfinite induction. | |||
More generally, one can define objects by transfinite recursion on any [[well-founded relation]] ''R''. (''R'' need not even be a set; it can be a [[proper class]], provided it is a [[binary relation#Relations over a set|set-like]] relation; that is, for any ''x'', the collection of all ''y'' such that ''y R x'' must be a set.) | |||
==Relationship to the axiom of choice== | |||
Proofs or constructions using induction and recursion often use the [[axiom of choice]] to produce a well-ordered relation that can be treated by transfinite induction. However, if the relation in question is already well-ordered, one can often use transfinite induction without invoking the axiom of choice.<ref>In fact, the domain of the relation does not even need to be a set. It can be a proper class, provided that the relation ''R'' is set-like: for any ''x'', the collection of all ''y'' such that ''y'' ''R'' ''x'' must be a set.</ref> For example, many results about [[Borel sets]] are proved by transfinite induction on the ordinal rank of the set; these ranks are already well-ordered, so the axiom of choice is not needed to well-order them. | |||
The following construction of the [[Vitali set]] shows one way that the axiom of choice can be used in a proof by transfinite induction: | |||
: First, [[well-order]] the [[real number]]s (this is where the axiom of choice enters via the [[well-ordering theorem]]), giving a sequence <math> \langle r_{\alpha} | \alpha < \beta \rangle </math>, where β is an ordinal with the [[cardinality of the continuum]]. Let ''v''<sub>0</sub> equal ''r''<sub>0</sub>. Then let ''v''<sub>1</sub> equal ''r''<sub>α<sub>1</sub></sub>, where α<sub>1</sub> is least such that ''r''<sub>α<sub>1</sub></sub> − ''v''<sub>0</sub> is not a [[rational number]]. Continue; at each step use the least real from the ''r'' sequence that does not have a rational difference with any element thus far constructed in the ''v'' sequence. Continue until all the reals in the ''r'' sequence are exhausted. The final ''v'' sequence will enumerate the Vitali set. | |||
The above argument uses the axiom of choice in an essential way at the very beginning, in order to well-order the reals. After that step, the axiom of choice is not used again. | |||
Other uses of the axiom of choice are more subtle. For example, a construction by transfinite recursion frequently will not specify a ''unique'' value for ''A''<sub>α+1</sub>, given the sequence up to α, but will specify only a ''condition'' that ''A''<sub>α+1</sub> must satisfy, and argue that there is at least one set satisfying this condition. If it is not possible to define a unique example of such a set at each stage, then it may be necessary to invoke (some form of) the axiom of choice to select one such at each step. For inductions and recursions of [[countable set|countable]] length, the weaker [[axiom of dependent choice]] is sufficient. Because there are models of [[Zermelo–Fraenkel set theory]] of interest to set theorists that satisfy the axiom of dependent choice but not the full axiom of choice, the knowledge that a particular proof only requires dependent choice can be useful. | |||
==See also== | |||
*[[epsilon-induction|∈-induction]] | |||
== Notes == | |||
<references/> | |||
== References == | |||
*{{Citation|last=Suppes|first=Patrick|authorlink=Patrick Suppes|year=1972|title=Axiomatic set theory|publisher=[[Dover Publications]]|isbn=0-486-61630-4|chapter=Section 7.1}} | |||
== External links == | |||
*{{MathWorld |title=Transfinite Induction |id=TransfiniteInduction |author=[[Jonathan Emerson|Emerson, Jonathan]], [[Mark Lezama|Lezama, Mark]] and [[Eric W. Weisstein|Weisstein, Eric W.]] }} | |||
{{Set theory}} | |||
[[Category:Ordinal numbers]] | |||
[[Category:Recursion]] | |||
[[Category:Mathematical induction]] |
Revision as of 14:02, 3 February 2014
Transfinite induction is an extension of mathematical induction to well-ordered sets, for example to sets of ordinal numbers or cardinal numbers.
Transfinite induction
Let P(α) be a property defined for all ordinals α. Suppose that whenever P(β) is true for all β < α, then P(α) is also true (including the case that P(0) is true given the vacuously true statement that P(α) is true for all ). Then transfinite induction tells us that P is true for all ordinals.
That is, if P(α) is true whenever P(β) is true for all β < α, then P(α) is true for all α. Or, more practically: in order to prove a property P for all ordinals α, one can assume that it is already known for all smaller β < α.
Usually the proof is broken down into three cases:
- Successor case: Prove that for any successor ordinal α+1, P(α+1) follows from P(α) (and, if necessary, P(β) for all β < α).
- Limit case: Prove that for any limit ordinal λ, P(λ) follows from [P(β) for all β < λ].
Notice that all three cases are identical except for the type of ordinal considered. They do not formally need to be considered separately, but in practice the proofs are typically so different as to require separate presentations. Zero is sometimes considered a limit ordinal and then may sometimes be treated in proofs in the same case as limit ordinals.
Transfinite recursion
My name is Winnie and I am studying Anthropology and Sociology and Modern Languages and Classics at Rillieux-La-Pape / France.
Also visit my web site ... hostgator1centcoupon.info
Transfinite recursion is a method of constructing or defining something and is closely related to the concept of transfinite induction. As an example, a sequence of sets Aα is defined for every ordinal α, by specifying how to determine Aα from the sequence of Aβ for β < α.
More formally, we can state the Transfinite Recursion Theorem as follows. Given a class function G: V → V, there exists a unique transfinite sequence F: Ord → V (where Ord is the class of all ordinals) such that
As in the case of induction, we may treat different types of ordinals separately: another formulation of transfinite recursion is that given a set g1, and class functions G2, G3, there exists a unique function F: Ord → V such that
Note that we require the domains of G2, G3 to be broad enough to make the above properties meaningful. The uniqueness of the sequence satisfying these properties can be proven using transfinite induction.
More generally, one can define objects by transfinite recursion on any well-founded relation R. (R need not even be a set; it can be a proper class, provided it is a set-like relation; that is, for any x, the collection of all y such that y R x must be a set.)
Relationship to the axiom of choice
Proofs or constructions using induction and recursion often use the axiom of choice to produce a well-ordered relation that can be treated by transfinite induction. However, if the relation in question is already well-ordered, one can often use transfinite induction without invoking the axiom of choice.[1] For example, many results about Borel sets are proved by transfinite induction on the ordinal rank of the set; these ranks are already well-ordered, so the axiom of choice is not needed to well-order them.
The following construction of the Vitali set shows one way that the axiom of choice can be used in a proof by transfinite induction:
- First, well-order the real numbers (this is where the axiom of choice enters via the well-ordering theorem), giving a sequence , where β is an ordinal with the cardinality of the continuum. Let v0 equal r0. Then let v1 equal rα1, where α1 is least such that rα1 − v0 is not a rational number. Continue; at each step use the least real from the r sequence that does not have a rational difference with any element thus far constructed in the v sequence. Continue until all the reals in the r sequence are exhausted. The final v sequence will enumerate the Vitali set.
The above argument uses the axiom of choice in an essential way at the very beginning, in order to well-order the reals. After that step, the axiom of choice is not used again.
Other uses of the axiom of choice are more subtle. For example, a construction by transfinite recursion frequently will not specify a unique value for Aα+1, given the sequence up to α, but will specify only a condition that Aα+1 must satisfy, and argue that there is at least one set satisfying this condition. If it is not possible to define a unique example of such a set at each stage, then it may be necessary to invoke (some form of) the axiom of choice to select one such at each step. For inductions and recursions of countable length, the weaker axiom of dependent choice is sufficient. Because there are models of Zermelo–Fraenkel set theory of interest to set theorists that satisfy the axiom of dependent choice but not the full axiom of choice, the knowledge that a particular proof only requires dependent choice can be useful.
See also
Notes
- ↑ In fact, the domain of the relation does not even need to be a set. It can be a proper class, provided that the relation R is set-like: for any x, the collection of all y such that y R x must be a set.
References
- 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
External links
I had like 17 domains hosted on single account, and never had any special troubles. If you are not happy with the service you will get your money back with in 45 days, that's guaranteed. But the Search Engine utility inside the Hostgator account furnished an instant score for my launched website. Fantastico is unable to install WordPress in a directory which already have any file i.e to install WordPress using Fantastico the destination directory must be empty and it should not have any previous installation files. When you share great information, others will take note. Once your hosting is purchased, you will need to setup your domain name to point to your hosting. Money Back: All accounts of Hostgator come with a 45 day money back guarantee. If you have any queries relating to where by and how to use Hostgator Discount Coupon, you can make contact with us at our site. If you are starting up a website or don't have too much website traffic coming your way, a shared plan is more than enough. Condition you want to take advantage of the worldwide web you prerequisite a HostGator web page, -1 of the most trusted and unfailing web suppliers on the world wide web today. Since, single server is shared by 700 to 800 websites, you cannot expect much speed.
Hostgator tutorials on how to install Wordpress need not be complicated, especially when you will be dealing with a web hosting service that is friendly for novice webmasters and a blogging platform that is as intuitive as riding a bike. After that you can get Hostgator to host your domain and use the wordpress to do the blogging. Once you start site flipping, trust me you will not be able to stop. I cut my webmaster teeth on Control Panel many years ago, but since had left for other hosting companies with more commercial (cough, cough) interfaces. If you don't like it, you can chalk it up to experience and go on. First, find a good starter template design. When I signed up, I did a search for current "HostGator codes" on the web, which enabled me to receive a one-word entry for a discount. Your posts, comments, and pictures will all be imported into your new WordPress blog.