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

Relative projectivity forces character vanishing off the controlling p-section

Statement

Assume the Axiom of Choice. Let (K,O,k) be a splitting p-modular system whose residue field k is algebraically closed, let H be finite, and let QH be a p-subgroup. If an OH-lattice M is relatively Q-projective and θ is the ordinary character of KOM, then θ(x)=0 for every xH whose p-part is not H-conjugate to an element of Q.

Facts & Assumptions

Given: AC and the modular system, groups, lattice, character, and element in the Statement.

[F1]

Relative Q-projectivity means that M is a summand of its induction from Q (Relative projectivity and vertices for integral group lattices).

[F2]

Integral Mackey decomposition and induction transitivity hold for these lattices (Integral Mackey decomposition and Higman's criterion for group lattices).

[F3]

Finite-rank group lattices have Krull--Schmidt decompositions (Krull-Schmidt holds for finite-rank OH-lattices).

[F4]

Induction across a normal subgroup of index p preserves indecomposability when k is algebraically closed (Green indecomposability for index-p integral induction and An algebraically closed field: every nonconstant polynomial has a root in the field).

[F5]

AC is available (The Axiom of Choice). It is retained for the pair's inherited foundation contract; the proof below uses only finite coset sets and finite decompositions and makes no additional use of AC.

Proof

1.1

The assertion is immediate if M=0, so assume otherwise. Let t be the p-part of x. Since 1Q, the hypothesis implies t1; in particular p divides x. Put C=xandL=xp. Then LC and [C:L]=p. The subgroup generated by t is the Sylow p-subgroup of the cyclic group C. If RC does not contain t, then RL: indeed, any power xjL has pj and generates the whole Sylow p-subgroup of C.

givenalgebra
2.1

By F1, M is a direct summand of Y=IndQHResQHM. Restricting to C and using F2 gives ResCHYsC\H/QIndRsCVs,Rs=CsQs1, for the corresponding integral Rs-lattices Vs. If some Rs contained t, then t would belong to the H-conjugate sQs1, contrary to the hypothesis. Thus step 1.1 gives RsL for every s. By induction transitivity, IndRsCVsIndLC(IndRsLVs).

F1F2step 1.1
3.1

Decompose each nonzero OL-lattice IndRsLVs into indecomposables Ws,j by F3. Because LC has index p, F4 says that every IndLCWs,j is indecomposable. Hence step 2.1 is an indecomposable decomposition of ResCHY. Since ResCHM is a direct summand, Krull--Schmidt makes each of its indecomposable summands isomorphic to one of these induced lattices.

F2F3F4step 2.1
4.1

For any OL-lattice W, scalar extension identifies KOIndLCW with IndLC(KOW). Its direct-sum decomposition over the p cosets of L in C is cyclically permuted by x, because xL. Thus the matrix of x has zero diagonal blocks, and its trace is zero. Applying this to every summand selected in step 3.1 and adding their traces yields θ(x)=tr(xKOM)=0. Algebraic closedness is used exactly through Green indecomposability in step 3.1; all selections and sums are finite.

F3F4F5step 3.1algebra

Depends on

Used by

Dependency tree · two levels

11 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