If agent 1 creates an agent 2, it will always know for sure its goal function.
That is the point, though. By Loeb’s theorem, the only agents that are knowable for sure are those with less power. So an agent might want to create a successor that isn’t fully knowable in advance, or, on the other hand, if a perfectly knowable successor could be constructed, then you would have a finite method to ensure the compatibility of two source codes (is this true? It seems plausible).
That is the point, though. By Loeb’s theorem, the only agents that are knowable for sure are those with less power. So an agent might want to create a successor that isn’t fully knowable in advance, or, on the other hand, if a perfectly knowable successor could be constructed, then you would have a finite method to ensure the compatibility of two source codes (is this true? It seems plausible).