Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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 filtrations are not closed under quotients

Statement refuted

Every quotient of a Verma-filtered object of O is Verma-filtered; in particular the quotient of the standard module Δ(0)=M(0) by the image of Δ(−2)↪M(0) is Verma-filtered.

Facts & Assumptions

Given: The Axiom of Choice, g=sl2 with ρ=1 and dot action s⋅λ=−λ−2, and the standard modules Δ(λ)=M(λ).

[F1]

The rank-one computation of the parent example gives the nonsplit sequence 0→M(−2)→M(0)→L(0)→0 in which M(−2)=Δ(−2)=L(−2) is simple because ⟨λ+ρ,α∨⟩<0 for λ=−2, while M(0) is infinite-dimensional with basis vk and weights λ(h)−2k (The two projectives in the principal sl2 block, Antidominant regular Verma modules are simple).

[F2]

A finite Verma flag of Y gives [Y]=∑μmμ[Δ(μ)] in K0(O) with nonnegative integers mμ, and the standard classes [Δ(μ)]=[M(μ)] form a Z-basis; the class is additive on short exact sequences (Finite Verma flags and their multiplicities, Simple and standard bases of K0(O), Verma-flag multiplicities are independent of the flag).

Counterexample

Assume the Axiom of Choice (The Axiom of Choice).

Proof technique: direct: compute the Grothendieck class of the simple quotient and read off a negative flag multiplicity.

1.1F1given

The inclusion M(−2)↪M(0) of [F1] is the map sending the highest-weight generator of M(−2) to the singular vector fv0∈M(0), and M(−2)=L(−2) is simple, so the quotient M(0)/M(−2) has weights only in weight 0: the h-coordinates of the weights of M(0) are 0,−2,−4,… and those of M(−2) are −2,−4,…, and M(0)0=Cv0. The quotient is therefore the one-dimensional simple module L(0)=Cv0 with v0 the image of the highest-weight generator, and the sequence 0→Δ(−2)→Δ(0)→L(0)→0 is nonsplit: a splitting would exhibit L(0) as a one-dimensional submodule of M(0), necessarily spanned by the weight-zero vector v0, but the submodule generated by v0 is all of the infinite-dimensional module M(0).

1.2F2

Both Δ(−2)=M(−2) and Δ(0)=M(0) are Verma-filtered: each has the one-step flag 0⊆Δ(λ).

2.1F2step 1.1step 1.2algebra

The simple module L(0) is not Verma-filtered. If it had a finite Verma flag, [F2] would give [L(0)]=∑μmμ[Δ(μ)] with all mμ≥0. On the other hand the exact sequence of step 1.1 gives [L(0)]=[Δ(0)]−[Δ(−2)] in K0(O). Since the standard classes form a Z-basis, comparing the two expressions forces m0=1 and m−2=−1, contradicting m−2≥0.

3.1step 1.2step 2.1∎

Thus Δ(−2) and Δ(0) are Verma-filtered while their quotient L(0)=M(0)/Δ(−2) is not, refuting the statement; the quotient in the standard-filtration theorem for projectives is a direct summand rather than an arbitrary quotient, which is what makes that argument work.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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