Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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, F and N are sets, F is a real vector space, N is a linear subspace of F, and F/N has representative-independent vector operations making it a real vector space. Its displayed product and positive-scaling relations hold in the quotient.

Facts & Assumptions

[F1]

Type-offset quotient vector space: G is a set closed under product and positive scaling; F consists of finite-support functions; N is the set of finite linear combinations of the stated relation vectors.

[F3]

Linear subspace of a vector space: a nonempty subset closed under addition and scalar multiplication is a linear subspace with inherited operations.

Proof

Given: [F1]–[F4].

1.1F1F2F3F4

The set of all functions G→R exists and is a vector space by [F2]. Separation [F4] selects the functions whose support is finite, so F is a set. It contains zero; if c,d∈F, then supp⁡(c+d)⊆supp⁡(c)∪supp⁡(d), a finite union, and supp⁡(tc)⊆supp⁡(c) for every scalar t. Thus F is a linear subspace of the function space by [F3], hence a real vector space.

1.2F1F2F4

The index sets G×G and R>0×G exist by [F4]. Replacement applied to the two displayed relation maps in [F1] gives the set R; each relation vector has support of size at most three and lies in F. The family of finite subsets of R 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 N⊆F of all finite linear combinations.

2.1F1F3step 1.2

The zero vector is in N as the empty sum. If u,v∈N, 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 t∈R, tu is obtained by multiplying every coefficient by t. Hence N is closed under addition and scalar multiplication and is a linear subspace of F by [F3].

3.1F1F4step 2.1

Define c∼d on F exactly when c−d∈N. Since 0∈N, N is closed under negatives (take scalar −1), and under addition, this relation is reflexive, symmetric and transitive. Each class [c]={d∈F:d−c∈N} is a subset of F by separation; replacement on the set F gives the quotient set of these classes.

4.1F1F2step 2.1step 3.1∎

If c∼c′ and d∼d′, then (c+d)−(c′+d′)=(c−c′)+(d−d′)∈N; and for any scalar t, tc−tc′=t(c−c′)∈N. Therefore [c]+[d]:=[c+d] and t[c]:=[tc] do not depend on representatives. The quotient map c↦[c] preserves zero, addition and scalar multiplication; applying it to each vector-space identity in F proves all vector-space axioms in F/N. Every generator in R lies in N, so its class is zero and the two displayed relations hold.

Depends on

Dependency tree · 2 levels

Sources