First, I second the other's requests to define "exist".
Second, I don't understand the arguments.
But the identity of indistinguishables does apply to sets: indistinguishable sets are identical. Properties determine sets, so you can’t define a proper subset of brutely distinguishable things.
"Let A and B be brutely distinguishable points. Define the sets M and N as M = {A, B} and N = {B}. N is a proper subset of M."
What I have done wrong in the preceding quotation? It seems like something a mathematician could easily say.
To show that the existence of an actually existing infinite set leads to contradiction, assume the existence of an infinite set of brutely distinguishable points. Now another point pops into existence. The former and latter sets are indistinguishable, yet they aren’t identical. The proviso that the points themselves are indistinguishable allows the sets to be different yet indistinguishable when they’re infinite, proving they can’t be infinite.
- You say that the points are brutely distinguishable and later you say that they are indistinguishable, which nevertheless you hold to be different properties.
- Why are the sets indistinguishable? Although I don't particularly understand what predicates you allow for brutely distinguishable entities, it seems possible to have X = set of all brutely distinguishable points (from some class) and Y = set of all brutely distinguishable points except one. It is, of course, not a definition of Y unless you point out which of the points is missing (which you presumably can't), but even if you don't have a definition of Y, Y may still exist and be distinguishable from X by the property that X contains all the points while Y doesn't.
- If the argument were true, haven't you just shown only that you can't define an infinite set of brutely distinguishable entities, rather than that infinite sets can't be defined at all?
- What is your opinion about the set of all natural numbers? Is it finite or can't it be defined?
- And how does the argument depend on infiniteness, after all? Assume there is a class of eleven brutely distinguishable points. Now, can you define a set containing seven of them? If you can't, since there is no property to distinguish those seven from the remaining four, doesn't it equally well prove that sets of cardinality seven don't exist?
The frequency of heads and of tails is then infinite, so the relative frequency is undefined.
The frequentist definition of probability says that probability is the limit of relative frequencies, which is the limit of (the number of occurrences divided by the number of trials), which is not equal to (limit of the number of occurences) divided by (limit of the number of trials). Note the positions of the brackets.
The sequence {2n/n} = {2/1, 4/2, 6/3, 8/4, ... } = {2, 2, 2, ...} has an obvious well defined limit, even if the limits of both {2n} and {n} are infinite.
A note about formatting: consider not copying a text from a word processor or a web browser directly to the LW post editor. The editor is "smart" and recognises the original font size and type and grey background color and whatever else and imports it to the post, which therefore looks ugly. I'd suggest copying to a Notepad/gedit-style editor first which kills the formatting and then to LW. (And emphasis is usually marked by italics, not red.)
Subscribe to RSS Feed
= f037147d6e6c911a85753b9abdedda8d)
Why? It doesn't follow. (As a trivial case, imagine that there are only two brutely distinguishable things in the world.) (Assuming that by "infinite sets with brutely distinguishable elements" you mean "set with infinitely many b.d. elements".)
Also, you say that sets are distinguishable whenever there is a predicate which applies to one and doesn't apply to another. That is, X and Y are distinguishable iff for some P, P(X) and not P(Y). Right?
But then you argue as if the only allowed predicates were those about cardinality. To closely follow your example, let's denote X = "the former set containing infinitely many b.d. points" and Y = "the latter set containing all those points plus the additional one which 'popped into existence'". Then we have a predicate P(Z) = "Z is a subset of X", and P(X) holds while P(Y) doesn't. What's wrong here?
Your aesthetics are incompatible with most of the readers. You've got quite a lot of negative responses to your formatting, not a single positive response (correct me if I am wrong), yet you still persist and speculate about status reasons. Even if it were true, I'd suggest taking the readers' preferences more seriously, if you want the readers take you more seriously.
To me, coloured text really doesn't seem more legible than bold or italics. Moreover I like when a website has a unified colour scheme which your colours break. All violations of local arbitrary design norms are distracting; the posts aren't art, therefore aesthetics shouldn't trump practical considerations. But if you really that much insist on using colours for emphasis (but consider there may be colourblind people reading this), please at least use the same font and background colour as everybody else.
I just found it curious: I've addressed typography issues in a blog posting, "Emphasis by Typography."
I have to say I'm surprised by your tone; like you're accusing me of some form of immorality for not being attentive to readers. This all strikes me as very curious. I read Hanson's blog and so have gotten attuned to status issues. I'm not plotting a revolution over font choice; I'm only curious about why people find Verdana objectionable just because other postings use a different font.
The argument concerns conceptual possibility, not empirical existence. If actually existing sets can consist of brutely distinguishable elements and of infinite elements, there's nothing to stop it conceptually from being both.
You have located a place for a counter-argument: supplying the conceptual basis. But it seems unlikely that a conceptual argument would successfully undermine brutely distinguishable infinite elements without undermining brutely distinguishable elements in general.
You can distinguish the cardinality of finite sets with brutely distinguishable points. That is, if a set contains 7 points, you can know there are seven different points, and that's all you can know about them.