The reason I'm saying that is because if there is a loser, than the moves the loser played simply weren't as good (i.e. didn't make as many points or didn't attack a group) or better than the moves his/her opponent played. If they were, then that person would have won the match.
I understood you, i think you didn't understand my post here.
Since we neither know the perfect komi value or the perfect play, this is all a hypothetical argument. But these are good to find logical flaws in arguments. And if i use this approach on your conclusions, then perfect play is impossible if the komi is x.5
The number of possible board situations is finite and so is the number of possible moves for each player with a given board position. With super ko it is ensured that each sequence of plays does end at some point.
The komi is a theoretic perfect komi x.
We assume that at every position there exist an optimal move for the current player, the move that maximizes his point potential and minimizes the point potential of the opponent. Both players use the same metric to find this best move.
This metric M is dependant on the komi-value x, which is what you stated. Komi has to be taken into account while playing. Depending on M and x, there is game-result R. So M is a function of x leading to a game-result R (Winning margin for black). This can be stated in the following form:
M(x) = R
Now we solve this for x, given R=0 (jigo). This x' is the theoretic perfect komi, under which perfect play results in jigo.
Now lets put x'.5 into the equation. Since the game is sure to end at some point there is a clear result R'. Because of the 0.5 in the komi this R' can not be 0, so there is a clear winner. There are two possibilities:
R < 0 - White wins. By your argument this means black did not play perfectly, that means didn't follow M during the game. But he did, so this is a clear violation of the beginning assumption (both players play perfectly), so this can not be the case.
R > 0 - Black wins. The same argument as for black can be now made for white. So we have clear contradiction. Assuming both players play perfectly and assuming there exist a perfect komi x' which leads to jigo under perfect play, a contradiction occurs by your argument (that loosing = not playing perfect).
I think there are three posibilities how we can solve this contradiction:
M - Can there be a single function, depending on komi, leading to an optimal game-result? Since, like Sennahoj said all games are finite and the number of moves are finite it is possible. It may not be computable, bit it exists. (An optimal game-result would here be the minimum R.)
x' - Does a perfect komi exist, that would lead to jigo under perfect play? I think this is debatable. Since we don't know the whole game-tree it might be possible that at some point a branch can be selected, after which no jigo exists. This however would mean the game is inherent unfair, regardless of the 0.5 komi. I don't like to assume this.
Losing under perfect play is possible if komi includes 0.5. Assuming this is much more natural for me. For one, komi is awarded to white to compensate the advantage of the first move. And since all points are counted as whole numbers i find it hard to see how a player can gain a 0.5 lead, if komi is a whole number. So the advantage of the first move would also have to be a whole number (the lead black gains by playing first).
There a situations where the average value of a move might be a fraction because it takes several moves to gain a single point, but the actual lead is still whole, because either the player gains that point or he doesn't, he can't gain 0.5 points.
So from my point of view - yes a .5-komi is unfair but only if we have arrived at the optimal x'.5 komi. I don't think we have and if we had we would see white winning most of the time in pro games - then it would probably adjusted to x', even if this would mean more work handling jigos in tournaments.