How should we define the behavior of a Turing machine where the head tries to move left from the leftmost tape position?
There is no single accepted model of Turing machines. Different choices would lead to very similar models, which simulate each other with very small overhead. That's why we usually don't care so much about the exact model.

Here are some possibilities:


If the Turing machine attempts to move to the left of the origin, then the head stays put. The Turing machine might or might not be notified.
The Turing machine has a mechanism to detect that it has reached the origin, and cannot move to the left of it (the specs don't allow it).
Same, but not the machine can move to the left, and crashes if it attempts to do so (you decide how to interpret a crash – acceptance, rejection, infinite loop).
If a Turing machine attempts to move to the left of the origin, then instead it moves right. This makes sense if the Turing machine is guaranteed to always move at every step.


You can probably think of several other alternatives.