List indexing is a fundamental mechanism within computational data structures that establishes a bijective mapping between integer ordinal offsets and elements in a linear sequence. This theory defines the retrieval operation based on zero-based indexing conventions, where the position $i$ corresponds to the element at index $i$, formalizing access as a direct lookup without iteration. The concept operates strictly within the domain of algorithmic data structure theory, serving as a primitive accessor for ordered arrays and sequences in computer science.
Prerequisite chain context: requires Variable Assignment and Object References in Python.