Additive and Multiplicative Subagents

AI ALIGNMENT FORUM
AF

Additive and Multiplicative Subagents — AI Alignment Forum

This is the ninth post in the Cartesian frames sequence. Here, we refine our notion of subagent into additive and multiplicative subagents. As usual, we will give many equivalent definitions.

The additive subagent relation can be thought of as representing the relationship between an agent that has made a commitment, and the same agent before making that commitment. The multiplicative subagent relation can be thought of as representing the relationship between a football player and a football team.

Another way to think about the distinction is that additive subagents have fewer options, while multiplicative subagents have less refined options.

We will introduce these concepts with a definition using sub-sums and sub-tensors.

1. Definitions of Additive and Multiplicative Subagent

1.1. Sub-Sum and Sub-Tensor Definitions

Definition: is an additive subagent of $D$ , written $C ◃_{+} D$ , if there exists a $C^{'}$ and a $D^{'} ≃ D$ with $D^{'} \in C ⊞ C^{'}$ .

Definition: $C$ is a multiplicative subagent of $D$ , written $C ◃_{\times} D$ , if there exists a $C^{'}$ and $D^{'} ≃ D$ with $D^{'} \in C ⊠ C^{'}$ .

These definitions are nice because they motivate the names "additive" and "multiplicative." Another benefit of these definitions is that they draw attention to the Cartesian frames given by C′. This feature is emphasized more in the below (clearly equivalent) definition.

1.2. Brother and Sister Definitions

Definition: $C^{'}$ is called a brother to $C$ in $D$ if $D ≃ D^{'}$ for some $D^{'} \in C ⊞ C^{'}$ . Similarly, $C^{'}$ is called a sister to $C$ in $D$ if $D ≃ D^{'}$ for some $D^{'} \in C ⊠ C^{'}$ .

E.g., one "sister" of a football player will be the entire rest of the football team. One "brother" of a person that precommitted to carry an umbrella will be the counterfactual version of themselves that instead precommitted to not carry an umbrella.

This allows us to trivially restate the above definitions as:

Definition: We say $C ◃_{+} D$ if $C$ has a brother in $D$ and $C ◃_{\times} D$ if $C$ has a sister in $D$ .

Claim: This definition is equivalent to the ones above.

Proof: Trivial. $□$

1.3. Committing and Externalizing Definitions

Next, we will give the committing definition of additive subagent and an externalizing definition of multiplicative subagent. These definitions are often the easiest to work with directly in examples.

We call the following definition the "committing" definition because we are viewing $C$ as the result of $D$ making a commitment (up to biextensional equivalence).

Definition: Given Cartesian frames $C$ and $D$ over $W$ , we say $C ◃_{+} D$ if there exist three sets $X$ , $Y$ , and $Z$ , with $X \subseteq Y$ , and a function $f : Y \times Z \to W$ such that $C ≃ (X, Z, ⋄)$ and $D ≃ (Y, Z, ∙)$ , where $⋄$ and $∙$ are given by $x ⋄ z = f (x, z)$ and $y ∙ z = f (y, z)$ .

Claim: This definition is equivalent to the sub-sum and brother definitions of $◃_{+}$ .

Proof: First, assume that $C$ has a brother in $D$ . Let $C = (A, E, \cdot)$ , and let $D = (B, F, ⋆)$ . Let $C^{'} = (A^{'}, E^{'}, \cdot^{'})$ be brother to $C$ in $D$ . Let $D^{'} = (B^{'}, F^{'}, ⋆^{'})$ be such that $D^{'} ≃ D$ and $D^{'} \in C ⊞ C^{'}$ . Then, if we let $X = A$ , let $Y = B^{'} = A ⊔ A^{'}$ , let $Z = F^{'}$ , and let $f (y, z) = y ⋆^{'} z$ , we get $D ≃ D^{'} = (Y, Z, ∙)$ , where $y ∙ z = f (y, z)$ , and by the definition of sub-sum, $C ≃ (X, Z, ⋄)$ , where $x ⋄ z = f (x, z)$ .

