{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "dvir-finite-field-kakeya-polynomial-method-2008",
    "title": "Dvir: the polynomial method for finite-field Kakeya sets",
    "summary": "For each fixed dimension, a subset of a finite vector space containing a full affine line in every direction has size at least a positive dimension-dependent fraction of the entire space. A low-degree polynomial vanishing on a too-small candidate set would force incompatible vanishing of its homogeneous components.",
    "boundary": "The field is finite and the contained objects are complete affine lines; this does not settle real Euclidean Kakeya dimension or maximal-function conjectures. The dimension-dependent constant is not asserted to be optimal. The revised text distinguishes Dvir's initial exponent improvement from the full-density sharpening credited to subsequent suggestions.",
    "area": "Finite-field incidence geometry",
    "topic": "Mathematics",
    "year": 2008,
    "lane": "HUMAN",
    "result": "THEOREM",
    "package_id": "dvir-finite-field-kakeya-polynomial-method-2008",
    "target": {
      "record_id": "urn:uuid:5c145737-58e0-4cb4-ae3b-d9ae27380540",
      "version": 1,
      "content_hash": "sha256:36ddf0a689bcba14a0bbe3c1a2c3023673c4e14d27f0d4764da2bbb5266840b8"
    },
    "humans": [
      "Zeev Dvir"
    ],
    "additional_contributors": [
      {
        "name": "Noga Alon",
        "role": "Credited in§1.1 with the observation sharpening the initial bound to a dimension-dependent full-density bound",
        "sources": [
          {
            "title": "On the size of Kakeya sets in finite fields",
            "url": "https://arxiv.org/abs/0803.2336v3"
          }
        ]
      },
      {
        "name": "Terence Tao",
        "role": "Credited in§1.1 with the full-density sharpening; acknowledgments print an extra-r spelling variant",
        "sources": [
          {
            "title": "On the size of Kakeya sets in finite fields",
            "url": "https://arxiv.org/abs/0803.2336v3"
          }
        ]
      },
      {
        "name": "Richard Oberlin",
        "role": "Acknowledged for pointing out improvements to Theorem1",
        "sources": [
          {
            "title": "On the size of Kakeya sets in finite fields",
            "url": "https://arxiv.org/abs/0803.2336v3"
          }
        ]
      }
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.",
    "agents": [],
    "related": [
      "openai-math-kakeya-maximal-3d-2026"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261020-dvir-0803-2336v3",
        "title": "On the size of Kakeya sets in finite fields",
        "url": "https://arxiv.org/abs/0803.2336v3",
        "date": "2008-03-20"
      }
    ],
    "points": "350000",
    "published_grade": {
      "id": "dvir-finite-field-kakeya-polynomial-method-2008",
      "entry_id": "dvir-finite-field-kakeya-polynomial-method-2008",
      "band": "S",
      "modifier": "-",
      "target": {
        "record_id": "urn:uuid:5c145737-58e0-4cb4-ae3b-d9ae27380540",
        "version": 1,
        "content_hash": "sha256:36ddf0a689bcba14a0bbe3c1a2c3023673c4e14d27f0d4764da2bbb5266840b8"
      },
      "what_changed": "For each fixed dimension, a subset of a finite vector space containing a full affine line in every direction has size at least a positive dimension-dependent fraction of the entire space. A low-degree polynomial vanishing on a too-small candidate set would force incompatible vanishing of its homogeneous components.",
      "scope": "For each fixed dimension, a subset of a finite vector space containing a full affine line in every direction has size at least a positive dimension-dependent fraction of the entire space. A low-degree polynomial vanishing on a too-small candidate set would force incompatible vanishing of its homogeneous components. The field is finite and the contained objects are complete affine lines; this does not settle real Euclidean Kakeya dimension or maximal-function conjectures. The dimension-dependent constant is not asserted to be optimal. The revised text distinguishes Dvir's initial exponent improvement from the full-density sharpening credited to subsequent suggestions.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:5c145737-58e0-4cb4-ae3b-d9ae27380540",
        "version": 1,
        "content_hash": "sha256:36ddf0a689bcba14a0bbe3c1a2c3023673c4e14d27f0d4764da2bbb5266840b8"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-23T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Zeev Dvir",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "On the size of Kakeya sets in finite fields",
            "url": "https://arxiv.org/abs/0803.2336v3"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "On the size of Kakeya sets in finite fields",
            "url": "https://arxiv.org/abs/0803.2336v3"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The field is finite and the contained objects are complete affine lines; this does not settle real Euclidean Kakeya dimension or maximal-function conjectures. The dimension-dependent constant is not asserted to be optimal. The revised text distinguishes Dvir's initial exponent improvement from the full-density sharpening credited to subsequent suggestions.",
        "domain": "Finite-field incidence geometry"
      },
      "sources": [
        {
          "citation": "On the size of Kakeya sets in finite fields",
          "url": "https://arxiv.org/abs/0803.2336v3"
        }
      ],
      "statement": "# Dvir: the polynomial method for finite-field Kakeya sets\n\n## A line in every direction\n\nA Kakeya set contains a complete line in every allowed direction. Over a finite field, the entire geometry has finitely many points, and arithmetic wraps according to the field's rules. Dvir's polynomial approach proves that such a set must occupy at least a dimension-dependent positive fraction of the whole space. This resolves the finite-field size exponent, while leaving the different real Euclidean questions separate.\n\n## Make a tiny finite plane\n\nUse coordinates 0, 1 and 2, with arithmetic modulo three. The plane has nine points. Draw the lines through the origin with directions (1, 0), (0, 1), (1, 1) and (1, 2). Each line has three points. Their union is the whole nine-point plane, so it certainly contains a line in every direction. This classroom construction is an example, not a claim that every Kakeya set in this plane must use all nine points.\n\n## Why a polynomial can constrain a set\n\nA polynomial is an expression built from variables and coefficients using sums and nonnegative integer powers. Too many independent vanishing conditions can force a low-degree polynomial to vanish identically. The proof assumes a Kakeya set is too small, constructs a polynomial that vanishes on it and exploits the full lines to obtain incompatible conditions in every direction. The degree and finite-field assumptions are essential.\n\n## Preserve the revision and predecessor credit\n\nThe cited revised version states the full dimension-dependent density bound. It distinguishes the initial exponent improvement from suggestions that sharpened the argument. That refinement is not a reason to erase the original mechanism or its contributors. Nor does the result provide an optimal numerical constant or settle Euclidean Kakeya maximal-function conjectures.\n\n## Try a finite check\n\nList the three points on each of the four classroom lines and verify the nine-point union. Then find the theorem's field, dimension and complete-line requirements in the source. State which of your checks are finite illustrations and which claims require the general polynomial argument. That separation makes a short explanatory contribution useful to the next reader.\n\n## Scientific scope\n\nThe field is finite and the contained objects are complete affine lines; this does not settle real Euclidean Kakeya dimension or maximal-function conjectures. The dimension-dependent constant is not asserted to be optimal. The revised text distinguishes Dvir's initial exponent improvement from the full-density sharpening credited to subsequent suggestions.\n\n## Sources for this explanation\n\n- [On the size of Kakeya sets in finite fields](https://arxiv.org/abs/0803.2336v3): Pinned original contribution and stated hypotheses or experimental limits.\n",
      "summary": "For each fixed dimension, a subset of a finite vector space containing a full affine line in every direction has size at least a positive dimension-dependent fraction of the entire space. A low-degree polynomial vanishing on a too-small candidate set would force incompatible vanishing of its homogeneous components.",
      "title": "Dvir: the polynomial method for finite-field Kakeya sets"
    },
    "record_id": "urn:uuid:5c145737-58e0-4cb4-ae3b-d9ae27380540",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:5c145737-58e0-4cb4-ae3b-d9ae27380540",
      "version": 1,
      "content_hash": "sha256:36ddf0a689bcba14a0bbe3c1a2c3023673c4e14d27f0d4764da2bbb5266840b8"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:1aef5728b326269b7201a801cd4d4e5f7516eacc096e6e1a78392fe67f27e68a"
  },
  "target": {
    "record_id": "urn:uuid:5c145737-58e0-4cb4-ae3b-d9ae27380540",
    "version": 1,
    "content_hash": "sha256:36ddf0a689bcba14a0bbe3c1a2c3023673c4e14d27f0d4764da2bbb5266840b8"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "dvir-finite-field-kakeya-polynomial-method-2008",
    "entry_id": "dvir-finite-field-kakeya-polynomial-method-2008",
    "revision": 1,
    "title": "Dvir: the polynomial method for finite-field Kakeya sets",
    "context": "Finite-field incidence geometry",
    "track": "Exact theorem and reusable mathematical method",
    "band": "S",
    "modifier": "-",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-23",
    "evidence_cutoff": "2026-10-23",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "For each fixed dimension, a subset of a finite vector space containing a full affine line in every direction has size at least a positive dimension-dependent fraction of the entire space. A low-degree polynomial vanishing on a too-small candidate set would force incompatible vanishing of its homogeneous components.",
    "scope": "For each fixed dimension, a subset of a finite vector space containing a full affine line in every direction has size at least a positive dimension-dependent fraction of the entire space. A low-degree polynomial vanishing on a too-small candidate set would force incompatible vanishing of its homogeneous components. The field is finite and the contained objects are complete affine lines; this does not settle real Euclidean Kakeya dimension or maximal-function conjectures. The dimension-dependent constant is not asserted to be optimal. The revised text distinguishes Dvir's initial exponent improvement from the full-density sharpening credited to subsequent suggestions.",
    "evidence_summary": "The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. The field is finite and the contained objects are complete affine lines; this does not settle real Euclidean Kakeya dimension or maximal-function conjectures. The dimension-dependent constant is not asserted to be optimal. The revised text distinguishes Dvir's initial exponent improvement from the full-density sharpening credited to subsequent suggestions.",
    "references": [
      {
        "title": "On the size of Kakeya sets in finite fields",
        "url": "https://arxiv.org/abs/0803.2336v3",
        "locator": "Original scoped contribution, statement/method and evidence limits; source-specific attribution retained."
      }
    ],
    "roles": [
      {
        "who": "The named authors in the research record",
        "credit": "SCIENCE",
        "did": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred."
      },
      {
        "who": "Noga Alon",
        "credit": "SCIENCE",
        "did": "Credited in§1.1 with the observation sharpening the initial bound to a dimension-dependent full-density bound"
      },
      {
        "who": "Terence Tao",
        "credit": "SCIENCE",
        "did": "Credited in§1.1 with the full-density sharpening; acknowledgments print an extra-r spelling variant"
      },
      {
        "who": "Richard Oberlin",
        "credit": "SCIENCE",
        "did": "Acknowledged for pointing out improvements to Theorem1"
      }
    ],
    "target": {
      "record_id": "urn:uuid:5c145737-58e0-4cb4-ae3b-d9ae27380540",
      "version": 1,
      "content_hash": "sha256:36ddf0a689bcba14a0bbe3c1a2c3023673c4e14d27f0d4764da2bbb5266840b8"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "350000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": {
    "id": "dvir-finite-field-kakeya-polynomial-method-2008",
    "target": {
      "record_id": "urn:uuid:5c145737-58e0-4cb4-ae3b-d9ae27380540",
      "version": 1,
      "content_hash": "sha256:36ddf0a689bcba14a0bbe3c1a2c3023673c4e14d27f0d4764da2bbb5266840b8"
    },
    "sections": [
      {
        "title": "A line in every direction",
        "text": "A Kakeya set contains a complete line in every allowed direction. Over a finite field, the entire geometry has finitely many points, and arithmetic wraps according to the field's rules. Dvir's polynomial approach proves that such a set must occupy at least a dimension-dependent positive fraction of the whole space. This resolves the finite-field size exponent, while leaving the different real Euclidean questions separate."
      },
      {
        "title": "Make a tiny finite plane",
        "text": "Use coordinates 0, 1 and 2, with arithmetic modulo three. The plane has nine points. Draw the lines through the origin with directions (1, 0), (0, 1), (1, 1) and (1, 2). Each line has three points. Their union is the whole nine-point plane, so it certainly contains a line in every direction. This classroom construction is an example, not a claim that every Kakeya set in this plane must use all nine points."
      },
      {
        "title": "Why a polynomial can constrain a set",
        "text": "A polynomial is an expression built from variables and coefficients using sums and nonnegative integer powers. Too many independent vanishing conditions can force a low-degree polynomial to vanish identically. The proof assumes a Kakeya set is too small, constructs a polynomial that vanishes on it and exploits the full lines to obtain incompatible conditions in every direction. The degree and finite-field assumptions are essential."
      },
      {
        "title": "Preserve the revision and predecessor credit",
        "text": "The cited revised version states the full dimension-dependent density bound. It distinguishes the initial exponent improvement from suggestions that sharpened the argument. That refinement is not a reason to erase the original mechanism or its contributors. Nor does the result provide an optimal numerical constant or settle Euclidean Kakeya maximal-function conjectures."
      },
      {
        "title": "Try a finite check",
        "text": "List the three points on each of the four classroom lines and verify the nine-point union. Then find the theorem's field, dimension and complete-line requirements in the source. State which of your checks are finite illustrations and which claims require the general polynomial argument. That separation makes a short explanatory contribution useful to the next reader."
      }
    ],
    "references": [
      {
        "title": "On the size of Kakeya sets in finite fields",
        "url": "https://arxiv.org/abs/0803.2336v3",
        "locator": "Pinned original contribution and stated hypotheses or experimental limits."
      }
    ]
  },
  "reading_status": "EXPLANATORY_GUIDE"
}