Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (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.

Verma-filtered objects are acyclic for n-minus coinvariants

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let M∈O be Verma-filtered. Then Tor⁡jU(n−)(C,M)=0 for all j>0. In particular the coinvariant functor M↦M/n−M=C⊗U(n−)M is exact on Verma-filtered objects.

Facts & Assumptions

Given: The Axiom of Choice, a Verma-filtered object M∈O with a filtration 0=M0⊆M1⊆⋯⊆Mn=M and Mj/Mj−1≅M(ψj).

[F1]

Each Verma module satisfies M(ψ)≅U(n−) as a left U(n−)-module, so it is free, hence projective (The PBW model of a Verma module, Tor from a projective resolution of the left module).

[F2]

If the resolved variable is projective, then Tor⁡i=0 for all i>0 for every supplied projective resolution (Positive Tor vanishes when the resolved variable is projective).

[F3]

For a short exact sequence 0→A→B→C→0 of left U(n−)-modules and the right module C there is a natural long exact sequence in Tor⁡, ending in C⊗A→C⊗B→C⊗C→0; it requires Dependent Choice to supply the resolutions, and the Axiom of Choice implies Dependent Choice (The long exact Tor sequence in the left-module variable, The Axiom of Choice).

[F4]

Verma filtrations and their length are as in Type of a module with a Verma filtration.

Proof

1.1F1F2

For j>0 one has Tor⁡jU(n−)(C,M(ψ))=0: by [F1] the module M(ψ) is free, hence projective, and [F2] applies to a projective resolution of M(ψ).

2.1F3F4step 1.1baseih

Induction on the filtration length n. For n=0 we have M=0 and all Tors vanish. For n≥1 use the short exact sequence 0→Mn−1→Mn→M(ψn)→0 and its long exact Tor sequence [F3]. Its piece Tor⁡j(C,Mn−1)→Tor⁡j(C,Mn)→Tor⁡j(C,M(ψn)) has vanishing outer terms for j>0: the first by induction and the second by step 1.1. Exactness in the middle gives Tor⁡jU(n−)(C,M)=0 for all j>0.

3.1F3step 2.1discharge-induction: induction on the filtration length∎

For exactness of the coinvariant functor, let 0→A→B→C→0 be a short exact sequence of Verma-filtered objects. Its long exact Tor sequence begins Tor⁡1(C,C)→C⊗A→C⊗B→C⊗C→0; the first term vanishes by step 2.1, so 0→C⊗A→C⊗B→C⊗C→0 is exact. Hence M↦C⊗U(n−)M is exact on Verma-filtered objects.

Depends on

Used by

Dependency tree · two levels

28 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