Quantcast
Channel: The House Carpenter
Viewing all articles
Browse latest Browse all 17

A note on the correct definition of a proportion space

$
0
0

Recently I’ve been learning about torsors. A torsor is, in informal terms, an algebraic structure that’s like a group with the identity element “forgotten”. The precise definition (whose connection to the informal notion is not meant to be obvious!) is: a torsor is a set {X} equipped with a group {G} acting on {X} such that for any two elements {a} and {b} of {X}, there is a unique {g \in G} with {ga = b}.

My interest in torsors comes from the idea that the set of all possible values of a dimensional physical quantity, such as mass, is intrinsically a torsor, because the choice of the unit of measurement is arbitrary. Therefore it might make sense to formalize dimensional analysis using the notion of a torsor.

I might have more to say about torsors themselves, and the connection to dimensional analysis, in a future post. But for now, I just want to write about one alternative way of capturing the idea of a “group with the identity element forgotten”, which was described in a blog post by Matt Baker.

Baker introduces the notion of a proportion space, which is a non-empty set {X} equipped with an equivalence relation {(::)} on {X^2} such that:

  1. (PS1) For any two elements {a}, {b} of {X}, we have {(a, a) :: (b,b)}.
  2. (PS2) For any three elements {a}, {b}, {d} of {X}, there is a unique {c \in X} such that {(a, b) :: (c, d)}.

The idea here is that {::} represents a proportion statement, or four-part analogy: for any four elements {a}, {b}, {c}, {d} of {X}, the relation {(a, b) :: (c, d)} is thought of as having the meaning “{a} is to {b} as {c} is to {d}”. Another notation for this meaning which is sometimes seen is

\displaystyle  a : b :: c : d.

For example, in elementary mathematics, where {a}, {b}, {c}, {d} are numbers, this may be used to express that the ratio of {a} to {b} is the same as the ratio of {c} to {d}, or in symbols {a/b = c/d}. In linguistics, the same notation may be used with words in place of {a}, {b}, {c}, {d} to represent an analogy, e.g.

\displaystyle  \mathrm{vector} : \mathrm{vectors} :: \mathrm{torsor} :: \mathrm{torsors}.

Even if you heard about torsors for the first time when reading this article, you likely correctly inferred that “torsors” was the plural of “torsor” by way of the above analogy. Note however that the “existence” part of (PS2) does not seem to be appropriate in a linguistic context: I can easily think of triples of words where there isn’t a natural fourth word to complete the analogy, such as

\displaystyle  \mathrm{dog} : \mathrm{cat} :: \text{\underline{\hspace{1cm}}} : \mathrm{chicken}.

Anyway, Baker claims that proportion spaces, as defined above, are essentially the same as torsors. More precisely, he sketches a proof of the following theorem:

For every set {X}, there is a natural bijection between the proportion spaces on {X} and the equivalence classes of torsors on {X}. (See Baker’s post for details on how equivalence of torsors is defined.)

Unfortunately, this theorem appears to be false for the chosen definition of proportion spaces. The flaw is in the second part of the proof, where a torsor is constructed from a proportion space. In order to construct the group the torsor is to be over, Baker takes the quotient set {X^2/(::)} and defines a product operation on it by the rule that for any four elements {a}, {b}, {c}, {d} of {X}, we have

\displaystyle   [(a, b)]_{::} \cdot [(c, d)]_{::} = [(t(a, b, c), d)]_{::}, \ \ \ \ \ (1)

where {t} is the unique {e \in X} such that {a : b :: e : c} given by (PS2). But he omits the verification that this operation is well-defined, i.e. that for any eight elements {a_1}, {b_1}, {c_1}, {d_1}, {a_2}, {b_2}, {c_2}, {d_2} of {X}, such that {a_1 : b_1 :: a_2 : b_2} and {c_1 : d_1 :: c_2 : d_2}, we have

\displaystyle  t(a_1, b_1, c_1) : d_1 :: t(a_2, b_2, c_2) : d_2.

It turns out that for a general proportion space, this can’t be verified, because it’s a false statement!

