Let be a return function, , the sequence is fixed, and . We define:
Then we prove that:
Lemma
Let . Then:
where .
Proof
: Suppose . Then .
: Assume there exists such that . Without loss of generality, let (the case is symmetric). Choose:
Then is included in the set , but not in . Consequently:
From necessity and sufficiency, the lemma is proven.
Now, based on the lemma, it suffices to prove:
Let's introduce the notation: , , , .
: Suppose for all , with . Then for any :
Since , the denominator , and:
: Suppose . This means:
Where , since otherwise would be undefined for all , contradicting the assumption .
Let's define:
From , by multiplying both sides by :
We also separately check the cases with and :
From the definition of , we have .
Thus, from necessity and sufficiency, the relation is proven for all , where , meaning is an affine transformation of on the specified set.
Since the proof establishes that if and only if is an affine transformation of () on , and STARC-equivalence requires with on the entirety of , it follows that STARC-equivalence is a strictly stronger condition. In particular, , because any is a special case of , and the condition on the entirety of implies the condition on a subset.