Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Frobenius cycle type needs good reduction

Statement refuted

Factor multiplicities from an arbitrary integral generator need not encode Frobenius cycles. For F(T)=T25 at p=2, Fˉ=(T+1)2, yet Q(5) is unramified and inert at 2, with Frobenius a transposition. The integral generator ω=(1+5)/2 has minimal polynomial G(T)=T2T1, whose reduction T2+T+1 is irreducible over F2.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

Frobenius cycle type and prime splitting: Let FZ[T] be monic separable with splitting field L, and let p be a rational prime not dividing Disc(F). Then p is unramified in L and FˉFp[T] is squarefree. The degrees of its monic irreducible factors, with each distinct factor counted once, are exactly the cycle lengths of arithmetic Frobenius on the roots of F.

[F2]

Dedekind--Kummer prime factorisation: Let L/K be a finite extension of number fields, let αOL with OL=OK[α], and let FOK[X] be its monic minimal polynomial over K. Let p be a nonzero prime ideal of OK, not dividing the index of this power order (the index is 1 under the stated monogeneity hypothesis). If Fˉ=igˉiei with distinct monic irreducibles over OK/p, then pOL=iPiei,Pi=(p,gi(α)),f(Pi/p)=deggˉi, Here giOK[X] are any monic lifts of gˉi, and the last f denotes the residue degree from def-prime-above-and-residue-degree.

[F3]

Ramification is detected by the number-field discriminant: A rational prime p ramifies in K/Q if and only if pdK.

[F4]

Integers in a quadratic field: For squarefree d1, OQ(d)=Z[(1+d)/2] if d1(mod4), and Z[d] otherwise.

[F5]

Power-basis and polynomial discriminants: Let K=Q(α). If f is the degree-n monic minimal polynomial of α, then disc(1,α,,αn1)=(1)n(n1)/2NK/Q(f(α))=disc(f).

Counterexample

1.1

The quadratic integral-basis theorem gives OL=Z[ω]. Direct substitution gives G(omega)=0, and its discriminant 5 is not a rational square, so it is the minimal polynomial. The power-basis discriminant formula gives dL=Disc(G)=5. Therefore 2 is unramified by the field-discriminant criterion.

F3F4F5
2.1

Modulo 2, G is T2+T+1, taking value 1 at both 0 and 1. It is irreducible. Dedekind-Kummer applies to the full ring OL=Z[ω] and gives a single prime of e=1 and f=2. Alternatively the good-reduction cycle theorem for G gives the transposition Frobenius.

F1F2step 1.1
3.1

For the other generator, 5=2ω1, so Z[5] has index 2 in OL, as the change-of-basis matrix has determinant 2. Its polynomial discriminant is 20 and its reduction is (T+1)2. The two characteristic-zero roots reduce to the same root, so this reduction is not a bijection of root sets. It cannot supply the cycle comparison; in particular reading its multiplicity as ramification would contradict e=1. The full-ring hypothesis of the cited Dedekind-Kummer statement fails for this generator.

F1F2step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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