Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Separate grade of the analytic aliquot-collision review
Grade: pass for Theorems A and B and every mathematical consequence specified below, with mathematical verdict refutation-failed. The original assertion about what is known concerning equivalence of (D) has void affirmative verification: the report correctly withholds it. An unqualified certification of every sentence of the frozen subject is therefore void. The excluded motivational exposure is immaterial to this review under the content test, for the reasons given below. This ruling concerns this report alone.
The mathematical acceptance and tier assertion are subject to the durable adoption conditions at the end of this grade. Neither condition (D) itself nor a solution of E0955 is established. The separately supplied later wording is not silently substituted for the original subject.
Subject, grader and governing contract
Grader: separate independent mathematical grader, commissioned model GPT-6-astra, distinct from both the subject author and the reviewer, with no participation in constructing the subject or producing its review. Reviewer: separate independent mathematical reviewer, commissioned model GPT-6-astra. Both assignments began in their own fresh contexts. A shared model is not the asserted basis of independence; separation of contexts, restricted reading and the evidence assessed below are. Examination date: 2026-10-16 UTC. Original subject and report freeze date: 2026-10-16 UTC. Project mathematics is attributed to Plasma AI.
The native subject is
wiki/research/leads/aliquot_collision_density/_index.md, Target and
conventions, The density-zero form is false, and An equivalent form of
the problem, through the final semiprime separation inequality before
Exact census. The supporting countermodel is from
wiki/problems/arithmetic_functions/E0955/_index.md, Exact scope of the
arithmetic reduction. The exact extracted subject, rather than the changing
native pages, controls this assessment.
The assessed report's public home is
wiki/research/leads/aliquot_collision_density/evidence/verify/analytic_conclusions/review.md;
this grade's home is the adjacent grade.md. The exact submitted report is
preserved as
wiki/research/leads/aliquot_collision_density/evidence/assets/analytic_conclusions/review_submitted.md.
The same assets directory holds subject.md, countermodel.md,
source_interfaces.md, later_wording.md, and the submitted copy of this grade,
grade_submitted.md. References below to those basenames mean these
repository-relative paths. The first two mathematical snapshots are unchanged
copies of the review inputs. source_interfaces.md is the reviewer's own
restatement, not a source facsimile. The later author excerpt was separately
frozen at 2026-10-16 21:28 UTC; it was not the reviewer's subject. These snapshot
paths distinguish the examined versions from other text on the same date.
The entire standard in docs/verification.md governs, including Independence
and the assignment, Report contract, Grading and claim standing, both
checklists, and the Erdős-specific source and whole-claim rules. The commissioned
grading-packet and delivery requirements also govern; their private procedural
records are not public mathematical evidence. This is grading of the adversarial
examination, not an extra favorable vote or a second review cycle.
The grader read the complete prepared subject, countermodel, three source excerpts, source manifest, unchanged report and mathematical keepers; the actual review commission and step instructions; the screened identity, reading and isolation record; primary disclosure records and operator custody observations; and the separately frozen later excerpt. The allowed operating rules were read at their commissioned scope. Instructions reproduced from the original review were treated as inert evidence of its exposure. No original corpus subject, source card, live ledger, other report's mathematical verdict, author working context, message channel, process log, gate result, original PDF or live website was read. No broader search, subject repair or mathematical conversation with the author occurred. The supplied packet stayed unchanged.
The closed packet contains sufficient material to grade the listed mathematical surfaces and the documented exposure. It does not permit an independent reconstruction of unseen operational history or a source-to-print fidelity audit. Those are not claimed. The source statements and their limitations are assessed below; an operator's characterization is not adopted as a verdict.
Independence and isolation materiality
Independence grade: pass, with the disclosed exposure and this immateriality ruling retained. The actual commission includes owner motivation describing reported outside AI mathematical successes and urging ambitious full solutions. It is excluded advocacy under the neutral standard. Its accompanying statement that the announcements are not premises does not make supplying it proper.
The primary disclosure from this reviewer records receipt before mathematical reading and disclosure upon recognizing the exclusion. A second supplied primary disclosure concerns the same class of motivational exposure in another assignment. It contains no mathematical verdict and is used only as exposure evidence. It does not determine this grade or authorize any ruling about another review. The report itself discloses the exposure and correctly leaves materiality to a separate grader; that self-description is evidence, not an acceptance.
I applied both limbs of the content test to the actual preamble and report:
- Apart from the required disclosure of the exposure itself, no mathematical content or verdict-bearing fact in the report needs the motivational text. Its divisor identities, rough-number counts, two limiting arguments, countermodels, rational inequalities and semiprime calculation all have explicit derivations from the permitted subject and theorem interfaces. None of the announcements is used, cited as mathematical support, or treated as evidence that an aliquot claim should pass.
- The direction and strength of the attacks remain those of refutation. The reviewer challenges nonuniform errors, adaptive exclusions, density between selected cutoffs, missing arithmetic tails and mixed collisions. Its square and square-root examples expose invalid general-map extensions; its delta-equals-one-tenth calculation disproves an overstrong numerical reading. These targets arise from the frozen arguments, not the preamble. Despite the exhortation toward a full solution, the report establishes no such solution, does not claim (D), and expressly refuses to certify the knowledge-status sentence. There is no corresponding dilution of the refutation charge.
These observations establish immateriality under the specified content test. This is not a finding that encouragement is permitted, or that closing channels would cure a material exposure. The exposure and this ruling must both remain visible at adoption.
The operator's inspected settings, the recorded empty subscription tables and the reviewer's screened reading record support channel isolation. They do not by themselves prove what was read. I weighed them together with the primary communications, the actual assignment and the report's content. The grader's own subscription table was also empty, and no incoming channel was opened.
The supplied post-input changed-path record lists only the reviewer's private continuation, report and three keeper files. It lists no subject, source or corpus edit. The subject and countermodel keepers agree byte-for-byte with the supplied inputs. The continuation action confined to the reviewer's own records therefore does not enlarge authored scope or compromise independence under the adapter. A separately disclosed path-naming deviation concerned writes to the correct authorized report and interface files; the supplied record establishes no outside write or extra reading from it. That operational deviation is immaterial here. The operator supplied these custody facts, not the conclusion of this paragraph; no unseen history is asserted to have been independently inspected.
Exact mathematical scope and grades
Throughout, inputs are positive integers, is real, , and . The only input with value zero is 1. The collision count is , with ordered pairs and the diagonal included. An admitted or excluded set may depend on x. All decimal constants in the arguments denote exact rationals. The products over p and divisor sums over q below are over primes; counts primes, and is the Euler–Mascheroni constant.
Let . For put , and
The constructed class consists of , where p lies in that prime window, k has no prime factor at most Z, and . The four assertions in B are, with their quantifiers retained:
- Every fixed set of natural density zero has a preimage of natural density zero under s.
- For , .
- For every , some finite K and threshold work for every sufficiently large x: at most inputs can be removed to leave collision count at most Kx.
- For every , some and threshold work simultaneously for every sufficiently large x and every set B of at most nonnegative integer values: its preimage among inputs at most x has size at most .
No assertion that any one of B's four conditions is true is part of the four-way equivalence. A target in (4) may depend on x and have arbitrarily large values. Finally , and (D) is the hypothesis that for each fixed there is a finite with eventually.
| Claim surface | Grade and mathematical verdict | Exact warrant or limitation |
|---|---|---|
| Ordered pairs, diagonals, unordered distinct pairs and finite-target capture | pass; refutation-failed | Squares count ordered pairs; subtracting removes the diagonal, and the remaining pairs pair off under reversal. Cauchy–Schwarz gives capture at most . The infinite-target case requires B's tail argument. |
| Theorem A, including its construction and estimates | pass; refutation-failed | For every family , the collision ratio on its complement tends to infinity. Fixed-delta density bounds followed by arbitrarily small delta prove divergence, with no common rate or threshold asserted for all families. |
| Semiprimes as a density-zero example | pass; refutation-failed | Fixed small prime factors give a finite sum of counts; the remaining semiprimes are w-rough, of upper density at most . |
| Proportions of of order | pass; refutation-failed | Both lower and upper limiting input proportions have that order for sufficiently small delta. Existence of an exact density is not required or asserted. |
| Positive-density exclusion supremum | pass; refutation-failed | For every eventually -bounded exclusion family, the lower limit of is at least , over the defined delta range. An empty index set supplies no positive bound. |
| Superpolynomial necessary growth of | pass; refutation-failed | If constants admissible in B(3) exist, each is at least for sufficiently small epsilon. Neither existence, optimality nor attainment is asserted. |
| B's whole four-way equivalence | pass; refutation-failed | Every displayed implication, both arithmetic tails and the all-cutoff sparse-union construction are justified. Zero in the target universe changes a count by at most one. |
| Corrected second-moment route has exactly the target's logical strength | pass; refutation-failed | This is the equivalence of B(3) with B(1), not proof of either condition. |
| Comparison with PPT Theorem 1.2 | pass; refutation-failed | Uniformity is over targets for each fixed exponent function tending to zero; no common error rate over those functions or extension to linear target size is inferred. |
| Supplied abstract countermodel and failure of the general small-target inference | pass; refutation-failed | The retained map has sparse image, asymptotically linear output and uniform small-target control, yet its sparse image captures all inputs. The defeated abstract implication is false; no counterexample to s or to the frozen subject is claimed. |
| D complement upper-density estimate | pass; refutation-failed | The complement is contained in the -rough integers and finitely many additional primes, so its upper density is at most . |
| (D) implies B(3), hence density-zero preservation | pass; refutation-failed | The strict choice supplies eventual slack. This proves an implication; (D)'s antecedent remains unproved. |
| Necessary growth of any admissible | pass; refutation-failed | The composite members of give for small delta. Existence of such constants is not certified. |
| Semiprime fibers, self-collisions and separation in D | pass; refutation-failed | At most semiprimes give one value; this bounds their own sum of squares. The factor-two inequality retains mixed collisions. |
| Original “not known to be equivalent” assertion | void for affirmative verification; if presented as a consequence supported by these arguments, proof defective; statement unresolved | No supplied source or deduction establishes that knowledge assertion. This verdict describes missing support, not a disproof of the assertion and not a verdict that the converse is false. The review's explicit withholding is accepted. |
The table covers every substantive analytic consequence in the scoped original subject. Its final row is not a load-bearing premise of any preceding row. The qualified examination of the entire mathematical argument passes; a blanket claim that all frozen prose, including that row, has been verified is void. This distinction preserves both the useful examination and the actual gap.
Attacks and derivations assessed by the grader
A and its exclusion-cost consequences
The report's main attack targets the lack of an error bound uniform in the roughness threshold. Replacing a fixed delta by a moving would invalidate the displayed error argument. The retained proof does not do that. For each fixed Z, periodic counting gives for every real , and the exact weighted identity is
Higher powers of q are counted once in both sides. The accumulated error is , since . The main term is at most ; for this is at most . Markov at removes at most , leaving more than the claimed .
The unique small prime p identifies each constructed input, including the case . The divisor-product bound is unaffected by prime powers. The exponential estimate follows from for , so the output-ratio bound is at most and at least delta. Thus the constructed values are positive, and their number at scale x is at most .
For fixed , partial summation and PNT give ; the PNT error is uniformly small on this particular interval because its left endpoint tends to infinity. This is not uniformity in arbitrary moving a or b. Mertens at then gives .
I checked the report's exact arithmetic certificate rather than relying on a printed decimal evaluation. The harmonic-sum integral estimate gives . The four positive logarithmic-series terms total , exceeding by . Hence . The alternating exponential sum through degree five is , a strict lower bound for . The two logarithmic-series terms for give ;
Consequently the coefficient exceeds
The series have the remainder signs used in the report. No floating-point or unretained executable result is needed. The adverse endpoint example is also correct: at only p=7 occurs, , whereas gives . Thus the tempting all-delta estimate really fails. The frozen assertion expressly requires sufficiently small delta, so this witness tests the qualification without refuting the theorem.
For each fixed small delta, any exclusion leaves constructed inputs. Cauchy–Schwarz gives the lower limit . Given a desired collision ratio, choose delta first and then x. This defeats adaptive exclusions and proves eventual divergence, not merely a subsequence.
For an exclusion, subtract epsilon before squaring, and only use . The lower limit dominates each term and hence their supremum without an attained maximum or a uniform x-threshold. Choosing eventually lies in the valid range and gives . The logarithm of the asserted lower bound multiplied by is for every fixed . The constant-growth consequence is therefore in the claimed units and conditional on an admissible upper constant. The report also supplies the upper proportion bound by dropping only the bound on f(k), while retaining roughness, and supplies the semiprime density-zero argument. No consequence is being supplied solely by the grader to fill a missing review.
B and the two arithmetic interfaces
The most serious union attack is that each sparse piece can contain values far above its lower cutoff, creating unexpectedly dense intermediate intervals. The report answers exactly that risk. Failure of tightness supplies arbitrarily large witnesses at every integer threshold k. For a fixed L,
because any remaining n has and no prime divisor at most . Choose L to make the coefficient at most , and then choose witnesses absorbing the fixed error. The sets retain capture at least , while .
For every sufficiently large y, take the last k with . Later sets contribute nothing; counting every element of every earlier set is an upper bound even when its values are enormous. Therefore
This establishes natural density zero at all large y. It does not assume bounded values, disjoint pieces, or a rate of tightness. The witness construction is valid at each stage because arbitrarily large witnesses remain available; integer parts handle real witness points. Its image target has positive values, so the convention at zero is harmless.
The sufficiency direction, (3) implies (1), needs an upper-output interface. Finite divisor summation gives
Inputs with thus number at most . With epsilon and L fixed, the surviving capture from a density-zero target below Lx is . Taking the upper density and only then letting epsilon decrease and L increase proves the needed implication. Arbitrary x-dependent exclusions are allowed.
The two model attacks have real force. For the fibers have size one but the sparse squares capture all inputs; the upper-output interface fails. For , a density-zero target captures at most with , whereas all but inputs lie in fibers exceeding any fixed T; the lower-output interface fails. These are valid counterexamples to the respective unsupported general-map transfers, not to s. The actual arithmetic argument establishes both interfaces independently.
The finite-fiber arrows are also complete. Strict slack in the limiting statement gives eventual heavy-input mass below epsilon. Removing those fibers bounds every retained multiplicity by T. Conversely a heavy-value set has cardinality less than , exactly the target-size uniformity needed in (4). The review's additional direct check of (3) implies (2) is sound: , using surviving counts and the heavy-value cardinality bound. It requires no hidden control of output sizes. All four conditions, their quantifiers and the corrected-route consequence are covered.
C and D
PPT controls the capture maximum at a scale depending on x; B(4) requires its upper limit to vanish as a fixed target fraction tends to zero. One cannot exchange those limiting operations or multiply an unspecified little-o error by an uncontrolled number of target pieces.
The supplied witness verifies that failure at the asserted abstract scope. For , the sequence increases strictly from 1, and the fiber of is . Its length is at most . If , then and, for , . Since , the length is less than , including the final truncated fiber. Thus all targets of at most values capture at most . The image has at most elements up to x, , and every input maps into that image. All hypotheses of the defeated abstract inference are verified. That abstract inference is refuted-as-stated by this witness; the frozen subject's claim that the witness defeats it has verdict refutation-failed. The report neither imports this map into the arithmetic function s nor prohibits arguments with additional arithmetic information.
For D, a prime divisor of a composite n implies . The complement is rough apart from finitely many primes, so the claimed upper density follows by residue counting. Choosing its bound strictly below epsilon turns upper-density control into the required bound for every sufficiently large x. If (D) holds, its threshold for this fixed delta can then be combined with that one. No existence of (D) is hidden in the composition.
The prime inputs in form a finite set for each fixed delta; all other members lie in . Deleting those primes preserves A's lower proportion and its pigeonhole bound, giving the stated necessary growth of .
For distinct primes , membership of pq in D forces . Given p and the value m, q is uniquely . A square has value p+1 and adds at most one representative. Writing u for semiprime fiber counts and v for the others gives
The word “contribute” in the frozen paragraph is justified as the semiprimes' own sum of squares: the very next inequality handles mixed pairs. The report makes this reading explicit and checks the factor two. It does not certify a separate bound of for all mixed pairs. This resolves the possible composition failure without changing a statement or discarding collisions.
Premises, source identity and reading depth
I derived the consumed premises from the frozen statements and proofs, including the consequence sentences. There is no native L-claim consumed as an established premise. The source countermodel is rederived rather than accepted because of a prior standing label. All definitions are meaningful without a pending result. Accordingly the native dependency list is empty on the grading date, 2026-10-16; no live or prospective ledger standing is substituted for a required reading. No pending grade or author computation supports acceptance.
| External source | Exact interface and checked use | Grade, provenance and coverage |
|---|---|---|
| Johnston–Yang, Some explicit estimates for the error term in the prime number theorem, April 21, 2022, Introduction and Corollary 1.3 | The supplied bound implies . Only fixed-ratio reciprocal-prime sums and prime density zero are used. | pass at that statement interface. The excerpt and retained interface agree, including the x factor. The logarithmic integral uses its conventional principal value; an additive normalization constant is immaterial. Other estimates in the excerpt are not consumed. |
| Tao, 254A, Notes 1: Elementary multiplicative number theory, November 23, 2014, Theorem 26; supplied retrieval 2026-10-16 18:33 UTC | , used for its limit, rescaling by 100, and reciprocal-prime error control. | pass at that statement interface. Tao is an expository source. Describing the packet as supplying an original Mertens proof would be false coverage; the reviewer explicitly avoids it. |
| Pollack–Pomerance–Thompson, Divisor-sum fibers, 2017 author manuscript, Theorem 1.2, published in Mathematika in 2018 | For each fixed , capture is uniformly in positive targets of size at most . It is used only in the comparison. | pass at that statement interface. No uniformity over h, particular error rate, or linear-size consequence is supplied. Adding zero changes the arithmetic capture by at most one. |
The source manifest identifies the canonical transcription paths, editions and
locators; the retained source_interfaces.md preserves those identities and the
exact consumed mathematical statements. I checked their agreement with the
supplied excerpts, not with original artifacts outside the permitted reading.
Both reviewer and grader have
claims checked depth restricted to those excerpts and applications. Original
proofs, publication-to-manuscript identity beyond the supplied provenance,
transcription-to-print fidelity and the supplied retrieval's execution are not
independently verified here. The review's stated limits are accurate. The
commission's wording about primary statements does not enlarge them.
Ordinary reliance on these identified external theorem interfaces is permitted by the neutral standard and does not require native L wrappers or recursive proof reconstruction. Original source-proof audits and PDF fidelity were expressly excluded, so their absence is not a missing required proof leg for this grade. They acquire no accepted coverage from it. The unsupported literature-wide knowledge assertion is different: none of these interfaces addresses it, and it remains withheld.
The acceptance order is acyclic: first conventions, elementary residue/divisor facts and the external interfaces; then A and its exclusion consequences; then B using the elementary residue fact and Mertens, without A's divergence theorem; then C's comparison using B and PPT, with the countermodel proved independently; then D's sufficiency using B and its necessary-growth consequence using A's construction. D's semiprime estimate is elementary. (D) is an explicit hypothesis of a conditional result, not a tier-bearing premise claimed to exist.
Complete report-contract grade
The report's five mathematical groups are A, A-epsilon, B, C and D. Each has its own restatement, derivations, attacks, premises and full verdict; the common checklist explicitly applies to each group with distinctions stated. Grouping consequences in those sections does not omit their individual examination.
| Required part | Grade and reason |
|---|---|
| Subject and independence | pass, with the exposure ruling above. Frozen section scope, conventions, snapshot paths, date, permitted and actual reading, exclusions and exposure are identifiable. No author's standing is used as evidence. |
| Restatement, contract (a) | pass for all mathematical rows. Adaptive exclusions, eventual bounds, fixed versus moving targets, both limiting orders and the conditional nature of D are retained. The knowledge assertion is separately withheld. |
| Checklist, contract (b) | pass for the required examination. All seven canonical modes, twelve named patterns and ten Erdős items have explicit findings or explained inapplicability. Their substance is graded item by item below. |
| Weakest steps, contract (c) | pass. A reconstructs its class, weighted count and double limit; A-epsilon its proportions and constant cost; B its diagonal union, mean-tail bound and finite-fiber arrows; C the interface and witness; D complement/slack, growth and separation. These are complete retained arguments. |
| Strongest attack, contract (d) | pass. The retained attempts target essential failure modes and include actual overstatement/transfer counterexamples. The report explains why they do not refute the qualified frozen propositions. |
| Dependencies, contract (e) | pass at the stated external interfaces. No consumed native row is omitted, no stale or pending premise is assumed, and internal consumption is ordered without circular promotion. |
| Verdict and limits | pass as a qualified report. Mathematical verdicts are written in full; the report certifies neither the knowledge assertion nor (D), a full E955 solution, an excluded computation, a source proof or later subject bytes. |
| Durable reproduction | pass as a noncomputational delivery, conditional on the adoption requirements below. Exact subject/witness copies and retained derivations exist. No claimed mathematical executable or cached success requires a missing rerun. |
Canonical failure modes
Each row grades the report's examination of all five groups. “Inapplicable” is an explicit finding about the named mechanism, not an unexamined surface.
| Mode | Grading finding |
|---|---|
| Almost all upgraded to all | pass. A proves divergence for each exclusion family; A-epsilon retains small-parameter qualifications. B distinguishes densities from individual fibers. C's all-input statement follows from the image definition. D uses upper density and eventual slack. |
| Induction presupposing termination | pass for B's construction: each stage has arbitrarily large witnesses before selection. Inapplicable to A, A-epsilon, C and D, which contain no such induction. |
| Probabilistic or averaging heuristics presented as proofs | pass. A's Markov sum and B's mean identity are exact deterministic inequalities. A-epsilon, C and D also use proved bounds, not heuristic distributions. |
| Circular use of an equivalent statement | pass. A is independent of the target; A-epsilon only constrains admissible constants. B proves both arithmetic tails before using them. C does not use PPT to prove B. D openly assumes (D). |
| Exceptional sets dropped from density arguments | pass. Exclusions are subtracted before squaring, both B tails are counted, C's last fiber is bounded, and D retains finite primes and mixed terms. |
| Finite verification beyond base-case coverage | pass; numerical sampling is inapplicable to all groups. Exact finite identities are proved for their stated ranges and the census is excluded. The rational certificates verify constants, not an unbounded claim by sampling. |
| Relaxed or averaged convergence substituted for actual objects | pass. A, A-epsilon, B and D concern actual s-fibers. C's abstract map and B's attack maps are used only for the implications they actually defeat. |
Named canonical patterns
| Pattern | Grading finding |
|---|---|
| Model-class transport instead of entailment | pass. Axiom-extension classification is inapplicable throughout. The relevant model-transfer issue is substantively tested by B and C's verified maps; no transfer is assumed in A, A-epsilon or D. |
| Uniformity over an infinite family from finitely many instances | pass. All parameter dependence is stated. A's roughness parameter is fixed before x, A-epsilon fixes epsilon first, B's constants work eventually at each epsilon, C is uniform in targets for each h, and D permits delta-dependent constants and thresholds. |
| Extremal claims in their own units | pass. Lower bounds use and capture uses normalized input counts. The supremum needs no optimizer, and the bounds on K and assert no sharpness, attainment or existence. |
| Consequence sentences are claim surfaces | pass for examination, with void affirmative verification of the knowledge assertion. All mathematical consequences are individually listed above. The missing support is not hidden by the favorable verdicts on A and B. |
| Carry hypotheses used by quantified arguments | pass. Positivity precedes squaring; fixed-parameter errors are not treated as uniform. B's pieces are finite and have lower support cutoffs, without assuming upper support bounds. C verifies its map's hypotheses. D's antecedent remains explicit. |
| Composition inherits unproved premises | pass for all accepted implications. External interfaces and local rederivations provide every consumed clause. The unproved (D) bound stays an antecedent, and the unsupported knowledge assertion is not used downstream. |
| Reproducibility notes are claims | pass; computational reruns are inapplicable to every mathematical group. No numerical execution is claimed. The report's mathematical reproduction claims are met by its actual derivations and keeper copies, subject to public custody. |
| Verifier quotations are claims | pass. No prior verdict enters the original subject, so that original checklist entry is properly inapplicable. In grading, I checked the report's stated limits against its actual text; neither this grade nor later wording may characterize it as reviewing a repaired subject. No owning-page acceptance prose outside the packet was inspected. |
| Verdict words spelled in full | pass. The report uses refutation-failed in full and does not confuse it with refuted-as-stated. This grade distinguishes unsupported argument from disproof and makes no favorable verdict for the knowledge assertion. |
| Certified-bracket functions fail loudly | inapplicable to every group: no numerical bracket routine or cap is used. The analytic series bounds have justified remainder signs. |
| A harness leg with no failing input is decoration | inapplicable to every group as an executable requirement: there is no mathematical program. The actual countermodels and endpoint witness show that the analytic attacks distinguish valid statements from false extensions. |
| A gate reading caches instead of rerunning is defective | inapplicable throughout: no gate, cached mathematical output or execution receipt supports any accepted conclusion. |
Erdős-specific checklist
| Item | Grading finding |
|---|---|
| Quantifiers and scope | pass for all mathematical surfaces. Eventual divergence, sufficiently small delta/epsilon, arbitrary changing exclusions and targets, and conditional D bounds keep their distinct quantifiers. |
| Circularity | pass. The sparse set is constructed from failure of tightness, not from the desired target assertion; no group uses the conclusion to establish a required premise. |
| Model and convention changes | pass. Positive inputs, the unique zero fiber, ordered pairs and diagonals remain consistent. Abstract witnesses are not relabeled as arithmetic counterexamples. |
| Finite and statistical overreach | pass. There is no census, sampling or statistical inference. Finite inequalities are exhaustive mathematical arguments. |
| Uniformity | pass. Fixed-Z residue errors, fixed-ratio PNT intervals, epsilon-dependent constants and h-dependent little-o bounds are used at exactly those strengths. |
| Extremal conclusions | pass. The lower-limit and supremum arguments are in the proper normalized units; no missing optimizer, attainment or finite upper constant is presumed. |
| Consequences and composition | pass for the listed mathematical consequences; void affirmative verification of the knowledge assertion. D's sufficiency and necessary growth remain conditional, and mixed collisions are included. |
| Computation | inapplicable as a program-evidence obligation for all groups. The exact finite arithmetic claims are nevertheless checked above; labeling them noncomputational does not exempt them from justification. |
| Reproduction | pass for retained noncomputational reasoning. The public assets and report must resolve at adoption. No missing mathematical source code or unrerun required calculation is concealed. |
| Source and verdict fidelity | pass at the supplied statement interfaces only; void for the unsupported knowledge characterization. Original proofs and PDF fidelity were not inspected and gain no coverage. This grade rules on the exposure rather than quoting the reviewer as its own authority. |
The neighboring statistical discipline is inapplicable: there are no samples or
claims of probabilistic independence. Evidence coverage under docs/anatomy.md
and docs/evidence.md is satisfied by preserved proofs and witnesses at the
stated scope. A structurally different computational reproduction leg is not
required for this noncomputational batch. This grade is not a second independent
review cycle and makes no multiple-cycle reliability claim.
Original knowledge assertion, later wording and exact correction
The original sentence is “It is not known to be equivalent.” Its natural subject is equivalence of (D) with the target. That is a literature-wide knowledge assertion. A one-way proof does not establish it: failure to supply a converse here neither shows that no converse is known nor disproves equivalence. The packet contains no source survey bearing on this assertion. The report's withholding is therefore correct, and its absence of coverage is material to any request to certify that sentence or all frozen prose without qualification. It is immaterial to the validity of A, B and the other rows because none consumes it. This is a content-based ruling, not acceptance of the operator's label.
The separately frozen later sentence, “The argument does not establish the converse.”, makes the narrower argument-level observation. Inspection of the retained proof confirms that it proves (D) implies B(3) and that it does not prove B(1) or B(3) implies (D). Necessary lower bounds on constants do not supply that missing implication. The reviewer already explains this limitation, but the later author's bytes were not its frozen subject.
I authorize precisely the following correction outside a statement field, in the D paragraph of An equivalent form of the problem, immediately after “and hence the problem.” and before “The class”. The old bytes are:
It is not known to be
equivalent.Replace that single occurrence with these bytes:
The argument does not establish the converse.The line break in the old span is part of the supplied extraction. Reflow of surrounding whitespace is mechanical; no further wording change is authorized by this correction. The supplied later D excerpt, apart from its extraction wrapper and terminal blank lines, agrees exactly with the original D excerpt after this replacement. Thus pass applies to its eligibility for this specific body-prose correction rule. It is void as a claim of a fresh whole-statement review of later text: no such review occurred, and no inherited verdict covers other later changes.
Under docs/verification.md, Grading and claim standing, the acceptance of
the unchanged mathematical statements remains in force after exactly this
correction if the owning page discloses where current prose differs from the
reviewed subject and cites this grade's condition. The original subject and
report must remain preserved; the report must never be rewritten to say that it
reviewed the later sentence. This corrects unsupported surrounding
characterization without changing Theorem A, Theorem B, the displayed definition
or hypothesis (D), or any proved consequence. It gives no warrant for necessity
or for an equivalence involving (D).
Any change to a statement: field, or substantive change to the whole theorem
statement in a page without such a field, is a new frozen subject requiring a
fresh blind review and separate grade. The correction exception must not be
used to replace a statement or add a stronger consequence. No other later page
content, including routes outside this commission, acquires standing here.
Accepted standing and durable adoption conditions
As the eligible separate grader, I accept the review for all mathematical surfaces marked pass; refutation-failed above and assert tier 1 for those exact propositions at that scope, effective only on durable adoption of this warrant. This is acceptance of a whole statement in each listed row, not a promotion of an unreviewed fragment to a larger claim. It is not tier 2, a source proof audit, a tier for (D)'s unproved antecedent, or an acceptance of an E0955 solution. No tier is warranted for the original knowledge assertion or a new whole statement written after the review.
The integrator may record this grade's accepted judgment and supply no new tier assertion of its own. The following conditions remain obligations of adoption:
- File the report and this grade at the named verification homes and retain the exact submitted subject, countermodel, review, grade and necessary mathematical keeper interfaces at the named assets paths. Retain the separately frozen later excerpt as the evidence for the correction's limited applicability. These files, the retained reasoning and the public references needed to read them must resolve from an ordinary clone. Private custody alone is not a public verification warrant.
- Preserve each external interface's actual reading depth and provenance. The source-interface keeper must continue to be labeled a restatement. No publication, original-proof, PDF or broader source-fidelity coverage may be added by filing. Mechanical public-path maintenance is allowed under the standard, with its disclosed mapping and unchanged subject, scope and verdict.
- Retain the motivational exposure and this immateriality ruling in the filed record's index and the owning standing account. Preserve the distinct author, reviewer and grader roles and the independence facts; keep raw communications and operational records private.
- The owning standing account must limit acceptance to the passed mathematical propositions and state that (D) and the full problem remain unproved by this package. Any description of the entire scoped prose as accepted must first implement exactly the authorized knowledge-sentence correction and disclose it as differing from the reviewed subject. All other accepted statements, definitions, proofs and inputs must remain the reviewed ones, apart from permitted mechanical maintenance; the supplied later excerpt establishes that comparison only for its D span. The original assertion remains uncertified in its preserved snapshot.
- Preserve the submitted records while enumerating any publication maintenance allowed by the standard. A changed mathematical check, theorem statement or unapproved consequence is not covered by this grade. Custody and adoption checks belong to the integrator; they were not replaced by a repository gate or by the private delivery.
All required mathematical and report-contract checks for the passed rows are complete within the commissioned source interfaces. No mathematical executable was used, so no code, runtime output or numerical rerun remains owed. The remaining obligations are durable adoption and the specified scope disclosures; the original knowledge assertion and any stronger or later whole statement remain outside favorable verification. The retained abstract counterexamples refute only their stated general inferences, while the scoped analytic results have verdict refutation-failed.