Skip to content

Conversation

@Paul-Lez
Copy link
Member

@Paul-Lez Paul-Lez commented Aug 27, 2025

@Paul-Lez Paul-Lez mentioned this pull request Aug 27, 2025
2 tasks
Then $A$ is strictly increasing. -/
@[category test, AMS 11]
theorem erdos_359.variants.strictMono_of_isGoodFor (A : ℕ → ℕ) (n : ℕ) (hA : IsGoodFor A n) :
StrictMono A := by
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't think this is true given the definition of IsGoodFor for n > 1. For example, if n = 2, then A 0 = 2 and A 1 = 1. This assumption might need to go in the definition of IsGoodFor itself

Copy link
Member Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Good point - fixed!

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This is basically by definition now, so I'm not sure it warrants inclusion as a test. Proof:

  intro a b hab
  induction hab with
  | refl => exact (hA.2 a).1.1
  | step _ a_ih => exact a_ih.trans (hA.2 _).1.1

@callesonne callesonne added the Awaiting author A reviewer has asked the author a question or requested changes. label Sep 30, 2025
@Paul-Lez Paul-Lez removed the Awaiting author A reviewer has asked the author a question or requested changes. label Oct 14, 2025
@Paul-Lez Paul-Lez requested a review from smmercuri October 14, 2025 11:56
Comment on lines +29 to +30
/-- The predicate that `A 0 = n` and for all `j`, `A (j + 1)` is the smallest natural number that
cannot be written as a sum of consecutive terms of `A 0, ..., A j` -/
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This no longer matches the formal statement, we should include that A (j + 1) is greater than A j (or equivalently that A is strict mono

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

5 participants