Here’s a counterexample. Let {X = \{0, 1, 2\}}, and partition the 8 elements of {X^2} into equivalence classes as follows:

\displaystyle  \begin{array}{rcl}  X_1 = \{(0, 0), (1, 1), (2, 2)\}, \\ X_2 = \{(0, 1), (0, 2), (1, 0)\}, \\ X_3 = \{(1, 2), (2, 0), (2, 1)\}. \end{array}

The resulting equivalence relation {::} clearly satisfies (PS1), since {(1, 1)}, {(2, 2)}, and {(3, 3)} are all in the same equivalence class. As for (PS2), you can scan the above equations and verify that for each {d \in \{0, 1\}}, each of the three equivalence classes {X_1}, {X_2}, {X_3} has exactly one element with {d} as its second projection. Since each {(a, b) \in X^2} belongs to exactly one equivalence class, this implies (PS2). So we may regard {X} as a proportion space. However, if we take

\displaystyle  \begin{array}{rcl}  a_1 = 0, \quad b_1 = 1, \quad c_1 = 0, \quad d_1 = 1, \\ a_2 = 0, \quad b_2 = 2, \quad c_2 = 0, \quad d_2 = 2, \end{array}

then we have

\displaystyle  \begin{array}{rcl}  a_1 : b_1 :: a_2 : b_2, \quad &\text{i.e.} \quad 0 : 1 :: 0 : 2, \\ c_1 : d_1 :: c_2 : d_2, \quad &\text{i.e.} \quad 0 : 1 :: 0 : 2; \end{array}

so for the product operation to be well-defined, we would have to have

\displaystyle  \begin{array}{rcl}  &&t(a_1, b_1, c_1) : d_1 :: t(a_2, b_2, c_2) : d_2, \\ &\text{i.e.} &t(0, 1, 0) : 1 :: t(0, 2, 0) : 2, \\ &\text{i.e.} &1 : 1 :: 1 : 2, \end{array}

and this is false.

By the way, I didn’t find this counterexample by myself. I used Mace4 to do it, using the following input:

formulas(assumptions).

R(x,y,x,y). % reflexivity
R(x,y,w,z) -> R(w,z,x,y). % symmetry
R(x,y,w,z) & R(w,z,u,v) -> R(x,y,u,v). R(x,x,y,y). % transitivity
R(x,y,w1,z) & R(x,y,w2,z) -> w1 = w2. % PS2 (uniqueness)
exists w R(x,y,w,z). % PS2 (existence)

end_of_list.

formulas(goals).

  R(x1,y1,x2,y2) & R(z1,w1,z2,w2)
& R(x1,y1,u1,z1) & R(x2,y2,u2,z2)
  -> R(u1,w1,u2,w2).

end_of_list.

Anyway, what this shows is that the definition of proportion space given by Baker is too weak: to get the desired equivalence with torsors, we need to add an additional axiom to the definition, or strengthen one of the existing axioms. My preference is to strengthen (PS1) to the following statement:

(PS1′) For any four elements {a}, {b}, {c}, {d} of {X}, if {a : b :: c : d}, then {a : c :: b : d}.

This implies (PS1), since we may take {c = a} and {d = b}, and then the antecedent holds by the reflexivity of {(::)} while the succedent is (PS1). And it implies that the product operation given by (1) is well-defined, because for any ten elements {a_1}, {b_1}, {c_1}, {d_1}, {e_1}, {a_2}, {b_2}, {c_2}, {d_2}, {e_2} of {X} such that

