How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The coordinate vector space over F2
Definition
For , let . Give it coordinatewise addition and scalar multiplication using the operations of Binary residue carrier and operations. Its zero vector is . Then is a vector space over , with standard basis and dimension . For , the carrier consists of the empty tuple, and the basis is empty.
Facts & Assumptions
Given: An integer and the field .
Binary residue carrier and operations and The quotient Z/2 is the binary field: the carrier is with its quotient addition and multiplication, and these operations satisfy the field axioms.
Vector space over a field: a vector space has an abelian-group addition, zero vector, and scalar multiplication satisfying both distributive laws, associativity of scalar multiplication, and the identity-scalar law.
Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent: a finite list is independent when a zero linear combination forces every coefficient to be zero.
Linear combination of a finite list, and the span as the smallest linear subspace containing and is exactly the set of linear combinations of finite lists of elements of , and : the span of a list is the set of its finite linear combinations.
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis and Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis: a basis is an independent spanning set, and dimension is the number of elements in a finite basis.
Verification
The coordinate operations are closed because each coordinate operation is an operation in by [F1]. Each vector-space axiom in [F2] holds coordinate by coordinate by the corresponding field axiom in [F1]; coordinatewise equality then gives the vector identity. For there is only the empty tuple, and all coordinate identities hold vacuously.
For , let have coordinate at and elsewhere. Every equals coordinatewise, so spans. The vectors are pairwise distinct because their -coordinates differ. To verify that is independent in the subset sense of [F3], take any finite injective list and coefficients . If , the independence implication is vacuous. Otherwise write ; injectivity and distinctness of the make the indices pairwise distinct. The coordinate of is then exactly , so a zero sum forces every . This also covers , since then admits no nonempty list. Thus is independent, and it is a basis by [F4]–[F5]. Its distinct vectors give dimension .
Depends on
- Binary residue carrier and operations
- The quotient Z/2 is the binary field
- Vector space over a field
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- $\operatorname{span}(S)$ is exactly the set of linear combinations of finite lists of elements of $S$, and $\operatorname{span}(\varnothing) = \{0_V\}$
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
Used by
Dependency tree · two levels
37 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ronald de Wolf, Quantum Computing: Lecture Notes (arXiv:1907.09415v6, 2026) (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (17 April 2025) (standard reference, not scraped)