Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Filtered freeness lifts from associated graded algebras

Statement

Let A be a unital algebra over a field, with increasing exhaustive vector-space filtrations FnA for integers n≥0, F−1A=0, 1∈F0A, and FmAFnA⊆Fm+nA. Let R⊆Z(A) be a unital subalgebra with an increasing exhaustive nonnegative multiplicative filtration, F−1R=0, 1∈F0R, and FnR⊆FnA. Inclusion induces a graded algebra map gr⁡R→gr⁡A and hence the module structure used below; here gr⁡A=⨁n≥0FnA/Fn−1A.

Suppose a specified family (bj)j∈J is a homogeneous free basis of gr⁡A over gr⁡R, with degrees dj≥0. Here free basis means that every element has a unique finite expansion in the bj. Suppose specified aj∈FdjA have images bj in degree dj. Then (aj)j∈J is both a left and a right R-basis of A.

Proof

Given: The filtrations, graded basis and lifts in the statement. For negative n put FnR=0. Only finite sums occur in a direct sum; no family of additional lifts is chosen simultaneously.

1.1givenconstruct

Define D=⨁j∈JRuj, with FnD=⨁j(Fn−djR)uj, and ϕ:D→A by ϕ(∑jrjuj)=∑jrjaj. Finite support makes the formula meaningful. Multiplicativity of the filtration makes ϕ filtered, and its degree-n map sends the class of rjuj to the product of the degree-(n−dj) class of rj and bj. The given graded-basis property therefore makes gr⁡ϕ an isomorphism in every degree.

2.1step 1.1algebra

We prove that every x∈FnA belongs to ϕ(FnD) by induction on n≥−1. For n=−1, both spaces are zero. For n≥0, surjectivity of the degree-n map in 1.1 gives a finite homogeneous expansion of x+Fn−1A. Choose representatives in Fn−djR for its finitely many nonzero coefficients. They define y∈FnD with x−ϕ(y)∈Fn−1A. The induction hypothesis gives z∈Fn−1D with ϕ(z)=x−ϕ(y), whence x=ϕ(y+z). Exhaustivity now proves surjectivity of ϕ.

2.2step 1.1algebra

If 0≠y=∑jrjuj∈D, each nonzero coefficient has a least filtration degree ej, since its filtration is exhaustive and indexed by the nonnegative integers. Set n=max⁡rj≠0(ej+dj), a maximum of a nonempty finite set. At least one coefficient has nonzero image in its degree ej quotient, so y+Fn−1D≠0. Injectivity of gr⁡ϕ in 1.1 gives ϕ(y)+Fn−1A≠0. Thus ϕ(y)≠0, proving injectivity.

3.1

Hence ϕ is a left R-module isomorphism. As R⊆Z(A), rjaj=ajrj for each coefficient, so the same finite expressions give unique right expansions. If J is empty, the degreewise argument in 2.1 forces A=0; the empty basis assertion remains valid whenever the zero algebra is admitted. Degree zero, a singleton basis, and the zero element require no change in the argument. All choices in 2.1 are finite choices for a single induction step; the proof asserts existence separately for each x, and uses no axiom of choice. This establishes both bases. [step 2.1, step 2.2, given] QED

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources