{ "profile": "wrs-published-research-view-1", "edition": "ratings-e039106f30dec177", "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS", "entry": { "id": "erdos-rado-delta-system-sunflower-lemma-1960", "title": "Erdős and Rado: finite sunflower bounds and cardinal Δ-system theorems", "summary": "A large collection of small sets cannot remain completely unstructured. Erdős and Rado find a subcollection whose pairwise intersections are all the same common core: a Δ-system, also called a sunflower. Their paper gives finite bounds while distinguishing distinct sets from indexed repetitions, and treats an infinite-cardinal regime separately. The finite argument supplies a reusable tool for extracting regular structure from a complicated family of sets.", "boundary": "The original indexed-system bound has an extra factor from allowed repetitions: its Theorem III uses b!a^(b+1) times an explicit correction for a sunflower with more than a indices. This is not the distinct-family bound transcribed without qualification. The factorial-to-exponential improvement is only conjectural in this original; the later ALWZ logarithmic-base improvement is a separate development. Infinite-cardinal claims retain the original cardinal hypotheses and well-ordering/choice framework, not a finite algorithm or an unrestricted uncountable extension.", "area": "Extremal set theory", "topic": "Mathematics", "year": 1960, "lane": "HUMAN", "result": "THEOREM", "package_id": "erdos-rado-delta-system-sunflower-lemma-1960", "target": { "record_id": "urn:uuid:7a79fd21-52de-406d-a8e2-e1d3901f35d6", "version": 1, "content_hash": "sha256:d982d5009427fd9b9a2462a5665a090651795ead7b19332d77a384db52fdbb14" }, "humans": [ "P. Erdős", "R. Rado" ], "human_identities": [ { "author_position": 0, "source_name": "P. Erdős", "person_id": "wrs-person-2877238e4d2ac172f8db6384", "display_name": "Paul Erdős", "status": "SOURCE_LINKED_IDENTITY", "sources": [ { "title": "Attribution source", "url": "https://renyi.hu/en/node/4094" } ] } ], "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": [], "subresults": [], "scientific_assessment": { "source_review": "SOURCE_CURATED", "scientific_review": "NOT_REVIEWED_BY_WRS", "formal_replay": "NOT_RUN", "provider_attestation": "NONE" }, "sources": [ { "id": "cur20261020-erdos-rado-intersection-1960", "title": "Intersection theorems for systems of sets (original1960)", "url": "https://combinatorica.hu/~p_erdos/1960-04.pdf", "date": "1960-01" } ], "points": "310000", "published_grade": { "id": "erdos-rado-delta-system-sunflower-lemma-1960", "entry_id": "erdos-rado-delta-system-sunflower-lemma-1960", "band": "S", "modifier": "-", "target": { "record_id": "urn:uuid:7a79fd21-52de-406d-a8e2-e1d3901f35d6", "version": 1, "content_hash": "sha256:d982d5009427fd9b9a2462a5665a090651795ead7b19332d77a384db52fdbb14" }, "what_changed": "A large collection of small sets cannot remain completely unstructured. Erdős and Rado find a subcollection whose pairwise intersections are all the same common core: a Δ-system, also called a sunflower. Their paper gives finite bounds while distinguishing distinct sets from indexed repetitions, and treats an infinite-cardinal regime separately. The finite argument supplies a reusable tool for extracting regular structure from a complicated family of sets.", "scope": "A large collection of small sets cannot remain completely unstructured. Erdős and Rado find a subcollection whose pairwise intersections are all the same common core: a Δ-system, also called a sunflower. Their paper gives finite bounds while distinguishing distinct sets from indexed repetitions, and treats an infinite-cardinal regime separately. The finite argument supplies a reusable tool for extracting regular structure from a complicated family of sets. The original indexed-system bound has an extra factor from allowed repetitions: its Theorem III uses b!a^(b+1) times an explicit correction for a sunflower with more than a indices. This is not the distinct-family bound transcribed without qualification. The factorial-to-exponential improvement is only conjectural in this original; the later ALWZ logarithmic-base improvement is a separate development. Infinite-cardinal claims retain the original cardinal hypotheses and well-ordering/choice framework, not a finite algorithm or an unrestricted uncountable extension.", "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:7a79fd21-52de-406d-a8e2-e1d3901f35d6", "version": 1, "content_hash": "sha256:d982d5009427fd9b9a2462a5665a090651795ead7b19332d77a384db52fdbb14" }, "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": "P. Erdős", "note": "Archive attribution; detailed role assignment remains source-bound", "roles": [ "prover" ], "source": { "citation": "Intersection theorems for systems of sets (original1960)", "url": "https://combinatorica.hu/~p_erdos/1960-04.pdf" } }, { "attribution_basis": "SOURCE_CITED", "credit": "historical_scientific", "entity_kind": "historical_person", "name": "R. Rado", "note": "Archive attribution; detailed role assignment remains source-bound", "roles": [ "prover" ], "source": { "citation": "Intersection theorems for systems of sets (original1960)", "url": "https://combinatorica.hu/~p_erdos/1960-04.pdf" } } ], "evidence": [ { "description": "Bibliographic/stated-result source; not a WRS proof verification", "id": "source-0", "kind": "source_reference", "source": { "citation": "Intersection theorems for systems of sets (original1960)", "url": "https://combinatorica.hu/~p_erdos/1960-04.pdf" } } ], "origin": "HUMAN_LEGACY", "record_profile": "wrs-local-research-notes-0.1", "record_type": "research_note", "rrp_version": "0.1", "scope": { "description": "The original indexed-system bound has an extra factor from allowed repetitions: its Theorem III uses b!a^(b+1) times an explicit correction for a sunflower with more than a indices. This is not the distinct-family bound transcribed without qualification. The factorial-to-exponential improvement is only conjectural in this original; the later ALWZ logarithmic-base improvement is a separate development. Infinite-cardinal claims retain the original cardinal hypotheses and well-ordering/choice framework, not a finite algorithm or an unrestricted uncountable extension.", "domain": "Extremal set theory" }, "sources": [ { "citation": "Intersection theorems for systems of sets (original1960)", "url": "https://combinatorica.hu/~p_erdos/1960-04.pdf" } ], "statement": "# Erdős and Rado: finite sunflower bounds and cardinal Δ-system theorems\n\nA large collection of small sets cannot remain completely unstructured. Erdős and Rado find a subcollection whose pairwise intersections are all the same common core: a Δ-system, also called a sunflower. Their paper gives finite bounds while distinguishing distinct sets from indexed repetitions, and treats an infinite-cardinal regime separately. The finite argument supplies a reusable tool for extracting regular structure from a complicated family of sets.\n\n## Scientific scope\n\nThe original indexed-system bound has an extra factor from allowed repetitions: its Theorem III uses b!a^(b+1) times an explicit correction for a sunflower with more than a indices. This is not the distinct-family bound transcribed without qualification. The factorial-to-exponential improvement is only conjectural in this original; the later ALWZ logarithmic-base improvement is a separate development. Infinite-cardinal claims retain the original cardinal hypotheses and well-ordering/choice framework, not a finite algorithm or an unrestricted uncountable extension.\n\n## Reading status\n\nThis is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.\n\n## People and systems\n\nP. Erdős; R. Rado\n\nSource-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.\n\n\n\n## Original sources\n\n- [Intersection theorems for systems of sets (original1960)](https://combinatorica.hu/~p_erdos/1960-04.pdf)\n", "summary": "A large collection of small sets cannot remain completely unstructured. Erdős and Rado find a subcollection whose pairwise intersections are all the same common core: a Δ-system, also called a sunflower. Their paper gives finite bounds while distinguishing distinct sets from indexed repetitions, and treats an infinite-cardinal regime separately. The finite argument supplies a reusable tool for extracting regular structure from a complicated family of sets.", "title": "Erdős and Rado: finite sunflower bounds and cardinal Δ-system theorems" }, "record_id": "urn:uuid:7a79fd21-52de-406d-a8e2-e1d3901f35d6", "version": 1, "source_ref": { "record_id": "urn:uuid:7a79fd21-52de-406d-a8e2-e1d3901f35d6", "version": 1, "content_hash": "sha256:d982d5009427fd9b9a2462a5665a090651795ead7b19332d77a384db52fdbb14" }, "export_view": "wrs-public-editorial-view-1", "public_view_hash": "sha256:ff12ee1016958b8c7af9b9282f933ee385970914755efc1be582e07928088c88" }, "target": { "record_id": "urn:uuid:7a79fd21-52de-406d-a8e2-e1d3901f35d6", "version": 1, "content_hash": "sha256:d982d5009427fd9b9a2462a5665a090651795ead7b19332d77a384db52fdbb14" }, "published_grade": { "profile": "wrs-published-grade-1", "edition": "2026-10-28.1", "id": "erdos-rado-delta-system-sunflower-lemma-1960", "entry_id": "erdos-rado-delta-system-sunflower-lemma-1960", "revision": 1, "title": "Erdős and Rado: finite sunflower bounds and cardinal Δ-system theorems", "context": "Extremal set theory", "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": "A large collection of small sets cannot remain completely unstructured. Erdős and Rado find a subcollection whose pairwise intersections are all the same common core: a Δ-system, also called a sunflower. Their paper gives finite bounds while distinguishing distinct sets from indexed repetitions, and treats an infinite-cardinal regime separately. The finite argument supplies a reusable tool for extracting regular structure from a complicated family of sets.", "scope": "A large collection of small sets cannot remain completely unstructured. Erdős and Rado find a subcollection whose pairwise intersections are all the same common core: a Δ-system, also called a sunflower. Their paper gives finite bounds while distinguishing distinct sets from indexed repetitions, and treats an infinite-cardinal regime separately. The finite argument supplies a reusable tool for extracting regular structure from a complicated family of sets. The original indexed-system bound has an extra factor from allowed repetitions: its Theorem III uses b!a^(b+1) times an explicit correction for a sunflower with more than a indices. This is not the distinct-family bound transcribed without qualification. The factorial-to-exponential improvement is only conjectural in this original; the later ALWZ logarithmic-base improvement is a separate development. Infinite-cardinal claims retain the original cardinal hypotheses and well-ordering/choice framework, not a finite algorithm or an unrestricted uncountable extension.", "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 original indexed-system bound has an extra factor from allowed repetitions: its Theorem III uses b!a^(b+1) times an explicit correction for a sunflower with more than a indices. This is not the distinct-family bound transcribed without qualification. The factorial-to-exponential improvement is only conjectural in this original; the later ALWZ logarithmic-base improvement is a separate development. Infinite-cardinal claims retain the original cardinal hypotheses and well-ordering/choice framework, not a finite algorithm or an unrestricted uncountable extension.", "references": [ { "title": "Intersection theorems for systems of sets (original1960)", "url": "https://combinatorica.hu/~p_erdos/1960-04.pdf", "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." } ], "target": { "record_id": "urn:uuid:7a79fd21-52de-406d-a8e2-e1d3901f35d6", "version": 1, "content_hash": "sha256:d982d5009427fd9b9a2462a5665a090651795ead7b19332d77a384db52fdbb14" }, "scientific_correctness_certified": false, "independent_expert_calibration": false, "method": "PROPRIETARY", "points": "310000" }, "canonical_agent_submission": false, "scientific_verification_awarded": false, "reader_guide": null, "reading_status": "SOURCE_LINKED_NOTE" }