Add Erdős Problem 1167 (stepping-down partition relation)#3791
Open
henrykmichalewski wants to merge 2 commits intogoogle-deepmind:mainfrom
Open
Add Erdős Problem 1167 (stepping-down partition relation)#3791henrykmichalewski wants to merge 2 commits intogoogle-deepmind:mainfrom
henrykmichalewski wants to merge 2 commits intogoogle-deepmind:mainfrom
Conversation
Mirrors the Round C docstring pass from the private repo's phase1-infrastructure branch. Each Lean file now carries the canonical source statement and upstream URL inline so reviewers can verify formalization against the source without navigating away from the diff.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Formalizes Erdős Problem 1167 concerning a stepping-down partition relation for cardinals.
Contents
CardinalPartitionRel μ r γ ν: anr-uniform generalization of the cardinal partition relationμ → (ν)^r_γ, asserting that for every coloring ofr-element subsets ofμwithγcolors there is a monochromatic subset of sizeν.finite_targets: behavior with finite target cardinalitiesbinary_colors: the two-color specializationinfinite_targets: behavior for infinite targetsr_eq_two: ther = 2(graph) specializationCloses #1991
Assisted by Claude (Anthropic).