Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-07
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.

Homomorphisms from a simple Verma module have dimension at most one

Statement

If M(μ) is simple, then dimHomg(M(μ),M(λ))1.

Facts & Assumptions

Proof

technique · contradiction
1.1

Suppose that f,g:M(μ)M(λ) are linearly independent. They are injective. Every endomorphism of M(μ) is scalar: it preserves the one-dimensional highest-weight space (visible in the character formula), and that highest vector generates the module. If the two simple images meet nontrivially, their intersection equals both images, so f1g is such an endomorphism, contradicting independence. Thus f(M(μ))g(M(μ)) embeds in M(λ).

givenassume-contra
2.1

Write δ=λμQ+, since a nonzero map sends the highest vector to a target weight vector, and put d=ht(δ). List the positive roots as α1,,αm and set hj=ht(αj)>0. By the character formula, the sum of weight-space dimensions at heights at most N below any Verma highest weight is D(N)=#{(k1,,km)Z0m:jhjkjN}. Both copies of the source's height-at-most-N subspace map into the target's height-at-most-N+d subspace, giving 2D(N)D(N+d). To compare these counts, let St={xR0m:jhjxjt} and H=jhj. The union of unit cubes based at the integer points counted by D(N) contains SN and is contained in SN+H, up to boundaries of volume zero. Since vol(St)=tm/(m!jhj), this yields D(N)Nm/(m!jhj) and hence D(N+d)/D(N)1. If m=0, both counts are instead exactly 1. In either case 2D(N)D(N+d) is impossible for large N.

step 1.1algebradischarge-contradiction

Depends on

Used by

Dependency tree · two levels

5 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