Crossposted from the AI Alignment Forum. May contain more technical jargon than usual.

Finite Factored Sets: Orthogonality and Time

4Chris van Merwijk

4Gurkenglas

2DanielFilan

2DanielFilan

2Scott Garrabrant

1Chris van Merwijk

2Scott Garrabrant

1Chris van Merwijk

2Scott Garrabrant

New Comment

9 comments, sorted by Click to highlight new comments since: Today at 3:34 PM

I just want to point out some interesting properties of this definition of time: Let time_C refer to the classical notion of time in a dynamical system, and time_FFS the notion defined in this article.

1. Suppose we have a field on space-time generated by a typical differential dynamical law that satisfies time_C-reversal symmetry, and suppose we factorize its histories according to the states of the system at time_C t=0. Then time_FFS doesn't make a distinction between the "positive" and "negative" part of the time_C. That is, if x is some position (choose a reference frame), then the position (x,2) in space-time (i.e. the value of the field at position x at time_C 2) is later in time_FFS than (x,1), but (x,-2) is also later in time than (x,-1). In this sense, the time_FFS notion of time seems to naturally capture the time-reversal symmetry in the laws of physics: Intuitively, if we start at the big bang, and go "backward in time" we are just as much going into the future as we are if we would go "forward in time". Both directions are the future.

2. However, more weirdly, time_FFS also allows a comparison between the negative-time_C and positive-time_C events. Namely, (x,1) happens before_FFS (x,-2) while (x, -1) happens before_FFS (x,2). I am not sure what to make of this, or whether we should make anything of it.

3. Suppose a computer is implemented in the physical world and implements a deterministic function , AND we restrict to the set of histories in which this computer actually does this computation. Now let x denote the variable that captures what input is given to this computer (meaning, the data stored in the input register at one particular instance of running this algorithm), and y similarly denote the variable that captures what the output is, then y occurs (weakly) earlier_FFS than x, even though the variable x is defined to be earlier than y (more precisely, to directly apply the definitions of x and y to check their value in a particular history h would involve doing a check for x at a time_C that is earlier_C than the check for y). I'm not sure what to make of this, though it kind of seems like a feature not a bug. If we don't restrict to the set of histories in which the computer does the computation, I'm pretty sure this result disappears, which makes me think this is actually a desirable property of the theory.

Can't you define for any set of partitions of , rather than w.r.t. a specific factorization , simply as iff ? If so, it would seem to me to be clearer to define that way (i.e. make 7 rather than 2 from proposition 10 the definition), and then basically proposition 10 says "if is a subset of factors of a partition then here are a set of equivalent definitions in terms of chimera". Also I would guess that proposition 11 is still true for rather than just for , though I haven't checked that 11.6 would still work, but it seems like it should.

The main way we'll be using factored sets is as a foundation for talking about concepts like orthogonality and time. Finite factored sets will play a role that's analogous to that of directed acyclic graphs in Pearlian causal inference.

To utilize factored sets in this way, we will first want to introduce the concept of generating a partition with factors.

## 3.1. Generating a Partition with Factors

Definition 16(generating a partition).Given a finite factored setF=(S,B), a partitionX∈Part(S), and aC⊆B, we sayCgeneratesX(inF), writtenC⊢FX, ifχFC(x,S)=xfor allx∈X.The following proposition gives many equivalent definitions of ⊢F.

Proposition 10.LetF=(S,B)be a finite factored set, letX∈Part(S)be a partition ofS, and letCbe a subset ofB. The following are equivalent:.for allx∈X.for allx∈X.for allx,y∈X.for alls,t∈S.for alls,t∈S..Proof.The equivalence of conditions 1 and 2 is by definition.The equivalence of conditions 2 and 3 follows directly from the fact that χFC(s,s)=s for all s∈x, so χFC(x,S)⊇χFC(x,x)⊇x.

To see that conditions 3 and 4 are equivalent, observe that since S=⋃y∈Xy, χFC(x,S)=⋃y∈XχFC(x,y). Thus, if χFC(x,S)⊆x, χFC(x,y)⊆x for all y∈X, and conversely if χFC(x,y)⊆x for all y∈X, then χFC(x,S)⊆x.

To see that condition 3 is equivalent to condition 5, observe that if condition 5 holds, then for all x∈X, we have χFC(s,t)∈[s]X=x for all s∈x and t∈S. Thus χFC(x,S)⊆x. Conversely, if condition 3 holds, χFC(s,t)∈χFC([s]X,S)⊆[s]X for all s,t∈S.

