Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

PTFA finite projective base change and Euler characteristic

Statement

Let k be a commutative field, let G be PTFA, put A=k[G], and supply its Ore fraction division ring K. Subscripts k and K mean tensor base change along augmentation A→k and inclusion A→K, respectively.

For every finitely generated projective right-A module P, dim⁡KPK=dim⁡kPk<∞. For a homomorphism f:P→Q between such modules, dim⁡Kim⁡fK≥dim⁡kim⁡fk. Consequently, for any bounded complex P∗ of finitely generated projective right-A modules, ∑i(−1)idim⁡KHi(PK)=∑i(−1)idim⁡kHi(Pk). If additionally the complex is nonnegative, dim⁡kH0(Pk)=1 and H0(PK)=0, then dim⁡KH1(PK)≤dim⁡kH1(Pk)−1. No choice principle or free basis for a projective module is assumed.

Facts & Assumptions

Given: The field, group, fraction division ring and the finite projective modules or bounded complex in the relevant assertion.

[F1]

PTFA augmentation detects projective injectivity, and finite matrices over A have K-rank at least their augmented k-rank, without a choice principle. PTFA augmentation detects projective injectivity without choice

[F2]

Projectivity is the individual lifting property for surjections, with right modules read over the opposite ring. Tensor base change preserves compositions, sums and split identities. Projective modules and the lifting property, The opposite ring Rop, The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums

Proof

1.1F1F2givenconstructalgebra

Choose a finite generating list for P, giving a surjection π:An→P. Projectivity gives one section s:P→An. The matrix E=sπ is idempotent, and after either base change P identifies with the image of that idempotent. Put r=rank⁡kEk. By [F1], rank⁡KEK≥r and rank⁡K(1−E)K≥n−r. Idempotency gives the actual complementary decomposition Kn=im⁡EK⊕im⁡(1−E)K: every vector is the sum of its two displayed images, and their intersection is zero after applying EK. Their dimensions therefore add to n, forcing equality in both inequalities. Hence dim⁡KPK=r=dim⁡kPk. Only one finite generating list and one projectivity section were used.

2.1F1F2step 1.1constructalgebra

Take finite split surjections πP:Am→P and πQ:An→Q, with sections sP,sQ. The finite matrix T=sQfπP has, after either base change, the same image dimension as f: the map πP remains surjective and sQ remains injective by their split identities. Applying [F1] to T yields dim⁡Kim⁡fK≥dim⁡kim⁡fk. This argument does not treat P or Q as free.

3.1step 1.1step 2.1constructalgebra

For a bounded complex after either base change all chain groups are finite-dimensional. If di:Pi→Pi−1 is its differential, finite-dimensional rank-nullity and cycles modulo boundaries give dim⁡(Pi)∗=rank⁡(di)∗+dim⁡Hi(P∗)+rank⁡(di+1)∗, where ∗ is k or K. Summing with signs over the finite range cancels every differential rank, so the alternating homology dimension equals the alternating chain dimension. The latter sums are equal under the two base changes by step 1.1. This proves the asserted Euler equality, with no boundedness or generation conclusion inferred for an unrelated singular complex.

4.1F2step 1.1step 2.1step 3.1algebra∎

In the nonnegative case, d0=0. Write ni=dim⁡k(Pi)k=dim⁡K(Pi)K. The degree-zero hypotheses give rank⁡(d1)k=n0−1 and rank⁡(d1)K=n0. Step 2.1 gives rank⁡(d2)K≥rank⁡(d2)k. Therefore dim⁡KH1(PK)=n1−n0−rank⁡(d2)K≤n1−n0−rank⁡(d2)k=dim⁡kH1(Pk)−1. Every section and generating set needed for the bounded complex belongs to one finite list; finite elimination over k and K requires no choice axiom. This proves all assertions in their stated projective scope.

Depends on

Used by

Dependency tree · two levels

15 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