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 at p=2, , yet is unramified and inert at 2, with Frobenius a transposition. The integral generator has minimal polynomial , whose reduction is irreducible over .
Facts & Assumptions
Given: The data and hypotheses of the statement.
Frobenius cycle type and prime splitting: Let be monic separable with splitting field L, and let p be a rational prime not dividing . Then p is unramified in L and 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.
Dedekind--Kummer prime factorisation: Let be a finite extension of number fields, let with , and let be its monic minimal polynomial over . Let be a nonzero prime ideal of , not dividing the index of this power order (the index is under the stated monogeneity hypothesis). If with distinct monic irreducibles over , then Here are any monic lifts of , and the last denotes the residue degree from def-prime-above-and-residue-degree.
Ramification is detected by the number-field discriminant: A rational prime ramifies in if and only if .
Integers in a quadratic field: For squarefree , if , and otherwise.
Power-basis and polynomial discriminants: Let . If is the degree- monic minimal polynomial of , then
Counterexample
The quadratic integral-basis theorem gives . 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 . Therefore 2 is unramified by the field-discriminant criterion.
Modulo 2, G is , taking value 1 at both 0 and 1. It is irreducible. Dedekind-Kummer applies to the full ring and gives a single prime of e=1 and f=2. Alternatively the good-reduction cycle theorem for G gives the transposition Frobenius.
For the other generator, , so has index 2 in , as the change-of-basis matrix has determinant 2. Its polynomial discriminant is 20 and its reduction is . 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.
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
- §9.2.1, Q(sqrt5) example, pp.102–103; Milne Theorem 8.23 qualification (standard reference, not scraped)