Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
A same-conductor squaring identity with a nontriviality certificate
Standing and exact hypotheses
Suppose and the distinct roots in all have odd order, , and
Unlike the conductor-disjoint determinant construction, this lemma works inside one conductor. It gives a nonzero integer relation on pair products and squares when . It does not automatically give a ternary relation: multiplicative collisions can increase coefficients. Nor does it control the actual colors of the resulting roots.
These are precisely the surviving obligations. No general-height extension, ternary-subrelation theorem, or global coloring conclusion is asserted.
1. The squaring identity
Choose one odd containing the conductors in (1). Squaring is a cyclotomic Galois automorphism of , so
Squaring (1) itself gives . Subtract the preceding equation and divide by two to obtain
The second sum is over unordered pairs, counted once. Before identifying equal root products, every listed term has coefficient or . Squares occur only for negative leaves.
To distinguish that indexed expression from the actual relation, work in the group ring , writing for its formal basis element at . Put
The last expression has integer coefficients by its explicit expansion in (2). Evaluation sends
to zero. Colliding pair products, squares, and must be collected in this group ring before discussing their coefficient height.
2. Nontriviality after all multiplicative collisions
Proposition. If , then in .
Multiply every root in (1) by , so . This multiplies (3) by the invertible group-ring element ; it does not change formal nontriviality or the number of distinct leaves. Suppose for contradiction that . Then
For each character of , write . Equation (4) gives
Since is odd, permutes the finite character group. Every is therefore a periodic point of .
Every complex periodic point of lies in . For a direct proof, choose with . Induction gives
If , the two roots of show that is either or . Hence is a root of unity, so .
Writing , character orthogonality now gives
contrary to the hypothesis. This proves the proposition. In particular it applies to the nineteen-leaf coefficient-two circuits already constructed in the prime grids, without rerunning their certificates.
3. What would make this an actual-color flattening step
If the collected nonzero coefficients of all lie in and their root support has one actual color, (3) is the required monochromatic ternary relation. A stronger sufficient collision condition is that the indexed roots in (2), together with , are all distinct; then the coefficients are automatically ternary.
Neither condition has been established for the root supports that a finite coloring can supply. Refining a color by the pair controls square colors, but not the colors of pair products. Nontriviality from Section 2 prevents total formal cancellation; it does not prevent surviving coefficients of magnitude greater than one.
Thus (2) is a proved same-conductor algebraic alternative, with an exact nontriviality certificate, not a proof of height descent or unbounded coloring. The identity and character argument received independent internal checks. No computation or additional literature result was used.