Alphabeta Math
TheoremStatement: 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.

Green indecomposability for index-p integral induction

Statement

Let (K,O,k) be a splitting p-modular system whose residue field k is algebraically closed. Let NH with [H:N]=p, and let L be a nonzero indecomposable ON-lattice. Then IndNHL is an indecomposable OH-lattice.

Facts & Assumptions

Given: The modular system, algebraically closed residue field, groups, and lattice in the Statement.

[F1]

Indecomposable group lattices have local endomorphism rings, and finite direct sums satisfy Krull--Schmidt (Krull-Schmidt holds for finite-rank OH-lattices).

[F2]

Induction here is induction of finite-free integral lattices as in Relative projectivity and vertices for integral group lattices.

[F3]

Algebraic closedness means every nonconstant polynomial over k has a root (An algebraically closed field: every nonconstant polynomial has a root in the field).

Proof

1.1

Put X=IndNHL and let IH(L)={hH:hLL}. This is a subgroup containing N, so the prime-index hypothesis gives IH(L)=N or H. By F1, E0=EndON(L) is local. Its residue division ring E0/J(E0) is finite-dimensional over k; F3 makes it equal to k, because every element satisfies a split polynomial and a division ring has no nonzero zero divisors.

F1F3algebra
2.1

Suppose IH(L)=N. On restriction to N, X is the direct sum of the p pairwise nonisomorphic conjugates of L. Krull--Schmidt and step 1.1 identify the semisimple quotient of its N-endomorphism ring with kp: diagonal entries reduce modulo the local radicals, while every map between distinct indecomposable summands belongs to the categorical radical. Conjugation by a generator of H/N cyclically permutes these p factors. An H-endomorphism idempotent therefore has image (0,,0) or (1,,1) in kp. In the first case the idempotent lies in the Jacobson radical and is zero; in the second its complement does, so it is one. Thus X has no nontrivial H-endomorphism idempotent and is indecomposable.

F1F2step 1.1algebra
2.2

Suppose IH(L)=H. Choose isomorphisms among the p conjugate summands. They identify the semisimple quotient of EndON(X) with Mp(k). The action of a generator of H/N on this quotient is conjugation by a matrix T that cyclically permutes the p diagonal primitive idempotents. Its pth power is scalar, say Tp=λI. By F3 choose μk with μp=λ; in characteristic p, zpλ=(zμ)p. The cyclic permutation of the diagonal idempotents makes T cyclic of degree p, so its Jordan form is one block and CMp(k)(T)=k[T]k[z]/((zμ)p), a local algebra.

F3step 1.1algebra
3.1

Every H-endomorphism of X is an N-endomorphism fixed by this conjugation. Hence an H-endomorphism idempotent maps to an idempotent in the local centralizer computed in step 2.2, and that image is 0 or 1. The kernel of the reduction to Mp(k) lies in the Jacobson radical of the N-endomorphism ring; an idempotent in it is zero, and the same argument applied to the complement handles image 1. Thus again only 0 and 1 occur, so X is indecomposable. The two inertia cases are exhaustive. The nonzero hypothesis excludes the zero lattice, and the proof uses only finite decompositions; algebraic closedness is used exactly in steps 1.1 and 2.2, not as a hidden choice principle.

F1step 1.1step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

7 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