Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Cyclotomic multipartitions have equal residue content exactly when Jantzen-connected

Statement

Let F be any field, let qH∈F× have finite order e≥2 with qH≠1, let ℓ≥1 and Qa=qHca. For all ℓ-multipartitions λ,μ of rank n≥0, the node-residue contents Ci(λ)=#{(r,s,a)∈[λ]:ca+s−r≡i(mode)} agree for every i∈Z/eZ if and only if λ∼Jμ for the exact integer Jantzen coefficients of Cyclotomic Schur Jantzen sum formula from rim-hook valuations. This includes arbitrary levels and all field characteristics.

Facts & Assumptions

Given: The exact J formula [F1], the charged core-matrix connectivity [F2], the fixed-component-core lift lemma [F3], and the multipartition residue conventions [F4].

[F1]

Jλμ is the signed integer sum of νπ(res⁡O(fxλ)−res⁡O(fyμ)) over equal-remainder equal-length hook pairs, 0 unless λ strictly dominates μ (Cyclotomic Schur Jantzen sum formula from rim-hook valuations).

[F2]

Charged core height matrices admit content-preserving descent and minimal switch connectivity: within a content class of rank-≤n cores with the same hub there is a sequence of γ=2 zero-size switches followed, unless already minimal, by a γ≥3 strict descent, every intermediate core having size at most n and the same hub (Charged core height matrices: hub-preserving descent and minimal switch connectivity).

[F3]

Multipartitions of rank n with equal componentwise e-cores are J-equivalent, and the full-level coefficient for a change in one fixed-size component equals its level-one coefficient (Multipartitions with fixed component cores are cyclotomic Jantzen-connected).

[F4]

Multipartitions, their nodes (r,s,a), the charged parameters z,Ua and residue conventions (Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules).

Proof

technique · direct

Given: The rank n, the charges ca, and the suppliers of [F1]–[F4].

1.1F1F4algebra

Necessity. Suppose Jλμ≠0; then at least one term of its signed integer sum has nonzero valuation, and evaluating that generic foot difference at t=1 gives zero, so the two foot eigenvalues coincide and, since qH has order e, their charged foot residues agree. The two hooks have equal length and the same remainder diagram. Along a rim strip, reading from its lowest-left node to its highest-right node increases the content by one at every step, so its residue multiset consists of h consecutive residues starting at its foot; hence the two removed hooks have identical residue counts and C(λ)=C(μ). Transitivity gives the necessity of C(λ)=C(μ) for every J-path.

1.2F2F4

Sufficiency setup: cores and lifts. Let κ be the componentwise core of a member of the rank-n content class; its size is at most n and congruent to n modulo e, and by [F2] all such cores have the same hub and are connected by the prescribed switch sequence. Every intermediate core has size at most n and the same hub, so adding (n−core size)/e e-hooks produces a rank-n multipartition of the same content by the equal-hub/equal-size clause of [F2].

2.1F1F2step 1.2

The explicit one-hook lift across a core switch. Let κ′ be obtained from κ by the oriented switch in rows i,j and components a,b of [F2], with γ≥2, so ∣κ′∣=∣κ∣−eD with D=γ−2≥0. Write u=i+etia, v=j+e(tja+1), v′=j+etjb, u′=i+e(tib+1): the switch removes bead u and inserts v in component a, and removes v′ and inserts u′ in component b. Put w=(n−∣κ∣)/e≥0, form λ from κ by moving the lowest bead u of the i-runner in component a to u+ew (adding w e-hooks on this runner), and form μ from κ′ by moving its lowest bead v on the j-runner in component a to v+e(w+D). Both have size n, the same hub, and by [F2] equal content. Their beta sets in component a differ only by replacing u+ew with v+e(w+D), and those in component b only by replacing v′ with u′. Because (v−u)+(u′−v′)=−eD, we have v+e(w+D)−(u+ew)=v′−u′, so the two components exchange a single rim hook of length ∣v′−u′∣, nonzero since i≠j modulo e. If v′−u′>0, component b unwraps and a wraps a hook with foot residue i+1 modulo e; otherwise a unwraps and b wraps one with foot residue j+1. In both cases the hook feet have equal residues, and the hook pair is uniquely determined because distinct components change, so the J coefficient of [F1] is a single signed valuation, a nonzero integer with no cancellation. Hence λ and μ are Jantzen-connected by one edge; this supplies the detail abbreviated in the Lyle–Mathas tight lemma.

3.1F1F2F3step 1.1step 2.1∎

Termination and conclusion. The generic difference of the unique hook contribution is nonzero by [F1], and its specialization vanishes because the charged feet agree, so its positive integer valuation cannot disappear under reduction modulo char⁡F. The fixed-core lemma [F3] permits replacing arbitrary lifts by the chosen lifts before and after each switch, and strict descent lowers the nonnegative core size by at least e, so the process terminates at a minimum core; all minimum cores have equal size and are connected by γ=2 switches, whose rank-n lifts are connected by the same explicit construction of step 2.1. Together with the fixed-component-size lifts of [F3], every member of the content class is Jantzen-connected to every other, and step 1.1 gives the converse. The empty rank has only one multipartition and is immediate; no affine-center or primitive-block theorem has entered the proof.

Remarks

The theorem is the exact content classification of the Jantzen classes: equal charged node-residue content is equivalent to connectivity by the integer rim-hook coefficient matrix, uniformly in the characteristic and the level. The construction of the lifts and the termination argument are finite and explicit. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

30 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