Condition 6 is clearly a trivial restatement of condition 5.

To see that conditions 6 and 7 are equivalent, observe that if condition 6 holds, and s,t∈S satisfy s∼⋁S(C)t, then χFC(s,t)=t, so t=χFC(s,t)∼Xs. Thus X≤S⋁S(C). Conversely, if condition 7 holds, then since χFC(s,t)∼⋁S(C)s for all s,t∈S, we have χFC(s,t)∼Xs. □

Here are some basic properties of ⊢F.

Proposition 11.LetF=(S,B) be a finite factored set, letCandDbe subsets ofB, and letX,Y∈Part(S)be partitions ofS.IfX≤SYandC⊢FY, thenC⊢FX.IfC⊢FXandC⊢FY, thenC⊢FX∨SY..if and only ifX=IndS.IfC⊆DandC⊢FX, thenD⊢FX.IfC⊢FXandD⊢FX, thenC∩D⊢FX.Proof.For the first 5 parts, we will use the equivalent definition from Proposition 10 that C⊢FX if and only if X≤S⋁S(C).Then 1 follows directly from the transitivity of ≤S.

2 follows directly from the fact that any partition Z satisfies X∨SY≤Z if and only if X≤Z and Y≤Z.

3 follows directly from the fact that ⋁S(B)=DisS by Proposition 3.

4 follows directly from the fact that ⋁S({})=IndS, together with the fact that X≤SIndS if and only if X=IndS.

5 follows directly from the fact that if C⊆D, then ⋁S(C)≤⋁S(D).

Finally, we need to prove part 6. For this, we will use the equivalent definition from Proposition 10 that C⊢FX if and only if χFC(s,t)∼Xs for all s,t∈S. Assume that for all s,t∈S, χFC(s,t)∼Xs and χFD(s,t)∼Xs. Thus, for all s,t∈S, χFC∩D(s,t)=χFC(χFD(s,t),t)∼XχFD(s,t)∼Xs. Thus C∩D⊢FX. □

Our main use of ⊢F will be in the definition of the history of a partition.

## 3.2. History

Definition 17(history of a partition).Given a finite factored setF=(S,B)and a partitionX∈Part(S), lethF(X)denote the smallest (according to the subset ordering) subset ofBsuch thathF(X)⊢FX.The history of X, then, is the smallest set of factors C⊆B such that if you're trying to figure out which part in X any given s∈S is in, it suffices to know what part s is in within each of the factors in C. We can informally think of hF(X) as the smallest amount of information needed to compute X.

Proposition 12.Given a finite factored setF=(S,B), and a partitionX∈Part(S),hF(X)is well-defined.Proof.Fix a finite factored set F=(S,B) and a partition X∈Part(S), and let hF(X) be the intersection of all C⊆B such that C⊢FX. It suffices to show that hF(X)⊢FX; then hF(X) will clearly be the unique smallest (according to the subset ordering) subset of B such that hF(X)⊢FX.Note that hF(X) is a finite intersection, since there are only finitely many subsets of B, and that hF(X) is an intersection of a nonempty collection of sets since B⊢FX. Thus, we can express hF(X) as a composition of finitely many binary intersections. By part 6 of Proposition 11, the intersection of two subsets that generate X also generates X. Thus hF(X)⊢FX. □

Here are some basic properties of history.

Proposition 13.LetF=(S,B)be a finite factored set, and letX,Y∈Part(S)be partitions ofS.IfX≤SY, thenhF(X)⊆hF(Y)..if and only ifX=IndS.IfSis nonempty, thenhF(b)={b}for allb∈B.Proof.The first 3 parts are trivial consequences of history's definition and Proposition 11.For the fourth part, observe that {b}⊢Fb by condition 7 of Proposition 10. b is nontrivial, and since S is nonempty, b is nonempty. So we have ¬({}⊢Fb) by part 4 of Proposition 11. Thus {b} is the smallest subset of B that generates b. □

## 3.3. Orthogonality

We are now ready to define the notion of orthogonality between two partitions of S.

Definition 18(orthogonality).Given a finite factored setF=(S,B)and partitionsX,Y∈Part(S), we sayXis orthogonal toY(inF), writtenX⊥FY, ifhF(X)∩hF(Y)={}.If¬(X⊥FY), we sayXis entangled withY(inF).We could also unpack this definition to not mention history or chimera functions.

