Knowledge

Talk:Well-order

Source 📝

2396:'well-order relation' make it sound like it's some special type of relation stand alone" doesn't have a clear meaning; it is indeed a special type of relation, but what are the words "stand alone" intended to convey? The only way I can make any sense out of your remarks is to assume that you have a misunderstanding of what the word "relation" means in mathematics. A relation is a set of ordered pairs from a set. For example, we can define a relation called "is less than" on the set of integers. That relation then includes, amongst others, the pairs (2, 87), (-5, -1), and so on. We can also define another relation, also called "is less than" on the set of positive real numbers. That will include the pair (2, 87) but not (-5, -1); it will also include (2.7, π). Note that these are two different relations. In a context where it is clear what particular relation we are referring to, we can just use a name for it such as "is less than" or "<", but in any context where order relations on different sets are used, we have to use a notation which distinguishes between them. I suspect from what you have said above that you had not realised that the standard interpretation of "relation" in mathematics is a specific relation on a specific set. 1444:
prove? Since we are assuming the set is well-ordered, it is already order-isomorphic to a unique ordinal, and thus has an infinitely decreasing sequence if and only if the ordinal does as well. However, it is easy to prove that any decreasing sequence of ordinals (and thus decreasing sequence of elements of an ordinal) is finite by transfinite induction without any form of the Axiom of Choice. If every ordinal smaller than alpha has no infinitely decreasing subset, then alpha has no infinitely decreasing subset, for its first element must be some alpha_0 < alpha. After this element, every other element is in alpha_0, so the remainder of the sequence must be finite. However, adding a term to a finite sequence does not yield an infinite sequence.
2440:"The relation you have referred to is a relation on the natural numbers ..." It's defined for all natural numbers, it's not necessarily a function over the natural numbers. "A relation is a relation on a particular set ..". No. When we say 'relation on a set' we typically mean a binary relation from/to the same set, but that's not true in general. Relations can also be n-ary. "not some abstract concept divorced from any set ...". A relation itself can be completely represented by a set of tuples. I think you have some fundamental misunderstanding about what a relation is :) 2079:, we should generally stick to the usual sources here, unless there are more mainstream sources that also worry about predicative definitions of well orderings. Analogously, the same holds for mathematical constructivism - few Knowledge math articles spend time on what would happen if their topics were studied in constructive mathematics, because that is not a very common perspective in the references. It would give a distorted perspective if all our math articles were written from the POV of constructivism or predicativism. — Carl 2128:
ways. WP is a nice place to look up various terms and concepts and get a quick back-grounder; but once one starts reading about a topic in depth (i.e. from a book, journal articles) it becomes clear that WP is one giant ball of undue-weight. To turn that around and use it as an argument to NOT extend an article with useful information seems to be a preposterous absurdity. I suppose that sounds harsh, but really, just take a step back and take a look at what's going on in WP math and physics. Its a fair train-wreck.
95: 85: 64: 31: 22: 254:
for all a,b in the set. Rosen doesn't even talk about "strict" posets. But the strictness or otherwise of the ordering doesn't effect the well-ordering condition anyway, since there is a least element whether or not the relation is strict or non-strict. So there is no need to talk about it? In fact I think doing so just add confusion. --
1849:. But it was worth a try :-) Anyway, the word "wohl" in German does have two different meanings, the relevant sense of which presumably does not correspond exactly to the English word well. So perhaps Torvatore's perspective is most natural, that one really ought to consider "well-order" as an indivisible unit. 2425:
I don't know what you mean by "consider the same well-order relation on the reals". The relation you have referred to is a relation on the natural numbers; it is not a relation on the real numbers, so "the same well-order relation on the reals" has no meaning. A relation is a relation on a particular
1876:
Usually, when someone defines "good" in a proof, it's a way of saying, "this is just a notion I want to define for convenience in this particular proof. I understand that, of course, you can't really make 'good' a permanent technical term, but I don't expect this notion to ever be useful outside the
1644:, the ways that hyphens are used to join words are listed. The compound modifier, as in "well-ordered set" is given. Also given are combinations of nouns. When speaking of a "well ordering" neither of these is applicable (unless "well" is noun, such as a place where we get water). That leaves the 1899:
Although we usually use the hyphen in the article, we are not entirely consistent. Probably that should be fixed. Also, perhaps we should have a short section listing the alternatives, or at least a sentence somewhere near the "wellordering" sentence, to indicate that sometimes the separated words
1815:
Unlikely. Mathematicians rarely write about their terminology in that way, so finding references that talk about it is very unlikely. This is true for many aspects of mathematical terminology and notation, not just here. Of course, we also don't say anything about this in the article, which is where
1550:
This is a consequence of ZF, but is independent of Zermelo Set Theory (and if I recall correctly is the biggest reason for preferring ZF over Z set theory.) Is it fair to mention this? Given that Z is a common axiomitization I feel it's a valid thing to mention, unlike for example something that's a
567:
Actually, it is sufficient to discard the reals which are not constructible. That is, because the constructible universe is well-ordered by a specific formula, its intersection with the reals is also well-ordered by that formula. In other words, you can use the construction of the constructible real
200:
Easy. The set of real numbers . It has a least number, 0. What is the least element of the subset consisting of the interval (0,1] ? It is the smallest number greater than zero. But what is the smallest real number greater than zero? (Actually, if the Axiom of Choice is true then there is a way
2104:
which gives different formulations of well-ordering and asserts that they are (provably) equivalent. Nik Weaver's definition seems to be the one referred to in that section as "Transfinite induction works for the entire ordered set". Can you give a reason to doubt that that definition is equivalent
1648:
section. Is it your thinking that a "well-ordering" is like a "lily-of-the-valley", which distinguishes a specific kind of lily from an arbitrary lily growing in the valley? Is it common enough for someone to use "a well ordering" to be an ordering that was done well, but which is not necessarily
1254:
Second, we should not insist on the order being strict, certainly not in the first paragraph of the article. There is no need to mention "strict" at all, as long as you use symbols like < and ≤ which make it clear whether you are talking about a reflexive or areflexive relation. Of course, in
1191:
I'm not an expert and certainly don't understand all that is at stake (I have no idea what that Groundhog's function is :P). But it does seem akward to me that the first sentence defines the well-order relation as strict, but then does nothing with this strictness: the concept of a least element is
253:
As far as I was aware, a poset is by definition is a "non-strict" relation. In my uni Discrete Math text (K.Rosen, Discrete Mathematics) it's simply any reflexive, antisymmetric, transitive relation on a set (thus "non-strict"). A total ordering is a poset with one extra requirement: (a,b) or (b,a)
2395:
above: I too am not really sure what you're getting at. Firstly, it is not true that "there is no such thing as a well-order relation"; the expression "well-order relation" exists, is commonly used by mathematicians, and has the meaning attributed to it in this Knowledge article. Secondly, "Saying
1949:
The fact that the adverb "well" remains "well" as an adjective instead of becoming "good" is common when irregularly transforming words are used in novel ways. Compare "Today, the bird flies; yesterday, the bird flew" with "This inning, the batter flies out; last inning, the batter flied out". I
1900:
do not have a hyphen between them — if for no other reason than to prevent someone who knows the English rules for hyphens from fixing the current article. (FWIW, I don't agree that "mathematicians rarely write about their terminology in that way", but it appears to be moot, so I won't argue it.)
2127:
I was simply reading around, and was interested in alternative formulations and discussions. Weaver's quote seemed notable. Regarding "undue weight", that's just ridiculous: every single math article on WP gives undue weight to one or another topic, and is grossly deficient in a large variety of
1671:
It's just technical jargon, and the question is not whether it conforms to broader English usage (which clearly it doesn't, since an adverb can't modify a noun). "A well order" is pretty much ungrammatical, again, as you say, unless you mean an order inside a well, or perhaps an order that isn't
1346:
JR has reverted Tobias's changes on the grounds that "well-founded only applies to strictly-less; total order only applies to less-or-equal". Those may be the definitions in the linked articles but I do not think either restriction is really standard. In general these things are understood from
1210:
We could: (A) State that some authors take wellorders to be strict and others to be reflexive, and give the two corresponding definitions, (B) say that there are different definitions depending on context, or (C) give a definition that covers both cases (e.g. the irreflexive part has no infinite
1443:
In the "Equivalent Formulations" section, the article states that the Axiom of Dependent Choice is required to prove that a well-ordered set cannot have an infinite decreasing sequence. However, isn't the fact that the set is well-ordered precisely what the Axiom of Dependent Choice is there to
1206:
This is a slightly annoying point — I think I brought it up some years ago but never followed through on it. In actual usage, I agree, both strict and nonstrict orders may be described as wellorders, and no one worries about it much. In an article, we probably have to worry about it at least a
1687:
Both Jech's book and Kunen's books use "well-order", with a hyphen, as in "R is a well-ordering of A" and "A is well-ordered". This is very common in the field of set theory, which this article is about. Given that the article was already established using the hyphenated form, I am in favor of
589:
Can the wellorder of the reals as proved to exist under ZF+AC be explicitly stated, or described in any detail? I'm trying to wrestle with the implications of the wellordering theorem. I can conceptualize wellorders for all finite and countable sets. It would be nice to have an idea of what a
1599:
In English, a hyphen is not generally used to connect an adverb, like "well" to a verb like "ordered". However, when an adverb not ending in "ly" modifies a verb acting as participle and together they modify a subsequent noun then the hyphen is used, as in "well-ordered set". This article,
189:
The definition of a well ordered set says that every subset of a set has a least element. However, since the relational operator must be anti-symmetric, I'm having a hard time imagining a totally ordered set which itself has a least element but has a subset without a least element.
325:
tag from the spelling note; of course this is not the sort of thing for which citations are likely to be available. It's the kind of thing you'd find in a dictionary, but no one writes dictionaries of contemporary set-theoretic usage. If you want a citation in which the spelling is
1192:
in substance the same, whether the order is strict or not (and is actually easier to define with a reflexive order). True, using a reflexive order might make the second sentence a bit more complicated to state; but the readability of the first sentence seems more important to me.
2410:
Consider a so called "well-order relation" on the natural numbers. The natural numbers are a subset of the real numbers. Now consider the same "well-order relation" on the reals. It's not longer well-order relation. The well-ordered-ness comes from the set not from the relation.
2321:
In mathematics, a well-order (or well-ordering or well-order relation) on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering. The set S together with the well-order relation is then called a well-ordered set.
2054:
the classical concept of well-ordering has a variety of formulations which are not predicatively equivalent (see §1.4 and §2.4). In fact, previous discussions of predicativism have tended to ignore this distinction, and this will emerge as a crucial source of confusion (see
1649:"a well ordering" in the sense of the article? If not, but you think that there are other uses for hyphens (such as "as technical non-analyzable terms in which the word has no independent meaning") can you give a citation, Knowledge article, or whatever to support that? 1396:
Sorry about that, I really wasn't aware of that convention. Anyway, I would like to restore my other changes to the lead section which I hope are correct and uncontroversial. I am trying to improve the flow of the lead section which seems a bit unconnected to my eyes.
2354:
I was getting at that there is no such thing as a well-order relation, only a well-ordering (a set plus a relation). I.e. there is no property of a relation taken alone that distinguishes it as a "well-order" relation as distinct from a total ordering. AFAICT anyway.
544:
To Trovatore: You are right that I was not addressing the specific question that was asked. But if his question was motivated by wanting to avoid having to postulate the existence of a set without having a way of constructing it, then I was pointing out that there
1358:
To be sure, we can't be that sloppy in an article for general consumption, but interpreting whatever choice was made by whoever wrote the linked articles as somehow canonical is not the way to go either. Maybe we could use an explanatory footnote or something?
684:
Woodin has also placed a limit on the best lower bound on the complexity you can get just from large cardinals of the sort that we know about (the ones that are preserved under small forcing). As I understand it, he showed that small forcing suffices to add a
245:
uses the nonstrict notion, but the examples given seem to be strict. Among adepts this is one of those things you don't worry too much about because it's usually clear from context, but in an article like this maybe we should be a little more careful.
2369:
I.e. I want to change the above quoted text to remove the first instance of "well-order relation" and replace the second one with just "relation". Saying "well-order relation" make it sound like it's some special type of relation stand alone.
176:
I added an example of how to well order the integers (all the integers), but my reference book is at home, I didn't write it well and it needs a proof it well orders the integers. Somebody please improve it. (marked for cleanup)
1792:
It never occurred to me that it might be "well" in the sense of a space with a bottom! I have always assumed that "well" means that the ordering is good (in some special sense). Does anyone have a reference to resolve this?
201:
to well order the reals, but the proof, in addition to requiring AC, is non constructive so no one knows how to well order the reals. Unlike well ordering integers where there is a way to well order the negative numbers).
616:, every projective set is Lebesgue measurable, so there cannot be a projective well-ordering of the reals, because this would lead to the existence of a projective Vitali set. On the other hand, if V = L then there is a 788:, section "Von Neumann definition of ordinals", this point is made; maybe the reference to the AC should be made more explicit, since "intuition" yells that the AC is invoked whenever we talk about infinite sets :-) 474:
ZF does not prove that R can be wellordered. In fact the usual proof (or at least the first proof that I learned) that ZF does not prove AC, goes through the fact that ZF does not prove there's a wellordering of the
2288: 1816:
a reference would be required. (For the record, as someone who has worked with these orders professionally for years, I have never thought of the "well" as referring to a hole in the ground. ) — Carl
151: 933:, which is totally ordered but is not well-ordered. Am I misreading this part of the article, or is this part incorrect? If it's correct, I think there needs to be a better explanation. 1177: 2539: 1620:
The term "well order", "well-order", or (my preferred version) "wellorder", are better thought of as technical non-analyzable terms in which the word "well" has no independent meaning.
1114: 459:
can be proven to have a well-ordering using only the ZF axioms (without AC)? I guess that means using some conventional construction of R, with Dedekind cuts or whatever. Thanks.
1968:
Consider the infinitive form. You would write "to well-order a set", not "to order a set well". If "well" were acting as an adverb, the first form would be a split infinitive.
715: 646: 457: 648:
well ordering of the reals. So although AC implies that there is a well-ordering of the reals, there may or may not be a nice formula that defines this well-ordering. — Carl
931: 1211:
descending sequence). For (C) we need a source; is there any source that does that? (A) and (B) are more honest but harder to figure out how we deal with the sourcing. --
1950:
don't find it alarming that "well" fails to be irregular when the adverb-verb phrase "well order" transforms to the adjective-noun phrase "well order" or "well ordering".
2188: 409: 2529: 1376:
If ≤ is a (non-strict) well-ordering, then < is a strict well-ordering. A relation is a strict well-ordering if and only if it is a well-founded strict total order.
1762:
suggests that noun adjuncts may or may not be hyphenated. My impression is that in English, such things are generally governed by practice rather than fixed rules.
1477:
the other versions. Without some version of the axiom of choice, there could be a non-well-ordered linear ordering which lacks any infinite decreasing sequences. If
2491:
Yes, this is intentional. The example you are referring to uses an ordering different from the standard ordering. See also the blue example in the picture shown at
2544: 2473:
This would be understandable if the set were defined in accordance with historical convention (i.e. starting with 1), but this explicitly states 0 is in the set.
717:
wellorder of the reals; therefore, no known large cardinals can refute the existence of such a wellorder. I don't know whether that's lightface or boldface. --
35: 1579:
I'm not opposed to mentioning after the fact that you need Replacement to prove this property. But we should still state the property without waffling. --
2554: 907:
How is it equivalent to say if a set is totally ordered then it is well-ordered? The way wolfram math world defines this makes this statement incorrect.
141: 2325:
Is there such a thing as a well-order relation? Will not any total-ordering relation suffice, with the well-ordering arising from the nature set only? --
806:
statement: The way of thinking about infinite sets that we've found most useful, makes it intuitively clear that AC is true. Is that what you meant? --
1615:
The thing is, "well" is not actually an adverb here. If it were, then the noun form would be "good order" (ordinarily, an adverb cannot modify a noun).
1281:
I'll briefly cite some: "The natural numbers are a well-order." "The set {1/n : n =1,2,3,...} has no least element and is therefore not a well-order."
1258:
Third: Personally, I prefer strict orders when talking about well-orders, because then I can use the symbol ∈ to denote the order relation on ordinals.
2524: 1759: 2534: 1873:
Leegrc, I didn't mean that "good ordering" wasn't the intent, etymologically. I think it was. I was saying that it can't be read that way, now.
1915:
Those suggestions make sense, I think. I would note though that the usual English rules also forbid "a well order" (or even "a well ordering").
1668:
an ordering done well. There's nothing "better" about a wellordering than any other ordering (though, certainly, sometimes it is more useful).
1567: 117: 2207:
is the least limit ordinal for which Weaver has not yet chosen a unique preferred (and predicatively acceptable) fundamental sequence at time
289:. The third possibility, namely a poset in which every nonempty subset has a minimal element, is not the same. To prevent confusion between 2549: 1454: 1285: 597: 2340:
Not really sure what you're getting at here. An ordering is a kind of binary relation, but not all total orderings are wellorderings. --
2129: 2061: 1251:
First, {x} always has a minimal element, whether you take the order to be strict or not. You just have to define "minimal" properly.
460: 352: 108: 69: 1327:
was a little confusing. Any help in making the demonstration clearer is welcome, as you can probably see I'm not a native speaker.
1750:
This discussion seems predicated on the notion that "well" is an adverb. But, in the context, it seems equally likely that it is
1547:"Every well-ordered set is uniquely order isomorphic to a unique ordinal number, called the order type of the well-ordered set. " 2227: 2470:
Is there a reason the section in examples about the natural numbers (defined with 0 as an element) claims 1 has no predecessor?
2006:, these subpages are now deprecated. The comments may be irrelevant or outdated; if so, please feel free to remove this section. 1953:
Also note that there are no hyphens in "fly out", "flied out", "linear order", "total order", or "simple order". Just saying.
2519: 1728:
If these authors deliberately-wrote textbooks that clearly-use "well-order" as a verb then that counts as well-written by me.
1625:
That's one reason I like "wellorder", as it seems to make this especially clear. But in any case, all three forms are used. --
2154:
Although I doubt that Weaver would accept this characterization, it seems to me that he is implicitly modeling mathematics as
741:
Every well-ordered set is uniquely order isomorphic to a unique ordinal number, called the order type of the well-ordered set.
875:
to set theory, as to any mathematics; you can't make progress without it. The important (and difficult) thing is to get the
385:
There are various names attached to relations that satisfy some of these conditions and we put them down here for the record.
273:
The intro para was stated in such a way that the linearity of the ordering was a consequence of the proposed definition (a
1056:, as otherwise the empty relation is an exemplar of both the order types 0 and 1, making the proof that Hartog's function 999:? Specifying a total order, or a strict total order, is essentially the same thing, and this insistence is distracting. 612:
In general, the well-ordering of the reals may not be definable in any reasonable way. For example, in a model of ZFC +
44: 857:; there is the natural place to explore in more details what constructions do and what constructions don't require AC. 173:
I think this would be clearer with an example. Does a well-order require the definitions of mathematical sets? - anon
1508:
is a finite sequence of elements above the end of the well-ordered initial segment of the ordering, then there is an
1018:", in the definition in the lede, also presumes strict, at least in its formal definition. If you look closely, if 2500: 1402: 193:
Can anyone give an example of why this definition is necessary? It might be something nice to include on the page.
1179:
more difficult. Also, all the examples in this article are reflexive. Perhaps we should rewrite, after all. —
681:
real is ordinal-definable, and therefore the canonical wellorder of the OD reals is a wellorder of all the reals.
1563: 241:
The article is not very specific about whether it's discussing strict or nonstrict partial orders. The link to
1458: 1289: 1119: 1922:
is a noun, not a verb (though it can also be used as a verb, our article titles are supposed to be nouns; see
601: 2426:
set, not some abstract concept divorced from any set; a relation on a different set is a different relation.
1559: 1398: 1063: 2219: 2133: 2065: 1347:
context, and the appropriate modifications made silently and probably without even noticing. For example
1323:
I think the previous paragraph in the Reals section about the countability of the well-ordered subsets of
1284:
How come these errors weren't caught by anyone? This is mis-information and should be deleted or amended.
1237: 1183: 613: 550: 2496: 2022: 2013: 1015: 978: 938: 464: 194: 50: 1473:, #3 can be deduced from the other versions without DC as you see. Where DC is needed is to go from #3 1332: 94: 974: 934: 2481: 2477: 1555: 1450: 763: 593: 688: 619: 21: 2345: 2299: 2110: 2060:
It seems that this article ignores these distinctions as well, and perhaps that could be remedied?
2017: 1939: 1885: 1715: 1677: 1630: 1584: 1532: 1424: 1383: 1364: 1216: 960: 884: 811: 775: 767: 722: 573: 558: 523: 509: 487: 438: 302: 1672:
sick. "A well-order" at least gets you over the WTF-adverb-before-noun-what-is-this? reaction. --
116:
on Knowledge. If you would like to participate, please visit the project page, where you can join
1954: 1901: 1794: 1729: 1650: 1601: 1348: 1197: 1004: 914: 360: 100: 590:
wellorder of an uncountable set looks like or how it acts. Thanks! - UC Berkeley math student.
84: 63: 1255:
the AC-characterization we have to say "no strictly decreasing sequence" (which we do already).
330:, I can find that for you once I get home (I'd put it on the talk page, not in the article). -- 2159: 1978: 1859: 1772: 1301:
A countably infinite subset of the reals may or may not be a well-order with the standard "≤".
1234: 1180: 862: 834: 793: 752: 670: 349: 394: 2445: 2416: 2375: 2360: 2330: 1958: 1905: 1798: 1733: 1654: 1605: 1266: 504:
holds, then there is a specific (but very complicated) formula which well-orders the reals.
259: 669:
there's a formula at all. That's because there's a canonical, definable, wellorder of the
297:, I think it is better to be explicit that a well ordering is defined to be a well founded 1527:
which is also above the end. But we need DC to make an infinite sequence of such choices.
1308: 854: 744: 568:
numbers themselves to construct a well-ordering of the set of constructible real numbers.
372: 1845:
That, and the fact that well-order was very likely an English translation of the German
1378:". So there is no reason for Tobias's change unless it is more correct which it is not. 747:? Unless I am confusing something, I think "axiom-of-choice-deniers" don't accept this. 2392: 2341: 2295: 2106: 1935: 1923: 1881: 1711: 1673: 1626: 1580: 1528: 1420: 1379: 1360: 1230: 1212: 1033: 956: 880: 807: 785: 771: 718: 569: 554: 549:
a way to construct it provided one is willing to discard all sets which are not in the
519: 505: 483: 422: 331: 247: 1355:
goes — no one bothers AFAIK to state this as "the strict part of Wadge reducibility".
2513: 2431: 2401: 2086: 2076: 2003: 1823: 1695: 1193: 1000: 847: 766:
to prove a certain formalization of it (namely the one that identifies ordinals with
655: 319: 995:
What is the reason for the insistence in the lead on the total order involved being
2075:
Weaver's perspective is not a common one in mathematics. Because of the concept of
1971: 1852: 1765: 1755: 1328: 1039:
On the other hand, requiring the relation to be reflexive allows identification of
908: 858: 830: 789: 748: 1664:
I would prefer no hyphen, but also no space. A wellordering is very specifically
482:
be wellordered, but some larger set (say, the powerset of the reals) cannot be. --
1880:
But what I think is definitive, did I mention that adverbs can't modify nouns? --
2441: 2412: 2386: 2371: 2356: 2326: 2043: 2034:
Last edited at 18:32, 11 May 2007 (UTC). Substituted at 02:41, 5 May 2016 (UTC)
1352: 1262: 255: 242: 113: 1600:
including its title, confuses this distinction and is using too many hyphens.
2492: 2101: 1751: 1470: 1304: 230: 218: 202: 178: 90: 1918:
I think we also ought to make it clear that "well-order" in the sense of the
955:
None the less, I added a few words which I hope will make it clearer to you.
1707: 1439:
Axiom of Dependent Choice and "Every Strictly Descending Sequence is Finite"
285:
order which is well founded in the sense that every nonempty subset has a
2427: 2397: 2082: 1819: 1691: 651: 1233:. Sorry about the confusion. I can't help with sourcing, though. — 1645: 1641: 821: 762:
You don't need choice to prove the above statement. You do need the
281:
element). The alternative way of defining a well ordering is as a
2504: 2485: 2449: 2435: 2420: 2405: 2379: 2364: 2349: 2334: 2303: 2137: 2114: 2091: 2069: 2026: 1985: 1962: 1943: 1909: 1889: 1866: 1828: 1802: 1779: 1737: 1719: 1700: 1681: 1658: 1634: 1609: 1588: 1571: 1536: 1462: 1428: 1406: 1387: 1368: 1336: 1312: 1293: 1270: 1240: 1220: 1201: 1186: 1008: 982: 964: 942: 888: 866: 838: 815: 797: 779: 756: 726: 660: 605: 577: 562: 527: 513: 491: 468: 425: 334: 305: 263: 1706:
Oh, I agree. I wasn't actually suggesting moving the article to
665:
There is however a limit to how bad the simplest formula can be,
501: 1229:, used "Hartogs' function" as a representation of what we call 15: 1754:: as in, every well has a bottom. More precisely, this is a 2283:{\displaystyle \Gamma _{0}\leq W_{t}<\omega _{1}^{CK}\,.} 1469:
You are looking at the wrong direction of implication. In
1998: 952:
say that totally ordered and well ordered are the same.
518:
I don't really see how that relates to the question. --
802:
It does? What intuition is that? I would agree with
2230: 2162: 1595:"a set that is well ordered" vs. "a well-ordered set" 1122: 1066: 917: 825:
Of course, "intuition" and "set theory" are disjoint
691: 622: 478:
However it is also consistent with ZF that the reals
441: 397: 1036:
are always strictly ordered by the element relation.
112:, a collaborative effort to improve the coverage of 1926:.) So the first sentence should start with just " 1688:maintaining it, personal preferences aside. — Carl 1277:
Many fundamental mistakes in the "Reals" subsection
2282: 2182: 1171: 1108: 925: 709: 640: 451: 403: 1351:is nonstrict, and is wellfounded for as high as 1303:so these examples are using that relationship. 909:http://mathworld.wolfram.com/WellOrderedSet.html 217:template from here since it has been cleanedup. 2540:Knowledge level-5 vital articles in Mathematics 2002:, and are posted here for posterity. Following 1996:The comment(s) below were originally left at 1543:Choice of Set theory and independence result. 8: 948:I think that you are misreading it. It does 1299:Right above this list of examples it says 1172:{\displaystyle 2^{H(X)}\leq 2^{2^{X^{2}}}} 58: 2266: 2261: 2248: 2235: 2229: 2172: 2167: 2161: 1319:Countability of well-ordered subsets of R 1159: 1154: 1149: 1127: 1121: 1098: 1093: 1083: 1065: 919: 918: 916: 701: 696: 690: 632: 627: 621: 444: 443: 442: 440: 396: 2466:Natural Numbers - Predecessor of 1 is 0? 2530:Knowledge vital articles in Mathematics 2275: 1551:consequence of the axiom of infinity. 973:Ok, it makes more sense to me, thanks. 677:definable wellorder of the reals, then 60: 19: 1109:{\displaystyle H(X)\leq ^{*}2^{X^{2}}} 368: 358: 2545:B-Class vital articles in Mathematics 1642:Joining section of the Hyphen article 822:Humour... it's a difficult concept... 7: 2038:different formulations of well-order 106:This article is within the scope of 49:It is of interest to the following 2555:High-priority mathematics articles 2316:Definition? :: well-order relation 2232: 2102:Well-order#Equivalent formulations 2100:This article contains the section 2049:(2009) I see that he has written: 1471:well-order#Equivalent formulations 693: 624: 277:order in which every subset has a 14: 2004:several discussions in past years 126:Knowledge:WikiProject Mathematics 2525:Knowledge level-5 vital articles 1374:The existing lead already says " 1227:Set Theory for the Mathematician 416:if it is a wellfounded ordering. 344:Moschovakis, Yiannis N. (1980). 129:Template:WikiProject Mathematics 93: 83: 62: 29: 20: 2042:While reading this: Nik Weaver 710:{\displaystyle \Delta _{2}^{2}} 641:{\displaystyle \Delta _{2}^{1}} 431:well-ordering of reals under ZF 146:This article has been rated as 2535:B-Class level-5 vital articles 1137: 1131: 1076: 1070: 452:{\displaystyle {\mathbb {R} }} 229:The new version looks great! 1: 2505:18:43, 7 September 2024 (UTC) 2486:00:24, 5 September 2024 (UTC) 2380:07:54, 24 December 2023 (UTC) 2365:07:47, 24 December 2023 (UTC) 2350:18:05, 23 December 2023 (UTC) 2335:09:18, 23 December 2023 (UTC) 1720:23:15, 29 February 2016 (UTC) 1701:23:10, 29 February 2016 (UTC) 1682:21:18, 29 February 2016 (UTC) 1659:21:10, 29 February 2016 (UTC) 1635:20:03, 29 February 2016 (UTC) 1610:18:29, 29 February 2016 (UTC) 1429:09:28, 12 December 2012 (UTC) 1407:08:23, 12 December 2012 (UTC) 1388:04:56, 12 December 2012 (UTC) 1369:04:34, 12 December 2012 (UTC) 911:There it uses the example of 889:17:07, 12 December 2008 (UTC) 867:11:05, 12 December 2008 (UTC) 839:11:04, 12 December 2008 (UTC) 816:20:14, 11 December 2008 (UTC) 798:10:40, 11 December 2008 (UTC) 780:18:46, 10 December 2008 (UTC) 757:15:52, 10 December 2008 (UTC) 578:05:29, 15 December 2007 (UTC) 563:08:06, 14 December 2007 (UTC) 528:07:06, 14 December 2007 (UTC) 514:05:51, 14 December 2007 (UTC) 492:18:33, 13 December 2007 (UTC) 469:11:32, 13 December 2007 (UTC) 348:. North Holland. pp. p. 104. 264:08:25, 24 December 2023 (UTC) 120:and see a list of open tasks. 2550:B-Class mathematics articles 2105:to the others listed there? 1313:16:10, 4 February 2012 (UTC) 1294:14:07, 4 February 2012 (UTC) 926:{\displaystyle \mathbb {Z} } 2450:02:40, 6 January 2024 (UTC) 2436:22:19, 5 January 2024 (UTC) 2421:23:54, 4 January 2024 (UTC) 2406:15:35, 4 January 2024 (UTC) 2222:below level α. Notice that 2571: 1537:08:37, 26 March 2013 (UTC) 1463:22:10, 25 March 2013 (UTC) 853:link to the article about 784:Ok, I saw that in article 727:08:01, 19 April 2010 (UTC) 661:01:38, 19 April 2010 (UTC) 606:01:13, 19 April 2010 (UTC) 335:23:22, 30 April 2007 (UTC) 233:13:43, Jun 24, 2005 (UTC) 221:13:46, Jun 24, 2005 (UTC) 205:15:22, Mar 25, 2005 (UTC) 2304:21:17, 11 July 2016 (UTC) 2183:{\displaystyle L_{W_{t}}} 2011: 1986:11:49, 6 March 2016 (UTC) 1963:19:54, 1 March 2016 (UTC) 1944:17:58, 1 March 2016 (UTC) 1910:17:48, 1 March 2016 (UTC) 1890:17:41, 1 March 2016 (UTC) 1867:16:22, 1 March 2016 (UTC) 1829:15:28, 1 March 2016 (UTC) 1803:14:29, 1 March 2016 (UTC) 1780:14:10, 1 March 2016 (UTC) 1738:13:00, 1 March 2016 (UTC) 1589:21:33, 15 July 2014 (UTC) 1572:21:23, 15 July 2014 (UTC) 1447:Am I missing something? 983:23:15, 20 June 2010 (UTC) 965:08:14, 18 June 2010 (UTC) 943:04:50, 18 June 2010 (UTC) 197:05:18, 25 Mar 2005 (UTC) 181:21:46, Feb 7, 2005 (UTC) 145: 78: 57: 2138:19:16, 9 July 2016 (UTC) 2115:05:26, 9 July 2016 (UTC) 2092:22:55, 8 July 2016 (UTC) 2070:21:45, 8 July 2016 (UTC) 2027:18:32, 11 May 2007 (UTC) 1999:Talk:Well-order/Comments 1337:14:39, 21 May 2012 (UTC) 1271:13:50, 12 May 2011 (UTC) 1241:00:46, 12 May 2011 (UTC) 1221:19:45, 11 May 2011 (UTC) 1202:15:40, 11 May 2011 (UTC) 1187:13:20, 11 May 2011 (UTC) 1032:-minimal element. And, 1009:09:22, 11 May 2011 (UTC) 871:Intuition is absolutely 404:{\displaystyle \preceq } 306:13:10, 1 July 2006 (UTC) 250:8 July 2005 00:04 (UTC) 152:project's priority scale 903:Equivalent Formulations 426:05:17, 1 May 2007 (UTC) 109:WikiProject Mathematics 2520:B-Class vital articles 2284: 2184: 2044:Predicativity Beyond Γ 1173: 1110: 927: 739:How does the sentence 711: 642: 614:projective determinacy 551:constructible universe 453: 405: 380:The relevant quote is 346:Descriptive Set Theory 2476:Is this intentional? 2285: 2185: 2014:Well-founded relation 1174: 1111: 928: 712: 643: 454: 406: 311:unhyphenated spelling 36:level-5 vital article 2391:I echo the words of 2228: 2160: 1120: 1064: 1034:von Neumann ordinals 915: 768:von Neumann ordinals 764:axiom of replacement 689: 673:reals. If there is 620: 439: 435:Is it known whether 395: 237:Strict or nonstrict? 132:mathematics articles 2294:What do you think? 2274: 1028:} does not have an 706: 637: 421:Hope this helps, -- 315:I have removed the 2280: 2276: 2257: 2220:constructible sets 2180: 2012:Some overlap with 1992:Assessment comment 1877:current argument." 1349:Wadge reducibility 1169: 1106: 923: 707: 692: 638: 623: 449: 401: 101:Mathematics portal 45:content assessment 2090: 2032: 2031: 2025: 1984: 1865: 1827: 1778: 1699: 1575: 1558:comment added by 1453:comment added by 671:ordinal-definable 659: 596:comment added by 166: 165: 162: 161: 158: 157: 2562: 2497:Jochen Burghardt 2390: 2289: 2287: 2286: 2281: 2273: 2265: 2253: 2252: 2240: 2239: 2189: 2187: 2186: 2181: 2179: 2178: 2177: 2176: 2080: 2021: 2009: 2008: 2001: 1983: 1981: 1969: 1864: 1862: 1850: 1817: 1777: 1775: 1763: 1689: 1574: 1560:James Waddington 1552: 1465: 1399:Tobias Bergemann 1178: 1176: 1175: 1170: 1168: 1167: 1166: 1165: 1164: 1163: 1141: 1140: 1115: 1113: 1112: 1107: 1105: 1104: 1103: 1102: 1088: 1087: 1051: 1023: 932: 930: 929: 924: 922: 852: 846: 716: 714: 713: 708: 705: 700: 649: 647: 645: 644: 639: 636: 631: 608: 458: 456: 455: 450: 448: 447: 410: 408: 407: 402: 376: 371:has extra text ( 370: 366: 364: 356: 339:OK, here we go. 324: 318: 134: 133: 130: 127: 124: 103: 98: 97: 87: 80: 79: 74: 66: 59: 42: 33: 32: 25: 24: 16: 2570: 2569: 2565: 2564: 2563: 2561: 2560: 2559: 2510: 2509: 2468: 2384: 2318: 2244: 2231: 2226: 2225: 2217: 2206: 2168: 2163: 2158: 2157: 2047: 2040: 1997: 1994: 1979: 1974: 1970: 1860: 1855: 1851: 1773: 1768: 1764: 1646:Other compounds 1597: 1553: 1545: 1526: 1517: 1507: 1497: 1490: 1483: 1455:140.180.243.190 1448: 1441: 1344: 1321: 1286:212.149.212.108 1279: 1155: 1150: 1145: 1123: 1118: 1117: 1094: 1089: 1079: 1062: 1061: 1040: 1019: 993: 913: 912: 905: 879:intuitions. -- 855:ordinal numbers 850: 844: 843:BTW, I added a 745:axiom of choice 737: 735:Axiom of choice 687: 686: 618: 617: 591: 437: 436: 433: 393: 392: 367: 357: 343: 322: 316: 313: 287:minimal element 271: 239: 227: 211: 187: 171: 131: 128: 125: 122: 121: 99: 92: 72: 43:on Knowledge's 40: 30: 12: 11: 5: 2568: 2566: 2558: 2557: 2552: 2547: 2542: 2537: 2532: 2527: 2522: 2512: 2511: 2508: 2507: 2467: 2464: 2463: 2462: 2461: 2460: 2459: 2458: 2457: 2456: 2455: 2454: 2453: 2452: 2367: 2317: 2314: 2313: 2312: 2311: 2310: 2309: 2308: 2307: 2306: 2292: 2291: 2290: 2279: 2272: 2269: 2264: 2260: 2256: 2251: 2247: 2243: 2238: 2234: 2215: 2202: 2192: 2191: 2190: 2175: 2171: 2166: 2145: 2144: 2143: 2142: 2141: 2140: 2120: 2119: 2118: 2117: 2095: 2094: 2058: 2057: 2045: 2039: 2036: 2030: 2029: 1993: 1990: 1989: 1988: 1977: 1972: 1947: 1946: 1916: 1897: 1896: 1895: 1894: 1893: 1892: 1878: 1874: 1871: 1870: 1869: 1858: 1853: 1836: 1835: 1834: 1833: 1832: 1831: 1808: 1807: 1806: 1805: 1787: 1786: 1785: 1784: 1783: 1782: 1771: 1766: 1743: 1742: 1741: 1740: 1723: 1722: 1685: 1684: 1669: 1638: 1637: 1622: 1621: 1617: 1616: 1596: 1593: 1592: 1591: 1544: 1541: 1540: 1539: 1522: 1512: 1503: 1495: 1488: 1481: 1440: 1437: 1436: 1435: 1434: 1433: 1432: 1431: 1412: 1411: 1410: 1409: 1391: 1390: 1343: 1340: 1320: 1317: 1316: 1315: 1278: 1275: 1274: 1273: 1259: 1256: 1252: 1249: 1248: 1247: 1246: 1245: 1244: 1243: 1231:Hartogs number 1225:My mother, in 1208: 1162: 1158: 1153: 1148: 1144: 1139: 1136: 1133: 1130: 1126: 1101: 1097: 1092: 1086: 1082: 1078: 1075: 1072: 1069: 1037: 992: 989: 988: 987: 986: 985: 968: 967: 953: 921: 904: 901: 900: 899: 898: 897: 896: 895: 894: 893: 892: 891: 841: 786:ordinal number 743:relate to the 736: 733: 732: 731: 730: 729: 704: 699: 695: 682: 635: 630: 626: 598:98.210.233.159 587: 586: 585: 584: 583: 582: 581: 580: 565: 535: 534: 533: 532: 531: 530: 495: 494: 476: 446: 432: 429: 419: 418: 400: 389: 387: 378: 377: 312: 309: 270: 267: 238: 235: 226: 223: 213:I removed the 210: 207: 186: 183: 170: 169:Example needed 167: 164: 163: 160: 159: 156: 155: 144: 138: 137: 135: 118:the discussion 105: 104: 88: 76: 75: 67: 55: 54: 48: 26: 13: 10: 9: 6: 4: 3: 2: 2567: 2556: 2553: 2551: 2548: 2546: 2543: 2541: 2538: 2536: 2533: 2531: 2528: 2526: 2523: 2521: 2518: 2517: 2515: 2506: 2502: 2498: 2494: 2490: 2489: 2488: 2487: 2483: 2479: 2474: 2471: 2465: 2451: 2447: 2443: 2439: 2438: 2437: 2433: 2429: 2424: 2423: 2422: 2418: 2414: 2409: 2408: 2407: 2403: 2399: 2394: 2388: 2383: 2382: 2381: 2377: 2373: 2368: 2366: 2362: 2358: 2353: 2352: 2351: 2347: 2343: 2339: 2338: 2337: 2336: 2332: 2328: 2323: 2315: 2305: 2301: 2297: 2293: 2277: 2270: 2267: 2262: 2258: 2254: 2249: 2245: 2241: 2236: 2224: 2223: 2221: 2214: 2210: 2205: 2201: 2197: 2193: 2173: 2169: 2164: 2156: 2155: 2153: 2152: 2151: 2150: 2149: 2148: 2147: 2146: 2139: 2135: 2131: 2126: 2125: 2124: 2123: 2122: 2121: 2116: 2112: 2108: 2103: 2099: 2098: 2097: 2096: 2093: 2088: 2084: 2078: 2074: 2073: 2072: 2071: 2067: 2063: 2056: 2052: 2051: 2050: 2048: 2037: 2035: 2028: 2024: 2019: 2015: 2010: 2007: 2005: 2000: 1991: 1987: 1982: 1976: 1967: 1966: 1965: 1964: 1960: 1956: 1951: 1945: 1941: 1937: 1934:relation". -- 1933: 1929: 1925: 1921: 1920:article title 1917: 1914: 1913: 1912: 1911: 1907: 1903: 1891: 1887: 1883: 1879: 1875: 1872: 1868: 1863: 1857: 1848: 1844: 1843: 1842: 1841: 1840: 1839: 1838: 1837: 1830: 1825: 1821: 1814: 1813: 1812: 1811: 1810: 1809: 1804: 1800: 1796: 1791: 1790: 1789: 1788: 1781: 1776: 1770: 1761: 1757: 1753: 1749: 1748: 1747: 1746: 1745: 1744: 1739: 1735: 1731: 1727: 1726: 1725: 1724: 1721: 1717: 1713: 1709: 1705: 1704: 1703: 1702: 1697: 1693: 1683: 1679: 1675: 1670: 1667: 1663: 1662: 1661: 1660: 1656: 1652: 1647: 1643: 1636: 1632: 1628: 1624: 1623: 1619: 1618: 1614: 1613: 1612: 1611: 1607: 1603: 1594: 1590: 1586: 1582: 1578: 1577: 1576: 1573: 1569: 1565: 1561: 1557: 1548: 1542: 1538: 1534: 1530: 1525: 1521: 1515: 1511: 1506: 1502: 1494: 1487: 1480: 1476: 1472: 1468: 1467: 1466: 1464: 1460: 1456: 1452: 1445: 1438: 1430: 1426: 1422: 1418: 1417: 1416: 1415: 1414: 1413: 1408: 1404: 1400: 1395: 1394: 1393: 1392: 1389: 1385: 1381: 1377: 1373: 1372: 1371: 1370: 1366: 1362: 1356: 1354: 1350: 1341: 1339: 1338: 1334: 1330: 1326: 1318: 1314: 1310: 1306: 1302: 1298: 1297: 1296: 1295: 1291: 1287: 1282: 1276: 1272: 1268: 1264: 1260: 1257: 1253: 1250: 1242: 1239: 1236: 1232: 1228: 1224: 1223: 1222: 1218: 1214: 1209: 1205: 1204: 1203: 1199: 1195: 1194:David Olivier 1190: 1189: 1188: 1185: 1182: 1160: 1156: 1151: 1146: 1142: 1134: 1128: 1124: 1099: 1095: 1090: 1084: 1080: 1073: 1067: 1059: 1055: 1048: 1044: 1038: 1035: 1031: 1027: 1022: 1017: 1013: 1012: 1011: 1010: 1006: 1002: 1001:David Olivier 998: 990: 984: 980: 976: 972: 971: 970: 969: 966: 962: 958: 954: 951: 947: 946: 945: 944: 940: 936: 910: 902: 890: 886: 882: 878: 874: 870: 869: 868: 864: 860: 856: 849: 842: 840: 836: 832: 828: 824: 823: 819: 818: 817: 813: 809: 805: 801: 800: 799: 795: 791: 787: 783: 782: 781: 777: 773: 769: 765: 761: 760: 759: 758: 754: 750: 746: 742: 734: 728: 724: 720: 702: 697: 683: 680: 676: 672: 668: 664: 663: 662: 657: 653: 633: 628: 615: 611: 610: 609: 607: 603: 599: 595: 579: 575: 571: 566: 564: 560: 556: 552: 548: 543: 542: 541: 540: 539: 538: 537: 536: 529: 525: 521: 517: 516: 515: 511: 507: 503: 499: 498: 497: 496: 493: 489: 485: 481: 477: 473: 472: 471: 470: 466: 462: 430: 428: 427: 424: 417: 413: 398: 390: 388: 386: 383: 382: 381: 374: 362: 354: 353:0-444-70199-0 351: 347: 342: 341: 340: 337: 336: 333: 329: 321: 310: 308: 307: 304: 300: 296: 292: 288: 284: 280: 276: 268: 266: 265: 261: 257: 251: 249: 244: 236: 234: 232: 224: 222: 220: 216: 208: 206: 204: 198: 196: 195:129.110.240.1 191: 184: 182: 180: 174: 168: 153: 149: 148:High-priority 143: 140: 139: 136: 119: 115: 111: 110: 102: 96: 91: 89: 86: 82: 81: 77: 73:High‑priority 71: 68: 65: 61: 56: 52: 46: 38: 37: 27: 23: 18: 17: 2475: 2472: 2469: 2324: 2319: 2212: 2208: 2203: 2199: 2195: 2130:67.198.37.16 2077:undue weight 2062:67.198.37.16 2059: 2053: 2041: 2033: 1995: 1952: 1948: 1931: 1927: 1919: 1898: 1846: 1756:noun adjunct 1686: 1665: 1639: 1598: 1554:— Preceding 1549: 1546: 1523: 1519: 1513: 1509: 1504: 1500: 1492: 1485: 1478: 1474: 1449:— Preceding 1446: 1442: 1375: 1357: 1345: 1342:Strict again 1324: 1322: 1300: 1283: 1280: 1235:Arthur Rubin 1226: 1181:Arthur Rubin 1057: 1053: 1046: 1042: 1029: 1025: 1020: 1016:Well-founded 996: 994: 949: 906: 876: 872: 826: 820: 803: 740: 738: 678: 674: 666: 588: 546: 500:However, if 479: 434: 420: 415: 414:wellordering 411: 384: 379: 345: 338: 327: 314: 298: 294: 290: 286: 282: 278: 274: 272: 252: 240: 228: 214: 212: 199: 192: 188: 175: 172: 147: 107: 51:WikiProjects 34: 1847:wohlordnung 1353:determinacy 991:Why strict? 975:Katachresis 935:Katachresis 592:—Preceding 461:75.62.4.229 243:total order 225:New version 185:Definition? 123:Mathematics 114:mathematics 70:Mathematics 2514:Categories 2493:order type 2478:Jp.nesseth 1932:well-order 1928:well-order 1060:satisfies 269:intro para 2393:Trovatore 2342:Trovatore 2296:JRSpriggs 2198:is time, 2107:JRSpriggs 1936:Trovatore 1930:", not " 1882:Trovatore 1760:This post 1712:Trovatore 1708:wellorder 1674:Trovatore 1627:Trovatore 1581:Trovatore 1529:JRSpriggs 1421:JRSpriggs 1380:JRSpriggs 1361:Trovatore 1213:Trovatore 957:JRSpriggs 881:Trovatore 829:classes. 808:Trovatore 772:Trovatore 719:Trovatore 570:JRSpriggs 555:JRSpriggs 520:Trovatore 506:JRSpriggs 484:Trovatore 423:Trovatore 361:cite book 332:Trovatore 301:order. 248:Trovatore 39:is rated 2018:CMummert 1568:contribs 1556:unsigned 1451:unsigned 1041:<< 1024:, then { 594:unsigned 303:CMummert 2218:is the 1975:ławomir 1955:𝕃eegrc 1924:WP:NOUN 1902:𝕃eegrc 1856:ławomir 1795:𝕃eegrc 1769:ławomir 1730:𝕃eegrc 1651:𝕃eegrc 1640:In the 1602:𝕃eegrc 1329:Odexios 1207:little. 873:central 859:Albmont 831:Albmont 790:Albmont 749:Albmont 369:|pages= 295:minimal 275:partial 215:cleanup 150:on the 41:B-class 2442:Meef4H 2413:Meef4H 2387:Meef4H 2372:Meef4H 2357:Meef4H 2327:Meef4H 2211:, and 2194:where 2055:§1.4). 1752:a noun 1263:Aleph4 1238:(talk) 1184:(talk) 997:strict 475:reals. 299:linear 283:linear 256:Meef4H 209:Clean? 47:scale. 2320:: --> 1980:Biały 1861:Biały 1774:Biały 1498:: --> 1491:: --> 1484:: --> 1305:RJFJR 1052:with 1050:: --> 1049:: --> 1021:x R x 877:right 770:.) -- 679:every 412:is a 291:least 279:least 231:RJFJR 219:RJFJR 203:RJFJR 179:RJFJR 28:This 2501:talk 2495:. - 2482:talk 2446:talk 2432:talk 2417:talk 2402:talk 2376:talk 2361:talk 2346:talk 2331:talk 2300:talk 2255:< 2134:talk 2111:talk 2087:talk 2066:talk 2023:talk 1959:talk 1940:talk 1906:talk 1886:talk 1824:talk 1799:talk 1734:talk 1716:talk 1710:. -- 1696:talk 1678:talk 1655:talk 1631:talk 1606:talk 1585:talk 1564:talk 1533:talk 1518:< 1459:talk 1425:talk 1419:OK. 1403:talk 1384:talk 1365:talk 1333:talk 1309:talk 1290:talk 1267:talk 1217:talk 1198:talk 1005:talk 979:talk 961:talk 939:talk 885:talk 863:talk 848:main 835:talk 827:sets 812:talk 804:this 794:talk 776:talk 753:talk 723:talk 656:talk 602:talk 574:talk 559:talk 524:talk 510:talk 488:talk 465:talk 391:(2) 373:help 350:ISBN 328:used 320:fact 293:and 260:talk 142:High 2428:JBW 2398:JBW 2083:CBM 1820:CBM 1758:. 1692:CBM 1666:not 1499:... 1116:or 950:not 675:any 652:CBM 502:V=L 480:can 2516:: 2503:) 2484:) 2448:) 2434:) 2419:) 2404:) 2378:) 2363:) 2348:) 2333:) 2302:) 2259:ω 2242:≤ 2233:Γ 2136:) 2113:) 2085:· 2068:) 2020:· 2016:. 1961:) 1942:) 1908:) 1888:) 1822:· 1801:) 1736:) 1718:) 1694:· 1680:) 1657:) 1633:) 1608:) 1587:) 1570:) 1566:• 1535:) 1516:+1 1475:to 1461:) 1427:) 1405:) 1386:) 1367:) 1359:-- 1335:) 1311:) 1292:) 1269:) 1261:-- 1219:) 1200:) 1143:≤ 1085:∗ 1081:≤ 1045:, 1007:) 981:) 963:) 941:) 887:) 865:) 851:}} 845:{{ 837:) 814:) 796:) 778:) 755:) 725:) 694:Δ 667:if 654:· 625:Δ 604:) 576:) 561:) 553:. 547:is 526:) 512:) 490:) 467:) 399:⪯ 365:: 363:}} 359:{{ 323:}} 317:{{ 262:) 246:-- 2499:( 2480:( 2444:( 2430:( 2415:( 2400:( 2389:: 2385:@ 2374:( 2359:( 2344:( 2329:( 2298:( 2278:. 2271:K 2268:C 2263:1 2250:t 2246:W 2237:0 2216:α 2213:L 2209:t 2204:t 2200:W 2196:t 2174:t 2170:W 2165:L 2132:( 2109:( 2089:) 2081:( 2064:( 2046:0 1973:S 1957:( 1938:( 1904:( 1884:( 1854:S 1826:) 1818:( 1797:( 1767:S 1732:( 1714:( 1698:) 1690:( 1676:( 1653:( 1629:( 1604:( 1583:( 1562:( 1531:( 1524:n 1520:x 1514:n 1510:x 1505:n 1501:x 1496:2 1493:x 1489:1 1486:x 1482:0 1479:x 1457:( 1423:( 1401:( 1397:— 1382:( 1363:( 1331:( 1325:R 1307:( 1288:( 1265:( 1215:( 1196:( 1161:2 1157:X 1152:2 1147:2 1138:) 1135:X 1132:( 1129:H 1125:2 1100:2 1096:X 1091:2 1077:) 1074:X 1071:( 1068:H 1058:H 1054:R 1047:R 1043:X 1030:R 1026:x 1014:" 1003:( 977:( 959:( 937:( 920:Z 883:( 861:( 833:( 810:( 792:( 774:( 751:( 721:( 703:2 698:2 658:) 650:( 634:1 629:2 600:( 572:( 557:( 522:( 508:( 486:( 463:( 445:R 375:) 355:. 258:( 154:. 53::

Index


level-5 vital article
content assessment
WikiProjects
WikiProject icon
Mathematics
WikiProject icon
icon
Mathematics portal
WikiProject Mathematics
mathematics
the discussion
High
project's priority scale
RJFJR
129.110.240.1
RJFJR
RJFJR
RJFJR
total order
Trovatore
Meef4H
talk
08:25, 24 December 2023 (UTC)
CMummert
13:10, 1 July 2006 (UTC)
fact
Trovatore
23:22, 30 April 2007 (UTC)
ISBN

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.