`Compfiles/Usa1979P1.lean`

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL: Lean4 Domain Explanation Language

Annotation provenance. This overlay contains 8 curated AI-written annotations and 3305 mechanical source-derived annotations. They have not been human-reviewed as explanations; treat them as unverified and not mathematical authority. Retained generation history: The 71 original curated annotations were produced in a Claude Sonnet 5.5 session at medium effort; Claude Opus 5.5 is recorded in that session as the advisor model, not the direct author. The bulk source-derived expansion was generated mechanically from pinned source comments by tooling developed in a GPT-5.6 Sol session at ultra reasoning; GPT-5.6 Sol did not originate the quoted source prose. On 2026-10-17 the mechanically generated source-comment annotations of the Formal Conjectures, Carleson, FLT, PFR, CompFiles, Mathematics in Lean and Theorem Proving in Lean overlays were regenerated by the same generator after three corrections made in a Claude Sonnet 5.5 session: titles no longer cut a sentence inside mathematics or end on a dangling word, workflow markers are removed from the quoted prose, and declaration names follow the scanner's namespace resolution. The boilerplate step line was dropped, and comments that were only a row of dashes no longer yield annotations. No new prose was written and no human review is claimed.

Credit: The upstream authors and contributors retain credit for the project and mathematics. lean4-explainer only renders their pinned source and adds the separately disclosed explanation layer.

Project sources: Pinned compfiles documentation, Pinned compfiles corpus index

3 declarations, 0 contain sorry, 0 declared as axioms

USA Mathematical Olympiad 1979, Problem 1

Determine all non-negative integral solutions $(n_1,n_2,\dots , n_{14})$ if any, apart from permutations, of the Diophantine Equation $n_1^4+n_2^4+\cdots +n_{14}^4=1599$.

Imports (2)

Imported by 1 file

Compfiles.lean

structure Usa1979P1.MultisetNatOfLen14 A type representing assignments to the variables $n_1$, $n_2$, ..., $n_{14}$, quotiented by permutations of indices line 30 source
Source documentation
A type representing assignments to the variables $n_1$, $n_2$, ..., $n_{14}$, quotiented by permutations of indices.

standard axioms: propext what this means
```
structure MultisetNatOfLen14 where
…
```
determine Usa1979P1.SolutionSet line 34 source
standard axioms: propext what this means
Statement uses: Set, Usa1979P1.MultisetNatOfLen14
Proof uses: EmptyCollection.emptyCollection
1 instances, coercions and auxiliary constants left out.
problem Usa1979P1.usa1979_p1 line 36 source
standard axioms: Classical.choice, Quot.sound, propext what this means
Statement uses: Usa1979P1.MultisetNatOfLen14, Iff, Membership.mem, Set, Usa1979P1.SolutionSet, Eq, Nat, Multiset.sum, Multiset.map, HPow.hPow, OfNat.ofNat, Usa1979P1.MultisetNatOfLen14.s
Proof uses: id, Iff.intro, EmptyCollection.emptyCollection, of_eq_true, Eq.trans, False, True, implies_congr, Eq.refl, false_implies, LE.le, HMod.hMod, Eq.mpr, HMul.hMul, Multiset.card, congrArg, Multiset.card_map, Usa1979P1.MultisetNatOfLen14.p, Multiset.sum_le_card_nsmul, Multiset and 34 more
37 instances, coercions and auxiliary constants left out.

Tactic trace: 24 steps
Open to load the checked before-and-after goal states.