What does amortized O(1) append mean for a geometrically growing dynamic array?

What does amortized O(1) append mean for a geometrically growing dynamic array?

1. Every append performs exactly one assignment.
2. Average cost over a long operation sequence is constant, although one resize may copy O(n) elements.
3. The array never allocates more storage.
4. The worst single append is O(1).