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.
Type-offset quotient is a real vector space
Statement
For the construction in Type-offset quotient vector space, and are sets, is a real vector space, is a linear subspace of , and has representative-independent vector operations making it a real vector space. Its displayed product and positive-scaling relations hold in the quotient.
Facts & Assumptions
Type-offset quotient vector space: is a set closed under product and positive scaling; consists of finite-support functions; is the set of finite linear combinations of the stated relation vectors.
The vector space of all functions with pointwise operations, and as the case and Vector space over a field: all functions form a real vector space under pointwise operations.
Linear subspace of a vector space: a nonempty subset closed under addition and scalar multiplication is a linear subspace with inherited operations.
The Axiom of Pairing: , The Axiom of Union: , The Axiom of Infinity: there is a set containing a set with no elements and closed under , The Axiom Schema of Separation: for each formula , , The Axiom of Power Set: , The Axiom Schema of Replacement: for each formula , if defines a class function on then its image on is a set, and The Cartesian product : pairs, unions, natural numbers, subsets, power sets, images of sets, and Cartesian products of sets exist.
Proof
Given: [F1]–[F4].
The set of all functions exists and is a vector space by [F2]. Separation [F4] selects the functions whose support is finite, so is a set. It contains zero; if , then , a finite union, and for every scalar . Thus is a linear subspace of the function space by [F3], hence a real vector space.
The index sets and exist by [F4]. Replacement applied to the two displayed relation maps in [F1] gives the set ; each relation vector has support of size at most three and lies in . The family of finite subsets of is a subset of its power set, and the coefficient functions on each such finite subset form sets by [F2] and [F4]. Replacement under finite summation therefore gives the set of all finite linear combinations.
The zero vector is in as the empty sum. If , write each as a finite combination of relation vectors; their sum is the finite combination on the union of those two finite index sets, adding coefficients where an index repeats. For , is obtained by multiplying every coefficient by . Hence is closed under addition and scalar multiplication and is a linear subspace of by [F3].
Define on exactly when . Since , is closed under negatives (take scalar ), and under addition, this relation is reflexive, symmetric and transitive. Each class is a subset of by separation; replacement on the set gives the quotient set of these classes.
If and , then ; and for any scalar , . Therefore and do not depend on representatives. The quotient map preserves zero, addition and scalar multiplication; applying it to each vector-space identity in proves all vector-space axioms in . Every generator in lies in , so its class is zero and the two displayed relations hold.
Depends on
Type-offset quotient vector space
Complete ordered field (least-upper-bound property)
The vector space of all functions with pointwise operations, and as the case
Vector space over a field
Linear subspace of a vector space
The Cartesian product
The Axiom of Pairing:
The Axiom of Union:
The Axiom of Infinity: there is a set containing a set with no elements and closed under
The Axiom Schema of Separation: for each formula ,
The Axiom of Power Set:
The Axiom Schema of Replacement: for each formula , if defines a class function on then its image on is a set