READING THE COMPACT LEAN DEVELOPMENT

Begin with the short final theorem files in max5/entry/ and max6/entry/.
Next read each Definitions.lean. IsOptimal packages an attainable width and
a lower bound for every admissible identity. The quantification over inputs
is over the reals, even though the coefficients are rational.

For any module below, obtain its complete source with:

  python3 tools/compact.py show max5 MODULE_NAME
  python3 tools/compact.py show max6 MODULE_NAME

After expansion, all these modules have their original PM2/MODULE_NAME.lean
paths. The chapter files consolidate presentation; they do not erase module
boundaries or carry local declarations into a different scope.

MAX5: FROM THE MODEL TO SIX DIRECTIONS

1. Definitions
   Read Input, feature, InD2, Circuit.Admissible, Represents and IsOptimal.
   This fixes what is counted and what is free.

2. CanonicalDictionary
   canonical_dictionary_complete covers all allowed nonzero directions up
   to integer scaling. See the dictionary-and-reduction chapter.

3. ShapeInvariants (also present as a short entry file)
   canonical_top_by_histogram connects profile shape to top content.
   canonical_zero_profile_top and canonical_equal_profile_top justify the
   uses of zero and equal profiles. See profiles-and-symmetry for the inputs.

4. QuotientActualModel
   attainable_stored_quotient_solution transfers an actual identity to the
   stored coefficient system without increasing support. Its explicit
   fidelity inputs are proved in QuotientProfileCatalog and
   QuotientBooleanCatalog.

5. StoredSupportExclusion and CanonicalSavedReferenceProof
   stored_solution_support_gt_five rules out small support given complete
   reference coverage. canonical_saved_reference_coverage supplies that
   coverage. The supporting three-, four- and five-anchor families are
   retained in full; their small checks are now template instances.

6. Max5Optimality
   WStar_eq_six identifies the minimum. width_six_optimal packages the
   construction and lower bound in the model's IsOptimal predicate.

MAX6: TRANSFER, LOCAL LAWS AND GLOBAL EXCLUSION

1. Definitions
   Read edges6, InD2, Circuit.Admissible, Represents6 and IsOptimal6.
   The 21 features include all six coordinate functions.

2. ContinuationFullTransfer and ContinuationCompressionAssembly
   These entry files expose transfer to the 1,545-column dictionary and the
   compression saving. The hosting-and-profile-fidelity and canonical-transfer
   chapters contain their semantic and finite-coverage dependencies.

3. ContinuationPrivateLineCostSemantics
   row_equations gives the literal private-row equations.
   nonzero_glue_sum_cost and N_line_cost convert nonzero content into
   unavoidable support costs. See physical-equations-and-local-costs.

4. ContinuationArrayContentSemantics and ContinuationPhysicalFlowSemantics
   array_equation and omega_mass govern the corrected source-array content.
   F_zero and P_zero are the full physical flow and projection identities.
   The source arrays must not be identified with physical blocks.

5. ContinuationEndpointFrontier
   selected derives the remaining budgets under an assumed width <= 32.
   Its original compression variable and the selected normal form stay explicit.

6. The endpoint branches
   ContinuationNonmatchingEndpointResidualBridge closes the nonmatching case.
   ContinuationMatchingThreeMultiZCompleteFrontier reduces the matching
   remainder to at most two active centers.
   ContinuationMatchingTwoDfreeComplete includes the two-center exclusion.
   ContinuationMatchingOneF14SelectedAssembly treats one center with <= 3 loops.
   ContinuationMatchingOneHighLoopAssembly treats the complementary loop branch
   with explicit local T13 and corner inputs.

7. ContinuationMax6PrivateExclusionAssembly20261028
   The entry file shows how the branch exclusions fit together. Follow its
   hypotheses rather than treating any isolated conditional lemma as the
   complete lower bound.

8. ContinuationMax6ReducedPhysicalChecksAssembly20261029
   The physical and local-model inputs are supplied, leaving three finite
   families. Their parameters, signs and case ranges remain unchanged.

9. ContinuationMax6Optimality20261029
   The closed theorem supplies the remaining families through
     ContinuationF13SignatureKeyAll20261029.checked
     ContinuationF13ActualGroupPressureAll20261029.group_pressure
     ContinuationMatchingOneF15ActiveRouterComplete.all
   Its result is IsOptimal6 33 with no remaining mathematical hypothesis.

READING A CHECK FAMILY

For example, the original CoreHistogramPairCheck modules share a theorem
pattern with an explicit starting index and range length. Their common source
appears once in max5/templates/check-families.lean.in. Every original module
name and its exact parameter strings are listed in module-catalog.json.
FAMILY_INDEX.txt identifies the relevant template and number of instances.

The parameters are not a new mathematical assumption or a reduced sample.
They reproduce the original theorem identifiers and ranges byte for byte.
Likewise, compressed arrays contain every original literal, not a summary
or a hash substituted for the finite certificate.

Conditional interfaces are useful reading boundaries. A local module may
assume a frame, a coverage fact or a checked finite family; follow the argument
supplying it in the assembly. Global validity comes from the closed roots and
their complete dependencies. The original scopes, signed cases, balanced
columns and physical-Z distinctions are all retained.
