Individuation for Structured Sets and Leibniz Abstraction
The notion of a structured set appears throughout mathematics. A simple example might be a linear ordering of some kind. In this case, is called the domain, or carrier set. And then is simply a binary relation on .
Note that we normally represent this structured set as . That is, as the ordered pair of the carrier set and the distinguished relation. More generally, a structured set is represented as an ordered tuple,
s. One might have an infinite sequence of distinguished relations, but it is simpler to consider the case of a "finite signature", as the lingo puts it. So, in the simplest case of a domain and a single distinguished relation , we have a structured set usually represented by,
and in that order. Could we not take
and relation ?
The answer seems to be: yes. In fact, all that seems to be required is that given the "components" -- the domain and the distinguished relation - the corresponding structured set is uniquely determined.
So, instead of representing the structured set with domain and distinguished relation as the pair , let us write to mean "the structured set whose domain is and whose distinguished relation is . Then the sole individuation condition is:
to be the ordered pair verifies this, and also taking it to be the ordered pair would verify it too.
So: structured sets are the same structured set exactly if they have the same domain and their distinguished relations are identical.
But this clearly allows that structured sets can be distinct but isomorphic. In other words, there will be lots of cases where,
and let be the transposition that swaps , and , leaving all other alone. Then define:
It looks like they can't be structured sets, for structured sets can be distinct but isomorphic. (On the other hand, one might argue that the abstract structure might not be required to be the same structured set as one started with! So which structured set is it? What is its domain? One idea is that one has a background universe of "nodes" (or maybe collections of nodes, for any given cardinality ), from which to build abstract structured sets. This approach might work. I'm not sure.)
To generalize somewhat, suppose that and are structured sets. We'd like to identify and as the corresponding abstract structures, but we don't know what such a thing is. All we know is that we want to have an individuation condition, a kind of abstraction principle,
satisfying the required condition.
Note that we normally represent this structured set as
So far as I can see, nothing hinges on the fact that there are finitely many distinguished
One might wonder why we take the ordered pair of
as a representation of the structured set with domain
The answer seems to be: yes. In fact, all that seems to be required is that given the "components" -- the domain
So, instead of representing the structured set with domain
Individuation Principle for Structured SetsTaking
iff and .
So: structured sets are the same structured set exactly if they have the same domain and their distinguished relations are identical.
But this clearly allows that structured sets can be distinct but isomorphic. In other words, there will be lots of cases where,
Example. Considerand
iff .
Clearly, the new ordered set
IfSo, how do we find entities that play this role?then
It looks like they can't be structured sets, for structured sets can be distinct but isomorphic. (On the other hand, one might argue that the abstract structure
To generalize somewhat, suppose that
Leibniz AbstractionThat is, given structured sets, the abstract structures are identical exactly if the structured sets are isomorphic. However it is extremely unclear how to define such entities
iff .
Comments
Post a Comment