Bounds, counting and linear structure
Read the pigeonhole principle in Book Isle: seventeen into five guarantees one four, not four everywhere
Use a unique-assignment model for seventeen cards to check a guaranteed bound, a tight example, thresholds and overlapping-label failures.
On this page
At least one box holding four differs from every box holding four. Build a five-box model for seventeen original exercise cards and check quantifiers, contradiction and tightness in Book Isle. Cards may contain your own exercise titles. Assignment is externally specified, not an automatic app-classification rule.
Fix unique assignment and the five-box universe
Number seventeen distinct objects Q01–Q17 and boxes G0–G4. Assign each exactly once, with no omissions or double membership. Empty boxes and unequal loads are allowed. Put conditions, counts, controls on P1–P3 PDF pages and verify 17/5 after import. Screen pagination is not object count. Library tags may overlap; a book example needs an explicit unique-assignment rule before tag totals can represent the model.
State the quantified guarantee
Every allowed assignment has at least one box containing at least 4. It does not give 4 in every box or identify the box in advance. 17/5=3.4 and integer occupancy gives ceiling 4, not rounding to 3. Mark the existence quantifier and lower bound separately. Retain the whole sentence; an isolated 4 cannot reveal whether it meant box count, possible maximum or guaranteed minimum.
Prove it by the at-most-three contradiction
If every box held at most 3, the total would be at most 5×3=15, contradicting 17. Hence one exceeds 3 and contains at least 4. The negation concerns every box being at most 3, not merely one. Fifteen is a hypothetical cap, not two actually lost cards. Keep per-box and total caps separate. The extra two do not identify a particular box; the proof establishes existence rather than an assignment list.
17 objects -> 5 boxes; each object assigned exactly once
if every box <=3: total <=5*3=15 <17, contradiction
therefore some box >=4
ceiling(17/5)=4
Construct a tight example ruling out a guaranteed five
Loads 4, 4, 3, 3, 3 total 17 with maximum 4, so no guarantee of 5 is possible. Four is the best universal bound. Assign mathematical indices n=0..16 by remainder modulo 5 to get G0/G1 with 4 and the rest 3. This constructs one tight example, not a required allocation for every case. Explicitly map Q01 to n=0 so printed card numbering does not shift the ledger.
Q01..Q17 correspond to n=0..16
G0: n=0,5,10,15 count4
G1: n=1,6,11,16 count4
G2: n=2,7,12 count3
G3: n=3,8,13 count3
G4: n=4,9,14 count3
total=17; maximum=4
Use an extreme assignment to reject an averaging claim
Loads 17, 0, 0, 0, 0 also satisfy unique assignment and the guarantee while four boxes lack 4. The theorem neither recommends balancing nor forces the maximum to equal 4. A lower bound allows 17 and is not an upper bound. Average 3.4 does not specify actual integer loads. Equally spaced icons in the reader or diagram cannot establish equal quantities.
Distinguish guarantee from possibility after changing totals
At 15, loads 3, 3, 3, 3, 3 disprove a guaranteed 4, but 5, 3, 3, 2, 2 show a load above 4 remains possible. At 16, the at-most-three cap 15 is exceeded, so 4 is already guaranteed. Not guaranteed does not mean impossible. For five boxes and a positive integer r, exceeding 5(r−1) guarantees some load at least r under the unique-assignment conditions. Changed box counts or membership rules need a new threshold.
With 17 objects but 4 boxes, the guarantee is 5, tight at 5, 4, 4, 4. With 6 boxes it is 3, tight at 3, 3, 3, 3, 3, 2. Verify sum 17 and each maximum; the six-box example disproves silently carrying over the five-box guarantee 4.
Troubleshoot totals, membership and quantifiers in Book Isle
Highlight or locate contradiction and tightness separately, and write the target’s negation before comparing. Three may round rather than ceiling; four everywhere confuses existence; overlapping tags can double-count cards. Change one condition and recheck sum and maximum. If searching 17 or Q01 fails, inspect image text instead of infer theorem applicability. Leave unperformed highlights/reopening blank; app group statistics are not this proof.
Seeing one load 4 does not imply total≥16: 4, 0, 0, 0, 0 already has it. Sixteen is a threshold guaranteeing 4 across every assignment, not the total required for one such occurrence. Keep this converse error beside the quantifiers.
Reopen and deliver guarantee, tightness, threshold evidence
Reopen P2, prove some load≥4, rule out guaranteed 5 with 4, 4, 3, 3, 3 and check 15 versus 16. Explain allowed empty boxes, unknown identity of the heavy box, exactly-once assignment and not-guaranteed versus impossible. Deliver theorem, construction, quantifier errors and actual observations, leaving unperformed reopening pending. Overlapping labels, changed box counts or missing objects require new conditions rather than reusing 17/5 mechanically.
Related tutorials and sources
Quantifiers and negation; Selection and role counting.
Method references: Oscar Levin DMOI4 proofs and the pigeonhole principle. Diagrams, report data, counterexamples and ledgers are original exercises.
Version checked on 17 November 2026: the Apple public lookup lists Book Isle 1.1.4, requiring iOS / iPadOS 15.6 or later; see the official App Store for published capabilities. Use self-made PDFs, EPUBs or clear text materials; bookmarks, highlights and notes depend on format and visible controls, without automatic solving or literary analysis. External preparation and paper predictions do not constitute device observations. Leave unperformed checks blank.