Let be a return function, , the sequence is fixed, and . We define:
Then we prove that:
Lemma
Let . Then:
where .
Proof
: Suppose . Then for every , , hence .
: Assume there exists the smallest 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.
Counterexample to the Pointwise Implication
We show that replacing with breaks the theorem: we construct explicit for which the values and coincide at one specific , but is not an affine transformation of on .
Let us define
Then , for all , and , so and the condition holds. A direct computation gives
Take . The condition holds for , that is, .
Now define on the same :
All values lie in , so and . We compute the ratios:
For we have , , . Hence
We show that there is no affine relation. Suppose on the entire set . From and we get and , that is, . But , so we have a contradiction.
Theorem of extension to dense subsets of
Fix for which are well-defined. Introduce the notation , setting if . The function is non-increasing on .
Let be dense in . Then
Combined with the original lemma, this yields the equivalence of with the affinity , , on .
Proof
The implication is trivial.
We show . By contradiction suppose there exists with . Without loss of generality . Denote .
By the definition of we have . From the inequality , for all we have . Set
The minimum is over a finite set, and each term is strictly greater than , so the minimum is also strictly greater than . Take any . Since for all , we have .
On the other hand, , so and . In total:
The interval is non-empty and open in . By density of there exists . Then , which contradicts .
Sharpness of the Density Condition
We can also show that the density of in cannot be weakened without losing the theorem for all admissible .
Suppose is not dense: there exists an open interval with . Without loss of generality (otherwise shift the interval inside , which preserves the property of not intersecting for a suitable subinterval; the informative zone of lies precisely in , since gives for ).
Choose inside . Define the returns via the values of :
The corresponding are obtained as , , , . All values lie in , so remains the argmax for both returns, and the conditions of the lemma are satisfied.
We compute :
: , .
: , .
: for , , .
: no qualifies, .
The same for with the substitution . A discrepancy is possible only in the zone between and : for one of the functions equals , the other equals . But this zone lies entirely in and hence does not intersect . Outside both functions coincide by construction.
We obtained that on , but not on all of as holds while fails. By the original lemma, the failure of means that is not affinely related to on .
As a result, for any , the property " implies affinity for all admissible " is equivalent to the density of in .