Conversely, let $X$ , $Y$ , and $Z$ be arbitrary sets with $X \subseteq Y$ , and let $f : Y \times Z \to W$ . Let $C ≃ C_{0} = (X, Z, ⋄_{0})$ , and let $D ≃ D^{'} = (Y, Z, ∙)$ , where $x ⋄_{0} z = f (x, z)$ and $y ∙ z = f (y, z)$ . We want to show that $C$ has a brother in $D$ . It suffices to show that $C_{0}$ has a brother in $D$ , since sub-sum is well-defined up to biextensional equivalence. Indeed, we will show that $C_{1} = (Y ∖ X, Z, ⋄_{1})$ is brother to $C_{0}$ in $D$ , where $⋄_{1}$ is given by $x ⋄_{1} z = f (x, z)$ .

Observe that $C_{0} \oplus C_{1} = (Y, Z \times Z, ∙^{'})$ , where $∙^{'}$ is given by

\begin{matrix} y ∙^{'} (z_{0}, z_{1}) & = y ⋄_{0} z_{0} = y ∙ z_{0} \end{matrix}

if $y \in X$ , and is given by

\begin{matrix} y ∙^{'} (z_{0}, z_{1}) & = y ⋄_{1} z_{1} = y ∙ z_{1} \end{matrix}

otherwise. Consider the diagonal subset $S \subseteq Z \times Z$ given by $S = {(z, z) | z \in Z}$ . Observe that the map $z \mapsto (g_{z}, h_{z})$ is a bijection from $Z$ to $S$ . Observe that if we restrict $∙^{'}$ to $Y \times S$ , we get $∙^{''} : Y \times S \to W$ given by $y ∙^{''} (z, z) = y ∙ z$ . Thus $(Y, S, ∙^{''}) ≅ (Y, Z, ∙),$ with the isomorphism coming from the identity on $Y$ , and the bijection between $S$ and $Z$ .

If we further restrict $∙^{''}$ to $X \times S$ or $(Y ∖ X) \times S$ , we get $∙_{0}$ and $∙_{1}$ respectively, given by $x ∙_{0} = x ⋄_{0} z$ and $x ∙_{1} (z, z) = x ⋄_{1} z$ . Thus $(X, S, ∙_{0}) ≅ (X, Z, ⋄_{0})$ and $(Y ∖ X, S, ∙_{1}) ≅ (Y ∖ X, Z, ⋄_{1})$ , with the isomorphisms coming from the identities on $Y$ and $X ∖ Y$ , and the bijection between $S$ and $Z$ .

Thus $(Y, S, ∙^{''}) \in C_{0} ⊞ C_{1}$ , and $(Y, S, ∙^{''}) ≅ D^{'} ≃ D$ , so $C_{1}$ is brother to $C_{0}$ in $D$ , so $C$ has a brother in $D$ . $□$

Next, we have the externalizing definition of multiplicative subagent. Here, we are viewing $C$ as the result of $D$ sending some of its decisions into the environment (up to biextensional equivalence).

Definition: Given Cartesian frames $C$ and $D$ over $W$ , we say $C ◃_{\times} D$ if there exist three sets $X$ , $Y$ , and $Z$ , and a function $f : X \times Y \times Z \to W$ such that $C ≃ (X, Y \times Z, ⋄)$ and $D ≃ (X \times Y, Z, ∙)$ , where $⋄$ and $∙$ are given by $x ⋄ (y, z) = f (x, y, z)$ and $(x, y) ∙ z = f (x, y, z)$ .

Claim: This definition is equivalent to the sub-tensor and sister definitions of $◃_{\times}$ .

Proof: First, assume that $C$ has a sister in $D$ . Let $C = (A, E, \cdot)$ , and let $D = (B, F, ⋆)$ . Let $C^{'} = (A^{'}, E^{'}, \cdot^{'})$ be sister to $C$ in $D$ . Let $D^{'} = (B^{'}, F^{'}, ⋆^{'})$ be such that $D^{'} ≃ D$ and $D^{'} \in C ⊠ C^{'}$ . Then, if we let $X = A$ , let $Y = A^{'}$ , let $Z = F^{'} \subseteq hom (C, {C^{'}}^{*})$ , and let

\begin{matrix} f (x, y, (g, h)) & = x \cdot h (y) = y \cdot^{'} g (x), \end{matrix}

we get $D ≃ D^{'} = (X \times Y, Z, ∙)$ , where $(x, y) ∙ z = f (x, y, z)$ , and by the definition of sub-tensor, $C ≃ (X, Y \times Z, ⋄)$ , where $x ⋄ (y, z) = f (x, y, z)$ .

Conversely, let $X$ , $Y$ , and $Z$ be arbitrary sets, and let $f : X \times Y \times Z \to W$ . Let $C ≃ C_{0} = (X, Y \times Z, ⋄_{0})$ , and let $D ≃ D^{'} = (X \times Y, Z, ∙)$ , where $x ⋄_{0} (y, z) = (x, y) ∙ z = f (x, y, z)$ . We will assume for now that at least one of $X$ and $Y$ is nonempty, as the case where both are empty is degenerate.

We want to show that $C$ has a sister in $D$ . It suffices to show that $C_{0}$ has a sister in $D$ , since sub-tensor is well-defined up to biextensional equivalence. Indeed, we will show that $C_{1} = (Y, X \times Z, ⋄_{1})$ is sister to $C_{0}$ in $D$ , where $⋄_{1}$ is given by $y ⋄_{1} (x, z) = f (x, y, z)$ .

Observe that $C_{0} \otimes C_{1} = (X \times Y, hom (C_{0}, C_{1}^{*}), ∙^{'})$ , where $∙^{'}$ is given by

\begin{matrix} (x, y) ∙^{'} (g, h) & = x ⋄_{0} h (y) = y ⋆_{1} g (x) . \end{matrix}

For every $z \in Z$ , there is a morphism $(g_{z}, h_{z}) : C_{0} \to C_{1}^{*}$ , where $g_{z} : X \to X \times Z$ is given by $g_{z} (x) = (x, z)$ , and $g_{z} : Y \to Y \times Z$ is given by $g_{z} (x) = (x, z)$ . This is clearly a morphism. Consider the subset $S \subseteq hom (C_{0}, C_{1}^{*})$ given by $S = {(g_{z}, h_{z}) | z \in Z}$ . Observe that the map $z \mapsto (g_{z}, h_{z})$ is a bijection from $Z$ to $S$ . (We need that at least one of $X$ and $Y$ is nonempty here for injectivity.)

If we restrict $∙^{'}$ to $(X \times Y) \times S$ , we get $∙^{''} : (X \times Y) \times S \to W$ given by $y ∙^{''} (g_{z}, h_{z}) = y ∙ z$ . Thus, $(X \times Y, S, ∙^{''}) ≅ (X \times Y, Z, ∙)$ , with the isomorphism coming from the identity on $X \times Y$ , and the bijection between $S$ and $Z$ .

To show that $(X \times Y, S, ∙^{''}) \in C_{0} ⊠ C_{1}$ , we need to show that $C_{0} ≃ (X, Y \times S, ∙_{0})$ and $C_{1} ≃ (Y, X \times S, ∙_{1})$ , where $∙_{0}$ and $∙_{1}$ are given by

\begin{matrix} x ∙_{0} (y, (g_{h}, z_{h})) & = y ∙_{1} (x, (g_{h}, z_{h})) = (x, y) ∙^{''} (g_{z}, h_{z}) . \end{matrix}

Indeed, $x ∙_{0} (y, (g_{h}, z_{h})) = x ⋄_{0} (y, z)$ and $y ∙_{1} (x, (g_{h}, z_{h})) = y ⋄_{1} (x, z)$ , so $(X, Y \times S, ∙_{0}) ≅ (X, Y \times Z, ⋄_{0}) = C_{0}$ and $(Y, X \times S, ∙_{1}) ≅ (Y, X \times Z, ⋄_{1}) = C_{1}$ , with the isomorphisms coming from the identities on $X$ and $Y$ , and the bijection between $S$ and $Z$ .

Thus $(X \times Y, S, ∙^{''}) \in C_{0} ⊞ C_{1}$ , and $(Y, S, ∙^{''}) ≅ D^{'} ≃ D$ , so $C_{1}$ is sister to $C_{0}$ in $D$ , so $C$ has a sister in $D$ .

Finally, in the case where $X$ and $Y$ are both empty, $C ≅ null$ , and either $D ≃ null$ or $D ≃ 0$ , depending on whether $Z$ is empty. It is easy to verify that $null ⊠ null = {0, null}$ , since $null \otimes null ≅ 0$ , taking the two subsets of the singleton environment in $0$ yields $0$ and $null$ as candidate sub-tensors, and both are valid sub-tensors, since either way, the conditions reduce to $null ≃ null$ . $□$

Next, we have some definitions that more directly relate to our original definitions of subagent.

1.4. Currying Definitions

Definition: We say $C ◃_{+} D$ if there exists a Cartesian frame $M$ over $Agent (D)$ with $| Env (M) | = 1$ , such that $C ≃ D^{\circ} (M)$ .

Claim: This definition is equivalent to all of the above definitions of $◃_{+}$ .

Proof: We show equivalence to the committing definition.

First, assume that there exist three sets $X$ , $Y$ , and $Z$ , with $X \subseteq Y$ , and a function $p : Y \times Z \to W$ such that $C ≃ (X, Z, ⋄)$ and $D ≃ (Y, Z, ∙)$ , where $⋄$ and $∙$ are given by $x ⋄ z = p (x, z)$ and $y ∙ z = p (y, z)$ .

Let $D = (B, F, ⋆)$ , and let $(g_{0}, h_{0}) : D \to (Y, Z, ∙)$ and $(g_{1}, h_{1}) : (Y, Z, ∙) \to D$ compose to something homotopic to the identity in both orders.

We define $M$ , a Cartesian frame over $B$ , by $M = (X, {e}, \cdot)$ , where $\cdot$ is given $x \cdot e = g_{1} (x) .$ Observe that $D^{\circ} (M) = (X, {e} \times F, ⋆^{'})$ , where $⋆^{'}$ is given by

\begin{matrix} x ⋆^{'} (e, f) & = (x \cdot e) ⋆ f = g_{1} (x) ⋆ f = x ∙ h_{1} (f) . \end{matrix}

To show that $(X, Z, ⋄) ≃ D^{\circ} (M)$ , we construct morphisms $(g_{2}, h_{2}) : (X, Z, ⋄) \to D^{\circ} (M)$ and $(g_{3}, h_{3}) : D^{\circ} (M) \to (X, Z, ⋄)$ that compose to something homotopic to the identity in both orders. Let $g_{2}$ and $g_{3}$ both be the identity on $X$ . Let $h_{2} : {e} \times F \to Z$ be given by $h_{2} (e, f) = h_{1} (f)$ , and let $h_{3} : Z \to {e} \times F$ be given by $h_{3} (z) = (e, h_{0} (z))$ .

We know $(g_{2}, h_{2})$ is a morphism, since for all $x \in X$ and $(e, f) \in {e} \times F$ , we have

\begin{matrix} g_{2} (x) ⋆^{'} (e, f) & = x ⋆^{'} (e, f) = x ∙ h_{1} (f) = x ⋄ h_{1} (f) = x ⋄ (h_{2} (e, f)) . \end{matrix}

We also have that $(g_{3}, h_{3})$ is a morphism, since for all $x \in X$ and $z \in Z$ , we have

\begin{matrix} g_{3} (x) ⋄ z & = x ⋄ z = x ∙ z = x ∙ h_{1} (h_{0} (z)) = x ⋆^{'} (e, h_{0} (z)) = x ⋆^{'} h_{3} (z) . \end{matrix}

Observe that $(g_{2}, h_{2})$ and $(g_{3}, h_{3})$ clearly compose to something homotopic to the identity in both orders, since $g_{2} \circ g_{3}$ and $g_{3} \circ g_{2}$ are the identity on $X$ .

Thus, $C ≃ (X, Z, ⋄) ≃ D^{\circ} (M)$ , and $| Env (M) | = 1$ .

Conversely, assume $C ≃ D^{\circ} (M)$ , with $| Env (M) | = 1$ . We define $Y = Agent (D)$ and $Z = Env (D)$ . We define $f : Y \times Z \to W$ by $f (y, z) = y ∙ z$ , where $∙ = Eval (D)$ .

Let $X \subseteq Y$ be given by $X = Image (M)$ . Since $| Env (M) | = 1$ , we have $M ≃ ⊥_{X}$ . Thus, $C ≃ D^{\circ} (M) ≃ D^{\circ} (⊥_{X})$ . Unpacking the definition of $D^{\circ} (⊥_{X})$ , we get $D^{\circ} (⊥_{X}) = (X, {e} \times Z, \cdot)$ , where $\cdot$ is given by $x \cdot (e, z) = f (x, z)$ , which is isomorphic to $(X, Z, ⋄)$ , where $⋄$ is given by $x ⋄ z = f (x, z)$ . Thus $C ≃ (X, Z, ⋄)$ and $D = (Y, Z, ∙)$ , as in the committing definition. $□$

Definition: We say $C ◃_{\times} D$ if there exists a Cartesian frame $M$ over $Agent (D)$ with $Image (M) = Agent (D)$ , such that $C ≃ D^{\circ} (M)$ .

Claim: This definition is equivalent to all of the above definitions of $◃_{\times}$ .

Proof: We show equivalence to the externalizing definition.

First, assume there exist three sets $X$ , $Y$ , and $Z$ , and a function $p : X \times Y \times Z \to W$ such that $C ≃ (X, Y \times Z, ⋄)$ and $D ≃ (X \times Y, Z, ∙)$ , where $⋄$ and $∙$ are given by $x ⋄ (y, z) = (x, y) ∙ z = p (x, y, z)$ .

Let $D = (B, F, ⋆)$ , and let $(g_{0}, h_{0}) : D \to (X \times Y, Z, ∙)$ and $(g_{1}, h_{1}) : (X \times Y, Z, ∙) \to D$ compose to something homotopic to the identity in both orders.

We define $B^{'} = B ⊔ {a}$ , and we define $M$ , a Cartesian frame over $B$ , by $M = (X, Y \times B^{'}, \cdot)$ , where $\cdot$ is given by $x \cdot (y, b) = b$ if $b \in B$ and $g_{0} (b) = (x, y)$ , and $x \cdot (y, b) = g_{1} (x, y)$ otherwise. Clearly, $Image (M) = B$ , since for any $b \in B$ , if we let $(x, y) = g_{0} (b)$ , we have $x \cdot (y, b) = b$ .

Observe that for all $x \in X$ , $y \in Y$ , $b \in B^{'}$ and $f \in F$ , if $b \in B$ and $g_{0} (b) = (x, y)$ , then

\begin{matrix} (x \cdot (y, b)) ⋆ f & = b ⋆ f = g_{1} (g_{0} (b)) ⋆ f = g_{1} (x, y) ⋆ f, \end{matrix}

and on the other hand, if $b = a$ or $g_{0} (b) \neq (x, y)$ , we also have $(x \cdot (y, b)) ⋆ f = g_{1} (x, y) ⋆ f$ .

Thus, we have that $D^{\circ} (M) = (X, Y \times B^{'} \times F, ⋆^{'})$ , where $⋆^{'}$ is given by

\begin{matrix} x ⋆^{'} (y, b, f) & = (x \cdot (y, b)) ⋆ f = g_{1} (x, y) ⋆ f = (x, y) ∙ h_{1} (f) . \end{matrix}

To show that $(X, Y \times Z, ⋄) ≃ D^{\circ} (M)$ , we construct morphisms $(g_{2}, h_{2}) : (X, Y \times Z, ⋄) \to D^{\circ} (M)$ and $(g_{3}, h_{3}) : D^{\circ} (M) \to (X, Y \times Z, ⋄)$ that compose to something homotopic to the identity in both orders. Let $g_{2}$ and $g_{3}$ both be the identity on $X$ . Let $h_{2} : Y \times B^{'} \times F \to Y \times Z$ be given by $h_{2} (y, b, f) = (y, h_{1} (f))$ , and let $h_{3} : Y \times Z \to Y \times B^{'} \times F$ be given by $h_{3} (y, z) = (y, a, h_{0} (z))$ .

We know $(g_{2}, h_{2})$ is a morphism, since for all $x \in X$ and $(y, b, f) \in Y \times B^{'} \times F$ ,

\begin{matrix} g_{2} (x) ⋆^{'} (y, b, f) & = x ⋆^{'} (y, b, f) = (x, y) ∙ h_{1} (f) = p (x, y, h_{1} (f)) = x ⋄ (y, h_{1} (f)) = x ⋄ (h_{2} (y, b, f)) . \end{matrix}

We also have that $(g_{3}, h_{3})$ is a morphism, since for all $x \in X$ and $(y, z) \in Y \times Z$ , we have

\begin{matrix} g_{3} (x) ⋄ (y, z) & = x ⋄ z = x ⋄ (y, z) = p (x, y, z) = (x, y) ∙ z = (x, y) ∙ h_{1} (h_{0} (z)) = (x, y) ⋆^{'} (y, a, h_{0} (z)) = x ⋆^{'} h_{3} (y, z) . \end{matrix}

Observe that $(g_{2}, h_{2})$ and $(g_{3}, h_{3})$ clearly compose to something homotopic to the identity in both orders, since $g_{2} \circ g_{3}$ and $g_{3} \circ g_{2}$ are the identity on $X$ .

Thus, $C ≃ (X, Z, ⋄) ≃ D^{\circ} (M)$ , where $Image (M) = Agent (D)$ .

Conversely, assume $C ≃ D^{\circ} (M)$ , with $Image (M) = Agent (D)$ . Let $X = Agent (M)$ , let $Y = Env (M)$ , and let $Z = Env (D)$ . Let $f : X \times Y \times Z \to W$ be given by $f (x, y, z) = (x \cdot y) ⋆ z$ , where $\cdot = Eval (M)$ and $⋆ = Eval (D)$ .

Thus $C ≃ D^{\circ} (M) ≅ (X, Y \times Z, ⋄)$ , where $⋄$ is given by $x ⋄ (y, z) = (x \cdot y) ⋆ z = f (x, y, z)$ . All that remains to show is that $D ≃ (X \times Y, Z, ∙)$ , where $(x, y) ∙ z = f (x, y, z)$ . Let $D = (B, Z, ⋆)$ .

We construct morphisms $(g_{0}, h_{0}) : D \to (X \times Y, Z, ∙)$ and $(g_{1}, h_{1}) : D \to (X \times Y, Z, ∙)$ that compose to something homotopic to the identity in both orders. Let $h_{0}$ and $h_{1}$ be the identity on $Z$ . Let $g_{1} : X \times Y \to B$ be given by $g_{1} (x, y) = x \cdot y$ . Since $g_{1}$ is surjective, it has a right inverse. Let $g_{0} : B \to X \times Y$ be any choice of right inverse of $g_{1}$ , so $g_{1} (g_{0} (b)) = b$ for all $b \in B$ .

We know $(g_{1}, h_{1})$ is a morphism, since for all $(x, y) \in X \times Y$ and $z \in Z$ ,

\begin{matrix} g_{1} (x, y) ⋆ z & = (x \cdot y) ⋆ z = f (x, y, z) = (x, y) ∙ z = (x, y) ∙ h_{1} (z) . \end{matrix}

To see that $(g_{0}, h_{0})$ is a morphism, given $b \in B$ and $z \in Z$ , let $(x, y) = g_{0} (b)$ , and observe

\begin{matrix} g_{0} (b) ∙ z & = (x, y) ∙ z = f (x, y, z) = (x \cdot y) ⋆ z = g_{1} (x, y) ⋆ z = g_{1} (g_{0} (b)) ⋆ z = b ⋆ h_{0} (z) . \end{matrix}

$(g_{0}, h_{0})$ and $(g_{1}, h_{1})$ clearly compose to something homotopic to the identity in both orders, since $h_{0} \circ h_{1}$ and $h_{1} \circ h_{0}$ are the identity on $Z$ . Thus $D ≃ (X \times Y, Z, ∙)$ , completing the proof. $□$

Consider two Cartesian frames $C$ and $D$ , and let $M$ be a frame whose possible agents are $Agent (C)$ and whose possible worlds are $Agent (D)$ . When $C$ is a subagent of $D$ , (up to biextensional equivalence) there exists a function from $Agent (C)$ , paired with $Env (M)$ , to $Agent (D)$ .

Just as we did in "Subagents of Cartesian Frames" §1.2 (Currying Definition), we can think of this function as a (possibly) nondeterministic function from $Agent (C)$ to $Agent (D)$ , where $Env (M)$ represents the nondeterminism. In the case of additive subagents, $Env (M)$ is a singleton, meaning that the function from $Agent (C)$ to $Agent (D)$ is actually deterministic. In the case of multiplicative subagents, the (possibly) nondeterministic function is surjective.

Recall that in "Sub-Sums and Sub-Tensors" §3.3 (Sub-Sums and Sub-Tensors Are Superagents), we constructed a frame with a singleton environment to prove that sub-sums are superagents, and we constructed a frame with a surjective evaluation function to prove that sub-tensors are superagents. The currying definitions of $◃_{+}$ and $◃_{\times}$ show why this is the case.

1.5. Categorical Definitions

We also have definitions based on the categorical definition of subagent. The categorical definition of additive subagent is almost just swapping the quantifiers from our original categorical definition of subagent. However, we will also have to weaken the definition slightly in order to only require the morphisms to be homotopic.

Definition: We say $C ◃_{+} D$ if there exists a single morphism $ϕ_{0} : C \to D$ such that for every morphism $ϕ : C \to ⊥$ there exists a morphism $ϕ_{1} : D \to ⊥$ such that $ϕ$ is homotopic to $ϕ_{1} \circ ϕ_{0}$ .

Claim: This definition is equivalent to all the above definitions of $◃_{+}$ .

Proof: We show equivalence to the committing definition.

First, let $C = (A, E, \cdot)$ and $D = (B, F, ∙)$ be Cartesian frames over $W$ , and let $(g_{0}, h_{0}) : C \to D$ be such that for all $(g, h) : C \to ⊥$ , there exists a $(g^{'}, h^{'}) : D \to ⊥$ such that $(g, h)$ is homotopic to $(g^{'}, h^{'}) \circ (g_{0}, h_{0})$ . Let $⊥ = (W, {i}, ⋆)$ .

Let $Y = B$ , let $Z = F$ , and let $X = {g_{0} (a) | a \in A}$ . Let $f : Y \times Z \to W$ be given by $f (y, z) = y ∙ z$ . We already have $D = (Y, Z, ∙)$ , and our goal is to show that $C ≃ (X, Z, ⋄),$ where $⋄$ is given by $x ⋄ z = f (x, z)$ .

We construct $(g_{1}, h_{1}) : C \to (X, Z, ⋄)$ and $(g_{2}, h_{2}) : (X, Z, ⋄) \to C$ that compose to something homotopic to the identity in both orders.

We define $g_{1} : A \to X$ by $g_{1} (a) = g_{0} (a)$ . $g_{1}$ is surjective, and so has a right inverse. We let $g_{2} : X \to A$ be any right inverse to $g_{1}$ , so $g_{1} (g_{2} (x)) = x$ for all $x \in X$ . We let $h_{1} : Z \to E$ be given by $h_{1} (z) = h_{0} (z)$ .

Defining $h_{2} : E \to Z$ will be a bit more complicated. Given an $e \in E$ , let $(g_{e}, h_{e})$ be the morphism from $C$ to $⊥$ , given by $h_{e} (i) = e$ and $g_{e} (a) = a \cdot e$ . Let $(g_{e}^{'}, h_{e}^{'}) : D \to ⊥$ be such that $(g_{e}, h_{e})$ is homotopic to $(g_{e}^{'}, h_{e}^{'}) \circ (g_{0}, h_{0})$ . We define $h_{2}$ by $h_{2} (e) = h_{e}^{'} (i)$ .

We trivially have that $(g_{1}, h_{1})$ is a morphism, since for all $a \in A$ and $z \in Z$ ,

\begin{matrix} g_{1} (a) ⋄ z & = g_{0} (a) ∙ z = a \cdot h_{0} (z) = a \cdot h_{1} (z) . \end{matrix}

To see that $(g_{2}, h_{2})$ is a morphism, consider $x \in X$ and $e \in E$ , and define $(g_{e}, h_{e})$ and $(g_{e}^{'}, h_{e}^{'})$ as above. Then,

\begin{matrix} x ⋄ h_{2} (e) & = g_{1} (g_{2} (x)) ⋄ h_{e}^{'} (i) = g_{e}^{'} (g_{0} (g_{2} (x))) ⋆ i = g_{2} (x) \cdot h_{e} (i) = g_{2} (x) \cdot e . \end{matrix}

We trivially have that $(g_{1}, h_{1}) \circ (g_{2}, h_{2})$ is homotopic to the identity, since $g_{1} \circ g_{2}$ is the identity on $X$ . To see that $(g_{2}, h_{2}) \circ (g_{1}, h_{1})$ is homotopic to the identity on $C$ , observe that for all $a \in A$ and $e \in E$ , defining $(g_{e}, h_{e})$ and $(g_{e}^{'}, h_{e}^{'})$ as above,

\begin{matrix} g_{2} (g_{1} (a)) \cdot e & = g_{1} (a) ⋄ h_{2} (e) = g_{0} (a) ⋄ h_{e}^{'} (i) = g_{e}^{'} (g_{0} (a)) ⋆ i = a ⋆ h_{e} (i) = a \cdot e . \end{matrix}

Thus $C ≃ (X, Z, ⋄)$ , and $C ◃_{+} D$ according to the committing definition.

Conversely, let $X$ , $Y$ , and $Z$ be arbitrary sets with $X \subseteq Y$ , let $f : Y \times Z \to W$ , and let $C ≃ (X, Z, ⋄)$ and $D ≃ (Y, Z, ∙)$ , where $⋄$ and $∙$ are given by $x ⋄ z = f (x, z)$ and $y ∙ z = f (y, z)$ .

Let $(g_{1}, h_{1}) : C \to (X, Z, ⋄)$ and $(g_{2}, h_{2}) : (X, Z, ⋄) \to C$ compose to something homotopic to the identity in both orders, and let $(g_{3}, h_{3}) : D \to (Y, Z, ∙)$ and $(g_{4}, h_{4}) : (Y, Z, ∙) \to D$ compose to something homotopic to the identity in both orders. Let $(g_{0}, h_{0}) : (X, Z, ⋄) \to (Y, Z, ∙)$ be given by $g_{0}$ is the embedding of $X$ in $Y$ and $h_{0}$ is the identity on $Z$ . $(g_{0}, h_{0})$ is clearly a morphism.

We let $ϕ : C \to D = (g_{4}, h_{4}) \circ (g_{0}, h_{0}) \circ (g_{1}, h_{1})$ .

Given a $(g, h) : C \to ⊥$ , our goal is to construct a $(g^{'}, h^{'}) : D \to ⊥$ such that $(g, h)$ is homotopic to $(g^{'}, h^{'}) \circ ϕ$ .

Let $⊥ = (W, {i}, ⋆)$ , let $C = (A, E, \cdot_{0})$ , and let $D = (B, F, \cdot_{1})$ . Let $h^{'} : {i} \to F$ be given by $h^{'} = h_{3} \circ h_{2} \circ h$ . Let $g^{'} : B \to W$ be given by $g^{'} (b) = b \cdot_{1} h^{'} (i)$ . This is clearly a morphism, since for all $b \in B$ and $i \in {i}$ ,

\begin{matrix} g^{'} (b) ⋆ i & = g^{'} (b) = b \cdot h^{'} (i) . \end{matrix}

To see that $(g, h)$ is homotopic to $(g^{'}, h^{'}) \circ (g_{4}, h_{4}) \circ (g_{0}, h_{0}) \circ (g_{1}, h_{1})$ , we just need to check that $(g, h_{1} \circ h_{0} \circ h_{4} \circ h^{'}) : C \to ⊥$ is a morphism. Or, equivalently, that $(g, h_{1} \circ h_{4} \circ h_{3} \circ h_{2} \circ h) : C \to ⊥$ , since $h_{0}$ is the identity, and $h^{'} = h_{3} \circ h_{2} \circ h$ .

Indeed, for all $a \in A$ and $i \in {i}$ ,

\begin{matrix} g (a) ⋆ i & = a \cdot_{0} h (a) = a \cdot_{0} h_{1} (h_{2} (h (a))) = g_{1} (a) ⋄ h_{2} (h (a)) = g_{1} (a) ∙ h_{2} (h (a)) = g_{1} (a) ∙ h_{4} (h_{3} (h_{2} (h (a)))) = g_{1} (a) ⋄ h_{4} (h_{3} (h_{2} (h (a)))) = a \cdot_{0} h_{1} (h_{4} (h_{3} (h_{2} (h (a))))) . \end{matrix}

Thus $(g, h)$ is homotopic to $(g^{'}, h^{'}) \circ ϕ$ , completing the proof. $□$

Definition: We say $C ◃_{\times} D$ if for every morphism $ϕ : C \to ⊥$ , there exist morphisms $ϕ_{0} : C \to D$ and $ϕ_{1} : D \to ⊥$ such that $ϕ = ϕ_{1} \circ ϕ_{0}$ , and for every morphism $ψ : 1 \to D$ , there exist morphisms $ψ_{0} : 1 \to C$ and $ψ_{1} : C \to D$ such that $ψ = ψ_{1} \circ ψ_{0}$ .

Before showing that this definition is equivalent to all of the above definitions, we will give one final definition of multiplicative subagent.

1.6. Sub-Environment Definition

First, we define the concept of a sub-environment, which is dual to the concept of a sub-agent.

Definition: We say $C$ is a sub-environment of $D$ , written $C ◃^{*} D$ , if $D^{*} ◃ C^{*}$ .

We can similarly define additive and multiplicative sub-environments.

Definition: We say $C$ is an additive sub-environment of $D$ , written $C ◃_{+}^{*} D$ , if $D^{*} ◃_{+} C^{*}$ . We say $C$ is an multiplicative sub-environment of $D$ , written $C ◃_{\times}^{*} D$ , if $D^{*} ◃_{\times} C^{*}$ .

This definition of a multiplicative sub-environment is redundant, because the set of frames with multiplicative sub-agents is exactly the set of frames with multiplicative sub-environments, as shown below:

Claim: $C ◃_{\times} D$ if and only if $C ◃_{\times}^{*} D$ .

Proof: We prove this using the externalizing definition of $◃_{\times}$ .

If $C ◃_{\times} D$ , then for some $X$ , $Y$ , $Z$ , and $f : X \times Y \times Z \to W$ , we have $C ≃ (X, Y \times Z, ⋄)$ and $D ≃ (X \times Y, Z, ∙)$ , where $⋄$ and $∙$ are given by $x ⋄ (y, z) = f (x, y, z)$ and $(x, y) ∙ z = f (x, y, z)$ .

Observe that $D^{*} ≃ (Z, Y \times X, \cdot)$ and $C^{*} ≃ (Z \times Y, X, ⋆)$ , where $\cdot$ and $⋆$ are given by $z \cdot (y, x) = f (x, y, z)$ and $(z, y) ⋆ x = f (x, y, z)$ . Taking $X^{'} = Z$ , $Y^{'} = Y$ , $Z^{'} = X$ , and $f^{'} (x, y, z) = f (z, y, x)$ , this is exactly the externalizing definition of $D^{*} ◃_{\times} C^{*}$ , so $C ◃_{\times}^{*} D$ .

Conversely, if $C ◃_{\times}^{*} D$ , then $D^{*} ◃_{\times} C^{*}$ , so $C ≅ {C^{*}}^{*} ◃_{\times} {D^{*}}^{*} ≅ D$ . $□$

We now give the sub-environment definition of multiplicative subagent:

Definition: We say $C ◃_{\times} D$ if $C ◃ D$ and $C ◃^{*} D$ . Equivalently, we say $C ◃_{\times} D$ if $C ◃ D$ and $D^{*} ◃ C^{*}$ .

Claim: This definition is equivalent to the categorical definition of $◃_{\times}$ .

Proof: The condition that for every morphism $ϕ : C \to ⊥$ , there exist morphisms $ϕ_{0} : C \to D$ and $ϕ_{1} : D \to ⊥$ such that $ϕ = ϕ_{1} \circ ϕ_{0}$ , is exactly the categorical definition of $C ◃ D$ .

The condition that for every morphism $ψ : 1 \to D$ , there exist morphisms $ψ_{0} : 1 \to C$ and $ψ_{1} : C \to D$ such that $ψ = ψ_{1} \circ ψ_{0}$ , is equivalent to saying that for every morphism $ψ^{*} : D^{*} \to ⊥$ , there exist morphisms $ψ_{0}^{*} : C^{*} \to ⊥$ and $ψ_{1}^{*} : D^{*} \to C^{*}$ such that $ψ^{*} = ψ_{1}^{*} \circ ψ_{0}^{*}$ . This is the categorical definition of $D^{*} ◃ C^{*}$ . $□$

Claim: The categorical and sub-environment definitions of $◃_{\times}$ are equivalent to the other four definitions of multiplicative subagent above: sub-tensor, sister, externalizing, and currying.

Proof: We show equivalence between the externalizing and sub-environment definitions. First, assume that $C = (A, E, \cdot)$ and $D = (B, F, ⋆)$ are Cartesian frames over $W$ with $C ◃ D$ and $C ◃^{*} D$ .

We define $X = A$ , $Z = F$ , and $Y = hom (C, D)$ . We define $p : X \times Y \times Z \to W$ by

\begin{matrix} p (a, (g, h), f) & = g (a) ⋆ f = a \cdot h (f) . \end{matrix}

We want to show that $C ≃ (X, Y \times Z, ⋄)$ , and $D ≃ (X \times Y, Z, ∙)$ , where $⋄$ and $∙$ are given by $x ⋄ (y, z) = (x, y) ∙ z = p (x, y, z)$ .

To see $C ≃ (X, Y \times Z, ⋄)$ , we construct $(g_{0}, h_{0}) : C \to (X, Y \times Z, ⋄)$ and $(g_{1}, h_{1}) : (X, Y \times Z, ⋄) \to C$ that compose to something homotopic to the identity in both orders. Let $g_{0}$ and $g_{1}$ be the identity on $X$ and let $h_{0} : Y \times Z \to E$ be defined by $h_{0} ((g, h), f) = h (f)$ . By the covering definition of subagent, $h_{0}$ is surjective, and so has a right inverse. Let $h_{1} : E \to Y \times Z$ be any right inverse of $h_{0}$ , so $h_{0} (h_{1} (e)) = e$ for all $e \in E$ .

We know $(g_{0}, h_{0})$ is a morphism, because for all $a \in A$ and $((g, h), f) \in Y \times Z$ ,

\begin{matrix} g_{0} (a) ⋄ ((g, h), f) & = a ⋄ ((g, h), f) = p (a, (g, h), f) = a \cdot h (f) = a \cdot h_{0} ((g, h), f) . \end{matrix}

We know $(g_{1}, h_{1})$ is a morphism, since for $x \in X$ and $e \in E$ , if $((g, h), f) = h_{1} (e)$ ,

\begin{matrix} g_{1} (x) \cdot e & = x \cdot h_{0} ((g, h), f) = x \cdot h (f) = p (x, (g, h), f) = x ⋄ ((g, h), f) = x ⋄ h_{1} (e) . \end{matrix}

$(g_{0}, h_{0})$ and $(g_{1}, h_{1})$ clearly compose to something homotopic to the identity in both orders, since $g_{0} \circ g_{1}$ and $g_{1} \circ g_{0}$ are the identity on $X$ .

To see $D ≃ (X \times Y, Z, ∙)$ , we construct $(g_{2}, h_{2}) : D \to (X \times Y, Z, ∙)$ and $(g_{3}, h_{3}) : (X \times Y, Z, ∙) \to D$ that compose to something homotopic to the identity in both orders. Let $h_{2}$ and $h_{3}$ be the identity on $Z$ and let $g_{3} : X \times Y \to B$ be defined by $g_{3} (a, (g, h)) = g (a)$ . By the covering definition of subagent and the fact that $D^{*} ◃ C^{*}$ , $g_{3}$ is surjective, and so has a right inverse. Let $g_{2} : B \to X \times Y$ be any right inverse of $g_{3}$ , so $g_{3} (g_{2} (b)) = b$ for all $b \in B$ .

We know $(g_{3}, h_{3})$ is a morphism, because for all $f \in F$ and $(a, (g, h)) \in X \times Y$ ,

\begin{matrix} g_{3} (a, (g, h)) ⋆ f & = g (a) ⋆ f = p (a, (g, h), f) = (a, (g, h)) ∙ f = (a, (g, h)) ∙ h_{3} (f) . \end{matrix}

We know $(g_{2}, h_{2})$ is a morphism, since for $z \in Z$ and $b \in B$ , if $(a, (g, h)) = g_{2} (b)$ ,

\begin{matrix} g_{2} (b) ∙ z & = (a, (g, h)) ∙ z = p (a, (g, h), z) = g (a) ⋆ z = g_{3} (a, (g, h)) ⋆ z = b ⋆ h_{2} (z) . \end{matrix}

Observe that $(g_{2}, h_{2})$ and $(g_{3}, h_{3})$ clearly compose to something homotopic to the identity in both orders, since $h_{2} \circ h_{3}$ and $h_{3} \circ h_{2}$ are the identity on $Z$ .

Thus, $C ≃ (X, Y \times Z, ⋄)$ , and $D ≃ (X \times Y, Z, ∙)$ .

Conversely, if $C ◃_{\times} D$ according to the externalizing definition, then we also have $D^{*} ◃_{\times} C^{*}$ . However, by the currying definitions of multiplicative subagent and of subagent, multiplicative subagent is stronger than subagent, so $C ◃ D$ and $D^{*} ◃ C^{*}$ . $□$

2. Basic Properties

Now that we have enough definitions of additive and multiplicative subagent, we can cover some basic properties.

First: Additive and multiplicative subagents are subagents.

Claim: If $C ◃_{+} D$ , then $C ◃ D$ . Similarly, if $C ◃_{\times} D$ , then $C ◃ D$ .

Proof: Clear from the currying definitions. $□$

Additive and multiplicative subagent are also well-defined up to biextensional equivalence.

Claim: If $C ◃_{+} D$ , $C^{'} ≃ C$ , and $D^{'} ≃ D$ , then $C^{'} ◃_{+} D^{'}$ . Similarly, if $C ◃_{\times} D$ , $C^{'} ≃ C$ , and $D^{'} ≃ D$ , then $C^{'} ◃_{\times} D^{'}$ .

Proof: Clear from the committing and externalizing definitions. $□$

Claim: Both $◃_{+}$ and $◃_{\times}$ are reflexive and transitive.

Proof: Reflexivity is clear from the categorical definitions. Transitivity of $◃_{\times}$ is clear from the transitivity of $◃$ and the sub-environment definition. Transitivity of $◃_{+}$ can be seen using the categorical definition, by composing the morphisms and using the fact that being homotopic is preserved by composition. $□$

3. Decomposition Theorems

We have two decomposition theorems involving additive and multiplicative subagents.

3.1. First Decomposition Theorem

Theorem: $C_{0} ◃ C_{1}$ if and only if there exists a $C_{2}$ such that $C_{0} ◃_{\times} C_{2} ◃_{+} C_{1}$ .

Proof: We will use the currying definitions of subagent and multiplicative subagent, and the committing definition of additive subagent. Let $C_{0} = (A_{0}, E_{0}, \cdot_{0})$ and $C_{1} = (A_{1}, E_{1}, \cdot_{1})$ . If $C_{0} ◃ C_{1}$ , there exists some Cartesian frame $D$ over $A_{1}$ such that $C_{0} = C_{1}^{\circ} (D)$ .

Let $C_{2} = (Image (D), E_{1}, \cdot_{2})$ , where $\cdot_{2}$ is given by $a \cdot_{2} e = a \cdot_{1} e$ . $C_{2}$ is created by deleting some possible agents from $C_{1}$ , so by the committing definition of additive subagent $C_{2} ◃_{+} C_{1}$ .

Also, if we let $D^{'}$ be the Cartesian frame over $Image (D)$ which is identical to $D$ , but on a restricted codomain, then we clearly have that $C_{1}^{\circ} (D) ≅ C_{2}^{\circ} (D^{'})$ . Thus $C_{0} ≃ C_{2}^{\circ} (D^{'})$ and $Image (D^{'}) = Agent (C_{2})$ , so $C_{0} ◃_{\times} C_{2}$ .

The converse is trivial, since subagent is weaker than additive and multiplicative subagent and is transitive. $□$

Imagine that that a group of kids, Alice, Bob, Carol, etc., is deciding whether to start a game of baseball or football against another group. If they choose baseball, they form a team represented by the frame $C_{B}$ , while if they choose football, they form a team represented by the frame $C_{F}$ . We can model this by imagining that $C_{0}$ is the group's initial state, and $C_{B}$ and $C_{F}$ are precommitment-style subagents of $C_{0}$ .

Suppose the group chooses football. $C_{F}$ 's choices are a function of Alice-the-football-player's choices, Bob-the-football-player's choices, etc. (Importantly, Alice here has different options and a different environment than if the original group had chosen baseball. So we will need to represent Alice-the-football-player, $C_{A F}$ , with a different frame than Alice-the-baseball-player, $C_{A B}$ ; and likewise for Bob and the other team members.)

It is easy to see in this case that the relationship between Alice-the-football-player's frame ( $C_{A F}$ ) and the entire group's initial frame ( $C_{0}$ ) can be decomposed into the additive relationship between $C_{0}$ and $C_{F}$ and the multiplicative relationship between $C_{F}$ and $C_{A F}$ , in that order.

The first decomposition theorem tells us that every subagent relation, even ones that don't seem to involve a combination of "making a commitment" and "being a team," can be decomposed into a combination of those two things. I've provided an example above where this factorization feels natural, but other cases may be less natural.

Using the framing from our discussion of the currying definitions: this decomposition is always possible because we can always decompose a possibly-nondeterministic function $f$ into (1) a possibly-nondeterministic surjective function onto $f$ 's image, and (2) a deterministic function embedding $f$ 's image in $f$ 's codomain.

3.2. Second Decomposition Theorem

Theorem: There exists a morphism from $C_{0}$ to $C_{1}$ if and only if there exists a $C_{2}$ such that $C_{0} ◃_{+}^{*} C_{2} ◃_{+} C_{1}$ .

Proof: First, let $C_{0} = (A, E, \cdot)$ , let $C_{1} = (B, F, ⋆)$ , and let $(g, h) : C_{0} \to C_{1}$ . We let $C_{2} = (A, F, ⋄)$ , where $a ⋄ f = g (a) ⋆ f = a \cdot h (f)$ .

First, we show $C_{2} ◃_{+} C_{1}$ , To do this, we let $B^{'} \subseteq B$ be the image of $g$ , and let $C_{2}^{'} = (B^{'}, F, ⋆^{'})$ , where $⋆^{'}$ is given by $b ⋆^{'} f = b ⋆ f$ . By the committing definition of additive subagent, it suffices to show that $C_{2}^{'} ≃ C_{2}$ .

We define $(g_{0}, h_{0}) : C_{2} \to C_{2}^{'}$ and $(g_{1}, h_{1}) : C_{2}^{'} \to C_{2}$ as follows. We let $h_{0}$ and $h_{1}$ be the identity on $F$ . We let $g_{0} : A \to B^{'}$ be given by $g_{0} (a) = g (a)$ . Observe that $g_{0}$ is surjective, and thus has a right inverse. Let $g_{1}$ be any right inverse to $g_{0}$ , so $g_{0} (g_{1} (b)) = b$ for all $b \in B^{'}$ .

We know $(g_{0}, h_{0})$ is a morphism, since for all $a \in A$ and $f \in F$ , we have

\begin{matrix} g_{0} (a) ⋆^{'} f & = g (a) ⋆ f = a ⋄ f = a ⋄ h_{0} (f) . \end{matrix}

Similarly, we know $(g_{1}, h_{1})$ is a morphism, since for all $b \in B^{'}$ and $f \in F$ , we have

\begin{matrix} g_{1} (b) ⋄ f & = g_{1} (b) ⋄ h_{0} (f) = g_{0} (g_{1} (b)) ⋆^{'} f = b ⋆^{'} f = b ⋆^{'} h_{1} (f) . \end{matrix}

Clearly, $(g_{0}, h_{0}) \circ (g_{1}, h_{1})$ and $(g_{1}, h_{1}) \circ (g_{0}, h_{0})$ are homotopic to the identity, since $h_{0} \circ h_{1}$ and $h_{1} \circ h_{0}$ are the identity on $F$ . Thus, $C_{2}^{'} ≃ C_{2}$ .

The fact that $C_{0} ◃_{+}^{*} C_{2}$ , or equivalently $C_{2}^{*} ◃_{+} C_{0}^{*}$ , is symmetric, since the relationship between $C_{2}^{*}$ and $C_{0}^{*}$ is the same as the relationship between $C_{2}$ and $C_{1}$ .

Conversely, if $C_{2} ◃_{+} C_{1}$ , there is a morphism from $C_{2}$ to $C_{1}$ by the categorical definition of additive subagent. Similarly, if $C_{0} ◃_{+}^{*} C_{2}$ , then $C_{2}^{*} ◃_{+} C_{0}^{*}$ , so there is a morphism from $C_{2}^{*}$ to $C_{0}^{*}$ , and thus a morphism from $C_{0}$ to $C_{2}$ . These compose to a morphism from $C_{0}$ to $C_{1} .$ $□$

When we introduced morphisms and described them as "interfaces," we noted that every morphism $(g, h) : C_{0} \to C_{1}$ implies the existence of an intermediate frame $C_{2}$ that represents $Agent (C_{0})$ interacting with $Env (C_{1})$ . The second decomposition theorem formalizes this claim, and also notes that this intermediate frame is a super-environment of $C_{0}$ and a subagent of $C_{1}$ .

In our next post, we will provide several methods for constructing additive and multiplicative subagents: "Committing, Assuming, Externalizing, and Internalizing."

AI ALIGNMENT FORUM
AF

AI ALIGNMENT FORUM
AF

10

Additive and Multiplicative Subagents

10

1. Definitions of Additive and Multiplicative Subagent

2. Basic Properties

3. Decomposition Theorems