A "small triangle" in a square lattice is defined as one whose vertices are non-collinear lattice points, and whose boundary and interior contain no other lattice points.
I recently came across the following:
Claim: the area of any "small triangle" is 1/2 the area of the lattice's unit cell.
I'm looking for a simple proof of this claim.
I see that the claim would hold if the following condition holds:
Condition: the shortest side of the smallest "lattice rectangle"1 containing the small triangle has length 1.
Then the claim follows from the elementary formula $\frac{1}{2} b h$ for the area of a triangle, since the condition implies that $b = h = 1$.
This condition, however, does not hold for all small triangles. (In fact, the triangle defined by lattice points $(0, 0), (1, 2),$ and $(2, 3)$ is small, and the smallest lattice rectangle that contains it has sides with lengths $2$ and $3$.)
It is not clear to me that the claim would hold for all small triangles that don't satisfy the condition above.
Update
One possibility is that the condition above should have been part of the definition of a small triangle, but was omitted by mistake. After all, the context for the claim was a proof of Pick's theorem, and it seems to me that this proof would have still gone through even if the definition of small triangles included the condition above.
IOW, if we define a "tiny triangle" as any small triangle that satisfies the condition above, then one could derive a proof of Pick's theorem from the proposition that the polygon in the theorem's premise can always be covered by a set of tiny triangles. I don't have a proof of this last assertion (anything that I can think of would probably be a tedious slog through a number of cases), but it seems to me very plausible.
1 By "lattice rectangle" I mean a rectangle whose corners are lattice points, and whose sides are parallel to the sides of a lattice unit cell.