\displaystyle  \begin{array}{rcl}  a_1 : b_1 :: a_2 : b_2, && (2) \\ c_1 : d_1 :: c_2 : d_2, && (3) \\ a_1 : b_1 :: e_1 : c_1 &\quad (\text{i.e. } e_1 = t(a_1, b_1, c_1), & (4) \\ a_2 : b_2 :: e_2 : c_2 &\quad (\text{i.e. } e_2 = t(a_2, b_2, c_2), & (5) \end{array}

we have {e_1 : c_1 :: a_1 : b_1 :: a_2 : b_2 :: e_2 : c_2} by symmetry and transitivity applied to (4), (2) and (5), and hence by (PS1′) we have {e_1 : e_2 :: c_1 : c_2}. Applying (PS1′) to (3) as well gives us {c_1 : c_2 :: d_1 : d_2}, and putting these conclusions together using transitivity gives

\displaystyle  e_1 : d_1 :: e_2 : d_2, \quad \text{i.e.} \quad t(a_1, b_1, c_1) : d_1 :: t(a_2, b_2, c_2) : d_2,

as desired.

Edit (9 June 2024): It turns out that I made a mistake too, in the opposite direction! Axiom (PS1′) is in fact too strong. For example, if you consider a group as a torsor over itself, then when turning the torsor into a proportion space, (PS1′) becomes

\displaystyle  ab^{-1} = cd^{-1} \implies ac^{-1} = bd^{-1},

but this is only true when the group is Abelian (in general, {ab^{-1} = cd^{-1}} only implies {c^{-1} a = d^{-1} b}).

In terms of the {t} operation, (PS1′) is equivalent to the identity

\displaystyle   t(a, t(a, b, c), c) = b. \ \ \ \ \ (2)

There is a well-known alternative characterization of torsors, which says that a torsor is equivalent to a heap, which is a set {X} equipped with a ternary operation {t} on {X} satisfying the identities

\displaystyle  \begin{array}{rcl}  &t(a, b, b) = a, \\ &t(a, a, b) = b, \\ &t(a, b, t(c, d, e)) = t(t(a, b, c), d, e). \end{array}

Mace4 readily finds a counterexample where the heap axioms are satisified, but not (2).

OK, here’s my second attempt at amending the definition: I suggest keeping (PS1) in its original form, which says that {a : a :: b : b}, and adding a third axiom

\displaystyle a : b :: c : d \implies b : e :: d : f \implies a : e :: c : f. \quad (3)

This can be understood as saying that the binary relation {(\sim)} on {X^2} defined by

\displaystyle  (a, b) \sim (c, d) \iff a : c :: b : d

is transitive (while (PS1) says it’s reflexive; one can also easily prove that it’s then symmetric). Checking this with Prover9/Mace4, the conjunction of (PS1), (PS2) and (PS3) (along with the stipulation that {(::)} is an equivalence relation) does seem to both imply, and be implied by the heap axioms.

Here’s another proof that the product defined by (1) is well-defined, using (PS3) instead of (PS1′). We are given ten elements {a_1}, {b_1}, {c_1}, {d_1}, {e_1}, {a_2}, {b_2}, {c_2}, {d_2}, {e_2} of {X} such that

\displaystyle  \begin{array}{rcl}  a_1 : b_1 :: a_2 : b_2, && (2) \\ c_1 : d_1 :: c_2 : d_2, && (3) \\ a_1 : b_1 :: e_1 : c_1 &\quad (\text{i.e. } e_1 = t(a_1, b_1, c_1), & (4) \\ a_2 : b_2 :: e_2 : c_2 &\quad (\text{i.e. } e_2 = t(a_2, b_2, c_2), & (5) \end{array}

and we need to prove that {e_1 : d_1 :: e_2 : d_2}. As before, by symmetry and transitivity we obtain {e_1 : c_1 :: e_2 : c_2}. Then we just put this together with (3), using (PS3), and we’re done.

Let’s also check that if we have a {G}-torsor {X}, then the relation {(::)} on {X^2} defined by

\displaystyle  (a, b) :: (c, d) \iff a/b = c/d

satisfies (PS3). (Here {a/b} denotes the unique {g \in G} such that {ga = b}, which exists by the characteristic property of a torsor.) Indeed, if {a/b = c/d}, and {b/e = d/f}, then

\displaystyle  a/e = [(a/b)b]/e = (a/b)(b/e) = (c/d)(d/f) = [(c/d)d]/f = c/f,

using the identity {[(a/b)c]/d = (a/b)(c/d)}, which is related to the third heap axiom.


Viewing all articles
Browse latest Browse all 17

Trending Articles