Proposition 14.Given a finite factored setF=(S,B), and partitionsX,Y∈Part(S),X⊥FYif and only if there exists aC⊆Bsuch thatX≤S⋁S(C)andY≤S⋁S(B∖C).Proof.If there exists a C⊆B such that X≤S⋁S(C) and Y≤S⋁S(B∖C), then C⊢FX and B∖C⊢FY. Thus, hF(X)⊆C and hF(Y)⊆B∖C, so hF(X)∩hF(Y)={}.Conversely, if hF(X)∩hF(Y)={}, let C=hF(X). Then C⊢FX, so X≤S⋁S(C), and B∖C⊇hF(Y), so B∖C⊢FY, so Y≤S⋁S(B∖C). □

Here are some basic properties of orthogonality.

Proposition 15.LetF=(S,B)be a finite factored set, and letX,Y,Z∈Part(S)be partitions ofS.IfX⊥FY, thenY⊥FX.IfX⊥FZandY≤SX, thenY⊥FZ.IfX⊥FZandY⊥FZ, then(X∨SY)⊥FZ.if and only ifX=IndS.Proof.Part 1 is trivial from the symmetry in the definition.Parts 2, 3, and 4 follow directly from Proposition 13. □

## 3.4. Time

Finally, we can define our notion of time in a factored set.

Definition 19((strictly) before).Given a finite factored setF=(S,B), and partitionsX,Y∈Part(S), we sayXis beforeY(inF), writtenX≤FY, ifhF(X)⊆hF(Y).We sayXis strictly beforeY(inF), writtenX<FY, ifhF(X)⊂hF(Y).Again, we could also unpack this definition to not mention history or chimera functions.

Proposition 16.Given a finite factored setF=(S,B), and partitionsX,Y∈Part(S),X≤FYif and only if everyC⊆BsatisfyingY≤S⋁S(C)also satisfiesX≤S⋁S(C).Proof.Note that by part 7 of Proposition 10, part 5 of Proposition 11, and the definition of history, C satisfies Y≤S⋁S(C) if and only if C⊇hF(Y), and similarly for X.Clearly, if hF(Y)⊇hF(X), every C⊇hF(Y) satisfies C⊇hF(X). Conversely, if hF(X) is not a subset of hF(Y), then we can take C=hF(Y), and observe that C⊇hF(Y) but not C⊇hF(X). □

Interestingly, we can also define time entirely as a closure property of orthogonality. We hold that the philosophical interpretation of time as a closure property on orthogonality is natural and transcends the ontology set up in this sequence.

Proposition 17.Given a finite factored setF=(S,B), and partitionsX,Y∈Part(S),X≤FYif and only if everyZ∈Part(S)satisfyingY⊥FZalso satisfiesX⊥FZ.Proof.Clearly if hF(X)⊆hF(Y), then every Z satisfying hF(Y)∩hF(Z)={} also satisfies hF(X)∩hF(Z)={}.Conversely, if hF(X) is not a subset of hF(Y), let b∈B be an element of hF(X) that is not in hF(Y). Assuming S is nonempty, b is nonempty, so we have hF(b)={b}, so Y⊥Fb, but not X⊥Fb. On the other hand, if S is empty, then X=Y={}, so clearly X≤FY. □

Here are some basic properties of time.

Proposition 18.LetF=(S,B)be a finite factored set, and letX,Y,Z∈Part(S)be partitions ofS..IfX≤FYandY≤FZ, thenX≤FZ.IfX≤SY, thenX≤FY.IfX≤FZandY≤FZ, then(X∨SY)≤FZ.Proof.Part 1 is trivial from the definition.Part 2 is trivial by transitivity of the subset relation.

Part 3 follows directly from part 1 of Proposition 13.

Part 4 follows directly from part 2 of Proposition 13. □

Finally, note that we can (circularly) redefine history in terms of time, thus partially justifying the names.

Proposition 19.Given a nonempty finite factored setF=(S,B)and a partitionX∈Part(S),hF(X)={b∈B∣b≤FX}.Proof.Since S is nonempty, part 4 of Proposition 13 says that hF(b)={b} for all b∈B. Thus {b∈B∣b≤FX}={b∈B∣{b}⊆hF(X)}={b∈B∣b∈hF(X)}=hF(X). □In the next post, we'll build up to a definition of

conditional orthogonalityby introducing the notion of subpartitions.