Claims — Reading

Every claim on Reading and the pages under it, one line each: name, tier, verifier. 27 claims at this build. All sections.

Reading

• The reading lemma rule — explore_reading_geometry.py
• The wall criterion rule — explore_cf_nonlinear.py, explore_cf_redundant.py
• The unit gate rule — explore_cf_window.py, explore_cf_conductor.py, explore_cf_flow.py
• The conductor law rule — explore_cf_conductor.py, explore_cf_nonlinear.py, explore_cf_flow.py
• The commitment bound and rate forcing rule — explore_cf_flow.py
• The redundant cover and the ladder law rule — explore_cf_redundant.py
• The two gates across windows rule — explore_dual_lipschitz.py, explore_cf_window.py, explore_cf_redundant.py

Completions

• The Zeckendorf gate rule — explore_zeckendorf_window.py
• The completion trichotomy rule — explore_zeckendorf_discontinuity.py, explore_goldenbase_control.py, explore_continuity_converse.py, explore_quadratic_middle.py, explore_arithmetic_gate.py, explore_completion_atlas.py, explore_tribonacci_discontinuity.py, explore_tetranacci_window.py
• The fifth shape observation — explore_silent_window.py, explore_pisot_confound.py
• The hypothesis law of the fifth shape rule — explore_conjugate_spectrum.py

Quadratic windows

• The quadratic Ostrowski gate rule — explore_ostrowski_window.py, explore_period3_borrow.py, explore_limit_maps.py
• The comb telescopes theorem — explore_silver_discontinuity.py, explore_constant_a_borrow.py, explore_period2_borrow.py, explore_period3_borrow.py
• The absorption lemma theorem — explore_odd_a_freeze.py
• The maximal string and the boundary family rule — explore_max_string_witness.py, explore_general_max_string.py, explore_class_criterion.py
• The containment principle theorem — explore_relation_address.py, explore_aperiodic_address.py, explore_witness_family.py, explore_limit_maps.py
• The apparition density theorem — explore_class_criterion.py, explore_apparition_density.py, explore_kummer_layers.py

Digit shifts

• The stride law rule — explore_shift_repair.py, explore_limit_column.py
• The limit of the lookahead, and the half-period stride theorem — explore_limit_column.py, explore_cascade_span.py, explore_cascade_values.py, explore_cascade_rule.py
• The run-length rule rule — explore_cascade_rule.py, explore_cascade_scale.py, explore_limit_column.py, explore_limit_maps.py
• The lookahead cap is calibration pattern — explore_saturation_twins.py, explore_limit_column.py, explore_limit_maps.py, explore_cascade_rule.py
• Neither end of a drop decides observation — explore_cascade_roof.py

The widened output

• Redundancy separates the two tears theorem — explore_redundant_ostrowski.py, explore_universal_reader.py, explore_reader_box.py, explore_lookahead_band.py, explore_flush_price.py, explore_completion_reader.py, explore_completion_lift.py, explore_flush_floor.py, explore_flush_law.py, explore_flush_theorem.py

Redundant arithmetic

• The rational-slope delay criterion criterion — explore_slope_proof.py, explore_slope_lattice.py, explore_slope_tail.py, explore_slope_tree.py, explore_slope_dodge.py
• The assembly across levels pattern — explore_slope_assemble.py, explore_slope_width.py, explore_slope_empty.py
• The empty-window law rule — explore_slope_step.py, explore_slope_arc.py, explore_slope_wrap.py
• The exact lookahead law and the margin's wedge criterion — explore_lookahead_proof.py, explore_margin_wedge.py, explore_redundant_lookback.py, explore_margin_locus.py