Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Restricted repairs of annular square complements
five_adic_comparison: A complete author-recorded five-adic comparison with upper limit 99/20, whose coverage and real-prefix proofs do not improve the 9/2 target.
proof_sketch: Lifted-root repair routes, a seven-adic skeleton counterexample family, and author-recorded comparisons with no improved square complement.
seven_adic_repair_failure: A coverage counterexample and excessive intermediate prefix for one specified seven-adic repair, with both failures author-recorded.
triadic_essential_bridge_interval: An author-recorded positive-density interval of essential bridge points in the specified ternary set, with deletion and replacement limits explicit.
triadic_one_step_barrier: A discrete 9/2 barrier for repairs retaining the ternary outer skeleton and its old root class, with an author-recorded quantitative escape bound.
This lead's notes that cite no source are author-recorded research, not claims.
Target and standing
The target is a set such that every sufficiently large integer is , with and , and
This is a particular improvement target within Problem 33, not a proposed value of the infimum over all square complements. Real cutoffs and positive residuals are used throughout.
The baseline is L3: its specified set represents every positive integer and has lower and upper counting limits and . Its proof supplies the root transitions, coverage and uniform cutoff estimates. L3 is author-recorded at tier 0. Its construction and proof are not repeated here.
The calculations below are also author-recorded, without independent acceptance. The widened-annulus comparison is a completed calculation for one specified family. The one-step mass implication is conditional; the smaller-radius repair and seven-adic route remain incomplete, not refuted. In particular, none of these deductions proves optimality of L3 among all square complements, or among all multiscale repairs. The baseline statement and proof were read; no external theorem is consumed and no new literature or priority assessment is made here. The linked problem page records the separate public-source assessment.
Further author-recorded obstructions and comparisons
The lifted-root proof sketch retains an explicit infinite family missed by the seven-adic skeleton, including the witness 14851 and the fixed-center monotonicity argument. Patching this family alone costs only an added set with O(log X) points up to X, so it supplies no positive asymptotic lower bound on general repairs. The sketch also records the dated source context and the remaining construction obligations.
The following notes have complete author-recorded arguments in their stated scopes. None has independent acceptance or supplies a square complement below 9/2.
- The discrete ternary barrier proves a 9/2 limsup obstruction when the outer skeleton is retained and the displayed forced targets use the old root class. It includes all five eligible roots, disjoint contributions across scales, and a quantitative escape condition. It does not constrain every square complement or every repair policy.
- The essential bridge interval identifies q/10000+O(1) bridge points per sufficiently large ternary scale that cannot be deleted without replacement; each supports at least q/72000-o(q) uniquely represented targets. It makes no optimality or universal-essentiality claim.
- The specified seven-adic repair misses 26522 and has an intermediate-prefix lower bound 195/(28*sqrt(2))>9/2. These are separate coverage and counting failures of that exact set.
- The five-adic comparison supplies full coverage and uniform real-prefix counts with upper limit 99/20, above the target.
The discrete ternary result supplies a separate obstruction for its explicit old-root policy; it does not retroactively prove every unestablished passage in the conditional radial model below. The bare seven-adic skeleton's omission family likewise leaves the broader replacement route incomplete. The existing annular, parity and conditional calculations retain their original scope.
Widening a fixed annular family
Use L3's notation , with repeated classes identified. For a fixed real , consider exactly
The changed bridge follows from the same root transition used in L3. Write , where is the old bounded root. If the next bounded root is , its residual is positive because . Thus a transition to a nonpositive residual can only use . Put
The positive residual is caught by the nested outer annuli when . Otherwise , while the nonpositive new residual gives . Its congruence is the bridge congruence modulo from L3. This is precisely the bridge in (1) at scale . L3's positive-residual descent and first-crossing argument therefore apply with these changed endpoints; a finite initial segment can in any case be adjoined without changing the limits below.
On a cycle , the successive normalized radial intervals and densities are
Endpoints change only terms. Smaller annuli end before the cycle and larger ones start after it, apart from shared endpoints. Thus its count is , where
The preceding cycles contribute at . Consequently, with , the normalized leading prefix is
For fixed , the error in is uniform within the cycle: there are only three periodic interval counts. After division by the error tends to zero. Each piece of has the form with , whose interior critical point, if present, is a minimum. Hence the only candidates for its maximum are
The two cycle boundaries have the common value . Since
no fixed in (1) improves the baseline upper limit. This rules out improvement by this widened family, including its shortened bridge.
For the corresponding outer-only skeleton with fixed , the cycle count is . Its boundary count through is , giving the subsequential ratio . Adding repairs cannot lower that ratio. This conclusion concerns this outer skeleton; it does not constrain arbitrary changes of residue sets or scale rules.
Lowering the radius: an incomplete split calculation
Put . To state the local branch calculation concretely, take ; this is not a verified parameter range for a complete repaired construction. At scales , let and . The newly possible nonpositive branch at the next root has
The alternative root gives residual . In the relaxed continuous parameter domain, allowing the limiting endpoint , the old residual ranges over , and the alternative ranges over
Indeed, for fixed the latter interval is ; their union as has the endpoints in (6). This interval calculation does not establish discrete realizability of every parameter pair.
Modulo , keeping the old residual uses two possible lift subclasses , whereas the alternative from uses the common subclass . Here is the target center, and the next root is assumed to satisfy . These congruences follow by subtracting the displayed squares and using and .
A proposed monotone split assigns a proportion of the radial parameter to the common alternative repair. Its proposed complete-cycle and prefix expressions are
The intended extremes are , retaining the old residuals, and , using the common alternative. A complete definition of the intermediate split sets, a derivation of both counts in (7), and the admissible range for a whole construction are missing. Accordingly (7) is a proposed ledger, not a proved bound on every smaller-radius repair. If that ledger were established for a specified split, its second formula would exclude an improvement by that split, despite the cycle saving.
There is a narrower completed obstruction to a simple deferral argument. In (5),
Every positive residual is at most . Thus this branch cannot be repaired by adding only residuals above . Merely shortening the high bridge without handling (5) omits a root case. This does not rule out repairs below the cutoff or a different multiscale construction.
Two parity diagnostics
If the parity of the bounded root is flipped between and , the possible new positions in are
With old residual , the first two give positive new residuals, since their squared-root increments are at most . For the last position, a nonpositive residual implies
Because , the old residual has the correct center modulo but the parity opposite to that at the new scale. The direct repair which retains this old residual therefore uses the opposite-parity bridge , wider than L3's bridge. This is a cost diagnostic for that direct repair. Positivity alone does not establish global coverage with changing parity, whose descending congruences need their own consistent rule. No obstruction to arbitrary parity states is proved.
Dropping parity gives a different restricted profile. Take the outer skeleton at each scale . Its cycle count is and its boundary ratio is . The specified one-step repair retains for each on the old-scale interval . Indeed, with least old root , the hard position is . If the alternative from is not already caught, its residual and the old residual both lie in and occupy the two nontrivial lift classes in some order. Retaining the specified class handles this case. At the next scale it doubles the density on . For this profile the two densities are on and on . The resulting cycle count is ; earlier cycles contribute . At the normalized prefix is therefore
Thus this skeleton with this doubled-density repair cannot improve the target. Equation (8) does not prohibit other parity-free complements.
A conditional one-step mass bound
Retain the original parity convention and radius . In L3's hard transition, the new root is , its residual is nonpositive, and both old-parity alternatives exceed . Set and . Their exact inequalities imply
The upper endpoint is a limiting endpoint at large scales. The four old root representatives yield
In the first two rows the subclasses occur in opposite orders. These congruences use , , and . In particular, the first two normalized residuals exceed , and the third lies in .
Restrict the repair model as follows. For fix a bounded Jordan-measurable radial set , independent of and common to all three centers. At transition , select points with and for . Only the four residuals in (10) may cover the transition. This deliberately excludes the root , even when its residual is positive; the four rows are not an exhaustive list of same-transition options. The model also excludes digit-dependent radial sets and routing through later transitions.
If and , the four radial values in (10) tend to . Assume the limiting coverage requirement
An inclusion outside a set of length zero would also suffice. Translation invariance and subadditivity of length immediately give
For these fixed Jordan sets, counting each residue grid is a Riemann-sum calculation with mesh . For sufficiently large the fifteen residue classes are distinct, so the selected set at this transition has
points. For interval pieces the error is . The choice and all other satisfies (11) and attains the leading mass ; this is the bridge already used by L3.
The implication from (11) to (13) is complete. Its proposed application to every discrete one-step repair is not: no proof is supplied that each is realized by discrete hard transitions with , or that discrete coverage forces (11), or an adequate version outside a null set, for the claimed class of Jordan-measurable repairs. Those are the missing limiting-realizability and discrete-to-radial justifications. The fixed-set Riemann sum does not supply either one.
Even with (11), this bounds the selected mass at one transition, not the upper counting limit of a global union. Moving mass changes prefixes, and any sharing between scales needs separate accounting. Thus (13) is neither a universal repair-cost theorem nor a proof that every one-step repair has limsup at least .
Seven-adic skeleton and missing recycling lemma
The elementary center identity is
Indeed the three translates are , and . They cover all seven classes. Hence for each target one can choose a center so that is a nonzero square modulo . This is only a modular interface.
To make the counting comparison precise, take the parity-preserving formal skeleton
This is a specified candidate skeleton, not an asserted square complement. At large scales its cycle count is . Summing the geometric series through scale gives
Repeated classes at affect only the bounded initial contribution. No coverage conclusion follows from (16).
For the chosen , elementary lifting of a nonzero square root modulo works because is invertible modulo . Fixing its parity gives a bounded root modulo at . At the next scale, reduction modulo places the bounded root in
Writing , , and , the exact state update is
The skeleton catches the new residual when ; its congruence is already fixed by the chosen center and root. The outstanding interface is a rule that handles these seven lift positions over two or more scales, together with a proof that every sufficiently large target reaches a positive retained residual. It must also specify any added repair set and prove the all-prefix target
The difference is only the nominal boundary margin suggested by (16); it does not bound repair cost or control intervening cutoffs. No multiscale routing rule, termination proof, or uniform repair prefix estimate is supplied. The seven positions alone do not prove that every possible one-step bridge is inadequate. Establishing the recycling and counting lemma, or finding a precise obstruction to a specified rule, remains the substantive missing mathematics.