TheoremDB

Problem packetWorkR744

R744claimStatus: establishedEvidence: EstablishedReplay: source only

[#R744] Each monotonicity comparison reduces to an integer inequality

claim. A central coefficient recurrence gives the exact probability, and squaring clears every square root and power-of-two denominator.

View evidenceOpen source ↗

1Summary

Let \[ F_n(x)=\prod_{k=1}^n(1+x^k)=\sum_s c_{n,s}x^s, \qquad T_n=\frac{n(n+1)}2. \] Choosing the indices assigned sign \(+1\) shows \[ S_n=0\quad\Longleftrightarrow\quad \sum_{k:\varepsilon_k=1}k=\frac{T_n}{2}. \] Hence, for admissible \(n\), \[ C_n=c_{n,T_n/2}=[x^{n(n+1)/4}]F_n(x), \qquad \Pr(S_n=0)=\frac{C_n}{2^n}. \] The coefficients obey the exact subset-sum recurrence \[ c_{n,s}=c_{n-1,s}+c_{n-1,s-n}, \] with \(c_{0,0}=1\). Also \[ Q_n=\sigma_n^2=\frac{n(n+1)(2n+1)}6. \] For consecutive admissible indices \(a<b\), all quantities are positive. Squaring and clearing denominators gives \[ A_b>A_a \quad\Longleftrightarrow\quad C_b^2Q_b-C_a^2Q_a4^{b-a}>0. \] This equivalence is the comparison used by the executable artifact. Every decision is an integer sign test.

Established evidence. Recorded scope: every positive integer n and every consecutive pair of admissible indices.

2Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: oeis.org ↗, A063865 gives the sign-count and central-coefficient interpretations; the recurrence and cleared comparison are derived directly here

3What was measured

Coefficient sequence
OEIS A063865
Admissible residues mod 4
0, 3
Variance formula
n(n+1)(2n+1)/6
Comparison margin
C_b^2 Q_b - C_a^2 Q_a 4^(b-a)

4How it connects

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R744",
  "content_hash": null,
  "slug": "ssclt-claim-exact-coefficient-test",
  "type": "claim",
  "title": "Each monotonicity comparison reduces to an integer inequality",
  "summary": "A central coefficient recurrence gives the exact probability, and squaring clears every square root and power-of-two denominator.",
  "relevance": "For Eventual monotonicity in a signed subset-sum local limit, record ssclt-claim-exact-coefficient-test (“Each monotonicity comparison reduces to an integer inequality”) records a bound, answer, status fact, or structural consequence. The record states: A central coefficient recurrence gives the exact probability, and squaring clears every square root and power-of-two denominator.",
  "relevance_source": "recorded",
  "body": "Let\n\\[\nF_n(x)=\\prod_{k=1}^n(1+x^k)=\\sum_s c_{n,s}x^s,\n\\qquad T_n=\\frac{n(n+1)}2.\n\\]\nChoosing the indices assigned sign \\(+1\\) shows\n\\[\nS_n=0\\quad\\Longleftrightarrow\\quad \\sum_{k:\\varepsilon_k=1}k=\\frac{T_n}{2}.\n\\]\nHence, for admissible \\(n\\),\n\\[\nC_n=c_{n,T_n/2}=[x^{n(n+1)/4}]F_n(x),\n\\qquad \\Pr(S_n=0)=\\frac{C_n}{2^n}.\n\\]\nThe coefficients obey the exact subset-sum recurrence\n\\[\nc_{n,s}=c_{n-1,s}+c_{n-1,s-n},\n\\]\nwith \\(c_{0,0}=1\\). Also\n\\[\nQ_n=\\sigma_n^2=\\frac{n(n+1)(2n+1)}6.\n\\]\nFor consecutive admissible indices \\(a<b\\), all quantities are positive. Squaring and clearing denominators gives\n\\[\nA_b>A_a\n\\quad\\Longleftrightarrow\\quad\nC_b^2Q_b-C_a^2Q_a4^{b-a}>0.\n\\]\nThis equivalence is the comparison used by the executable artifact. Every decision is an integer sign test.",
  "status": "established",
  "evidence_grade": "mathematical_identity",
  "scope": {
    "kind": "universal",
    "statement": "every positive integer n and every consecutive pair of admissible indices"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://oeis.org/A063865",
      "locator": "A063865 gives the sign-count and central-coefficient interpretations; the recurrence and cleared comparison are derived directly here"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://oeis.org/A063865",
    "locator": "A063865 gives the sign-count and central-coefficient interpretations; the recurrence and cleared comparison are derived directly here"
  },
  "models": [],
  "relations": [
    {
      "slug": "R745",
      "title": "All 492 comparisons through n=1000 are strict increases",
      "object_type": "claim",
      "relation": "supports",
      "direction": "outgoing"
    },
    {
      "slug": "signed-subset-sum-local-clt-monotone",
      "title": "signed subset sum local clt monotone",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
signed-subset-sum-local-clt-monotone
Locator
A063865 gives the sign-count and central-coefficient interpretations; the recurrence and cleared comparison are derived directly here
License
CC0-1.0
Contributors
TheoremDB entry research, 2026-07-24
Public record
R744
Stable alias
ssclt-claim-exact-coefficient-test
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.