Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 correspondence for a trivial intersection subgroup

Example

Assume AC. Let G be finite, k a field of characteristic p>0, P a nontrivial Sylow p-subgroup, and H=NG(P). Assume that P is a trivial-intersection subgroup: PgP=1 whenever gNG(P). If H<G, Green correspondence matches all nonprojective indecomposable finite-dimensional G- and H-modules, and both error modules are projective. If H=G, the correspondence is the identity; its restriction to nonprojective modules is also the identity.

Facts & Assumptions

Given: This TI Sylow subgroup and normalizer.

[A1]

AC (The Axiom of Choice) is retained for the inherited decomposition argument and the general relative-1/projective comparison.

[F1]

The full Green theorem gives inverse maps on Z-vertex classes and the indicated error families (Green correspondence with exceptional families).

[F2]

Exceptional containment and admissibility have the properties in Green exceptional family containment and fusion.

[F4]

Under AC, relative 1-projectivity is equivalent to projectivity (A module is relatively H-projective when it is a direct summand of one induced from H).

[F6]

A vertex of a relatively B-projective module lies in a conjugate of B (Relative projectivity mackey intersections for finite modules).

Verification

1.1

Suppose H<G. For every gH, TI gives PgP=1. Also D=HgP is a p-subgroup of H. Since PH, the image of D in H/P has order a power of p dividing [H:P], which is prime to p. These divisibilities follow by partitioning each finite group into cosets of the relevant subgroup. Hence that image is trivial and DP. It follows that DPgP=1. As GH is nonempty, we obtain exactly X=Y={1}. Their excluded conjugate-containment class consists only of the trivial subgroup, so Z={QP:Q1}.

F1F2givenalgebra
1.2

For K=G or H, the index [K:P] is invertible in k. On any kK-module V, the relative trace of [K:P]1idV is idV, since all its conjugates are the same scalar identity. F3 makes every such module relatively P-projective. For nonzero indecomposable V, F5 and F6 then permit a vertex lying inside P.

F3F5F6givenalgebra
2.1

Under A1 and F4, an indecomposable module with vertex 1 is projective. Conversely a projective indecomposable is relatively 1-projective, so 1 itself is a minimal inducing p-subgroup, hence a vertex. Thus having a nontrivial vertex is equivalent to being nonprojective. Combining 1.1–1.2, the full Z-vertex domains in F1 are exactly the nonprojective indecomposables on both sides. The full theorem, not merely its fixed-P corollary, therefore gives the asserted bijection.

A1F1F4step 1.1step 1.2
3.1

The errors in F1 are relatively {1}-projective by 1.1. Each of their finitely many indecomposable summands is projective by F4, hence the errors are projective: a finite sum of projectives lifts maps across surjections by lifting each component separately. If H=G, the exceptional families instead are empty, both errors vanish and F1 gives the identity correspondence. It restricts to the identity on nonprojective modules. Zero errors are allowed, but zero is outside the indecomposable domains. We make no assertion that the projective summands of an error are mutually isomorphic.

F1F4step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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