Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

F3(μ5)F3(μ7) is larger than F3 although five and seven are coprime

Statement refuted

That the rational intersection theorem Q(μm)Q(μn)=Q(μgcd(m,n)) holds over every base field: that for every field K and all positive integers m,n with the characteristic of K dividing neither,

K(μm)K(μn)=K(μgcd(m,n)).

The witness below takes K=F3, m=5 and n=7, and realizes both splitting fields inside one fixed field Ω of order 312. Since gcd(5,7)=1, the right-hand side is K(μ1)=F3, while the intersection on the left is the common subfield F9Ω.

Facts & Assumptions

Given: The base field K=F3 and a field Ω of order 312, which exists by For every prime p and n1, a field with pn elements exists. The two cyclotomic splitting fields will be identified with their base-field-isomorphic copies inside Ω.

[L1]

For gcd(n,q)=1, the image of Gal(Fq(μn)/Fq) in (Z/n)× is generated by [q], so the degree of Fq(μn)/Fq is the order of [q] modulo n (For gcd(n,q)=1 the image of Gal(Fq(μn)/Fq) in (Z/n)× is generated by [q]).

[L2]

The intermediate fields of FqN/Fq are exactly the Fqd for the positive divisors d of N, one for each divisor, with FqdFqe exactly when de (The intermediate fields of Fqn/Fq are the Fqd, one for each positive divisor d of n).

[L3]

Over Q one has Q(μm)Q(μn)=Q(μgcd(m,n)) (Q(μm)Q(μn)=Q(μgcd(m,n))).

[L4]

K(μr) is the splitting field of tr1 over K (The cyclotomic extension K(μn) as a splitting field of tn1).

[L5]

Finite fields of the same order are isomorphic by an isomorphism fixing their common prime field (Finite fields of the same order are isomorphic).

Counterexample

technique · direct
1.1

In (Z/5)×, the class [3] has order 4, since 34=811(mod5) and no smaller positive power of 3 is congruent to 1 modulo 5. So [L1] gives [F3(μ5):F3]=4, hence this splitting field has order 34 and [L5] lets us identify it over F3 with the unique subfield F34 of Ω.

L1L2L4L5algebra
1.2

In (Z/7)×, the powers of [3] are [3],[2],[6],[4],[5],[1], so [3] has order 6. Thus [L1] gives [F3(μ7):F3]=6, hence this splitting field has order 36 and [L5] lets us identify it over F3 with the unique subfield F36 of Ω.

L1L2L4L5algebra
2.1

Under the fixed identifications of steps 1.1 and 1.2, both F34 and F36 are subfields of Ω=F312 by [L2], since 412 and 612. Their intersection is then an intermediate field of Ω/F3, so by [L2] it is F3d for some divisor d of 12. Because the intersection lies in both fields, [L2] gives d4 and d6, hence d2; and since F32 lies in both fields, [L2] gives 2d. Therefore d=2 and F3(μ5)F3(μ7)=F32=F9.

step 1.1step 1.2L2
3.1

Since gcd(5,7)=1, the right-hand side of the refuted identity is K(μ1), which is just K=F3 because t1 already splits over K. So the claimed equality would read F9=F3, which is false.

step 2.1L4algebra
4.1

The refuted statement therefore fails over the base field F3, even though the rational theorem [L3] is true.

step 3.1L3

Remarks

  • Why the rational hypothesis matters. Over finite fields the intersection is controlled by the gcd of the extension degrees, not by the gcd of the orders of the roots of unity.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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