TheoremDB

Problem packetWorkR618

R618claimStatus: openEvidence: ReproducedReplay: source onlyexhaustive over its scope

[#R618] The maximum lies between 6,456,734,424 and 7,623,232,012

claim. The binary initial segment supplies the lower endpoint. Walsh Parseval, Harper's edge bound, and an exact secant inequality supply the upper endpoint.

View evidenceOpen source ↗

1Summary

Let \(M_{12,794}\) denote the requested maximum. The certified result is \[ 6{,}456{,}734{,}424\leq M_{12,794}\leq7{,}623{,}232{,}012. \] The lower endpoint is attained by the explicit initial segment in q12ns794-claim-lex-witness.

For the upper bound, put \(f=1_A\), \(\mu=794/4096\), and use the normalized Walsh coefficients \[ \widehat f(S)=2^{-12}\sum_x f(x)(-1)^{\sum_{i\in S}x_i}. \] The product kernel has Walsh eigenvalue \(4^{12-|S|}2^{|S|}\), hence \[ E(A)=8^{12}\sum_{S\subseteq[12]}2^{-|S|}\widehat f(S)^2. \] Parseval gives \(R:=\sum_{S\ne\varnothing}\widehat f(S)^2=\mu-\mu^2=655447/4194304\). If \(b(A)\) is the undirected edge boundary, then \[ D:=\sum_{S\ne\varnothing}|S|\widehat f(S)^2=\frac{b(A)}{2\cdot4096}. \] Harper's edge-isoperimetric theorem says that an initial binary segment maximizes the internal edges. At size 794 it has 3,693 internal edges, so every such \(A\) has \(b(A)\geq12\cdot794-2\cdot3693=2142\) and \(D\geq1071/4096\).

Reproduced evidence. Recorded scope: all subsets A of the labeled twelve-dimensional binary cube having exactly 794 vertices, for the ordered-pair objective sum 3^(12-d_H(x,y)).

2Evidence

Replay package: source only

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

Verification source: doi.org ↗, Harper's edge-isoperimetric theorem combined with the exact verifier q12ns794-artifact-fourier-edge-verifier

3Overview

Convexity gives, for each integer \(1\leq k\leq12\), \[ 2^{-k}\leq\frac{12-k}{11}\,2^{-1}+\frac{k-1}{11}\,2^{-12}. \] Summing this inequality against the nonnegative Fourier weights and inserting the lower bound on \(D\) yields \[ E(A)\leq\frac{83{,}855{,}552{,}164}{11}=7{,}623{,}232{,}014+\frac{10}{11}. \] For even \(|A|\), the objective is divisible by four: modulo four, the diagonal contributes \(|A|\) and the paired off-diagonal terms contribute \(2\binom{|A|}{2}\), whose sum is \(|A|^2\). The largest multiple of four below the rational bound is 7,623,232,012.

The endpoints do not match. The exact maximum and the cube-automorphism orbits of its maximizers remain open in this certificate.

4What was measured

Lower bound
6,456,734,424
Upper bound
7,623,232,012
Gap
1,166,497,588
Exact maximum known
no
Maximizer orbits classified
no

Pre integrality upper

numerator83,855,552,164denominator11

5How it connects

Recorded for

6Agent packet

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

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R618",
  "content_hash": null,
  "slug": "q12ns794-claim-certified-interval",
  "type": "claim",
  "title": "The maximum lies between 6,456,734,424 and 7,623,232,012",
  "summary": "The binary initial segment supplies the lower endpoint. Walsh Parseval, Harper's edge bound, and an exact secant inequality supply the upper endpoint.",
  "relevance": "For Maximum half-noise stability of a 794-set in the twelve cube, record q12ns794-claim-certified-interval (“The maximum lies between 6,456,734,424 and 7,623,232,012”) records a bound, answer, status fact, or structural consequence. The record states: The binary initial segment supplies the lower endpoint.",
  "relevance_source": "recorded",
  "body": "Let \\(M_{12,794}\\) denote the requested maximum. The certified result is\n\\[\n6{,}456{,}734{,}424\\leq M_{12,794}\\leq7{,}623{,}232{,}012.\n\\]\nThe lower endpoint is attained by the explicit initial segment in q12ns794-claim-lex-witness.\n\nFor the upper bound, put \\(f=1_A\\), \\(\\mu=794/4096\\), and use the normalized Walsh coefficients\n\\[\n\\widehat f(S)=2^{-12}\\sum_x f(x)(-1)^{\\sum_{i\\in S}x_i}.\n\\]\nThe product kernel has Walsh eigenvalue \\(4^{12-|S|}2^{|S|}\\), hence\n\\[\nE(A)=8^{12}\\sum_{S\\subseteq[12]}2^{-|S|}\\widehat f(S)^2.\n\\]\nParseval gives \\(R:=\\sum_{S\\ne\\varnothing}\\widehat f(S)^2=\\mu-\\mu^2=655447/4194304\\). If \\(b(A)\\) is the undirected edge boundary, then\n\\[\nD:=\\sum_{S\\ne\\varnothing}|S|\\widehat f(S)^2=\\frac{b(A)}{2\\cdot4096}.\n\\]\nHarper's edge-isoperimetric theorem says that an initial binary segment maximizes the internal edges. At size 794 it has 3,693 internal edges, so every such \\(A\\) has \\(b(A)\\geq12\\cdot794-2\\cdot3693=2142\\) and \\(D\\geq1071/4096\\).\n\nConvexity gives, for each integer \\(1\\leq k\\leq12\\),\n\\[\n2^{-k}\\leq\\frac{12-k}{11}\\,2^{-1}+\\frac{k-1}{11}\\,2^{-12}.\n\\]\nSumming this inequality against the nonnegative Fourier weights and inserting the lower bound on \\(D\\) yields\n\\[\nE(A)\\leq\\frac{83{,}855{,}552{,}164}{11}=7{,}623{,}232{,}014+\\frac{10}{11}.\n\\]\nFor even \\(|A|\\), the objective is divisible by four: modulo four, the diagonal contributes \\(|A|\\) and the paired off-diagonal terms contribute \\(2\\binom{|A|}{2}\\), whose sum is \\(|A|^2\\). The largest multiple of four below the rational bound is 7,623,232,012.\n\nThe endpoints do not match. The exact maximum and the cube-automorphism orbits of its maximizers remain open in this certificate.",
  "status": "open",
  "evidence_grade": "reproduced",
  "scope": {
    "kind": "bounded",
    "statement": "all subsets A of the labeled twelve-dimensional binary cube having exactly 794 vertices, for the ordered-pair objective sum 3^(12-d_H(x,y))",
    "bounds": {
      "dimension": {
        "min": 12,
        "max": 12
      },
      "cardinality": {
        "min": 794,
        "max": 794
      }
    },
    "exhaustive": true
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1016/S0021-9800(66)80059-5",
      "locator": "Harper's edge-isoperimetric theorem combined with the exact verifier q12ns794-artifact-fourier-edge-verifier"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1016/S0021-9800(66)80059-5",
    "locator": "Harper's edge-isoperimetric theorem combined with the exact verifier q12ns794-artifact-fourier-edge-verifier"
  },
  "models": [],
  "relations": [
    {
      "slug": "R620",
      "title": "The binary initial segment has objective 6,456,734,424",
      "object_type": "claim",
      "relation": "supports",
      "direction": "incoming"
    },
    {
      "slug": "R616",
      "title": "Exact pair-sum, Walsh-transform, and edge-bound verifier",
      "object_type": "artifact",
      "relation": "supports",
      "direction": "incoming"
    },
    {
      "slug": "R619",
      "title": "The radius-four Hamming ball has objective 5,884,957,476",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R617",
      "title": "Classical inequalities give a certified gap; the exact weighted optimum was not located",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "q12-noise-stability-794",
      "title": "q12 noise stability 794",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
q12-noise-stability-794
Locator
Harper's edge-isoperimetric theorem combined with the exact verifier q12ns794-artifact-fourier-edge-verifier
License
CC0-1.0
Contributors
TheoremDB entry research, 2026-07-25
Public record
R618
Stable alias
q12ns794-claim-certified-interval
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.