Claims — Learning
Every claim on Learning and the pages under it, one line each: name, tier, verifier. 64 claims at this build. All sections.
Learning
- The funnel and its one blind corner rule —
explore_ratchet_learner.py,explore_bootstrap_cures.py - The bottom lemma rule —
explore_bootstrap_cures.py - The start-delay and catch-up laws rule —
explore_throttled_reader.py,explore_banking_reader.py - Destination universality rule —
explore_throttled_reader.py,explore_banking_reader.py,explore_scale_clock.py - The data door rule —
explore_prediction_door.py,explore_bandwidth_dial.py,explore_score_criterion.py - The keep law rule —
explore_keep_law.py,explore_score_criterion.py,explore_prediction_door.py
Stalls
- The stall census pattern —
explore_bootstrap_cures.py,explore_scale_clock.py,explore_stall_tie.py,explore_stall_assembly.py,explore_move_set.py - The slow-map refusal and the one-cell wall observation —
explore_stall_maprate.py,explore_stall_domination.py - The escape radius rule —
explore_charged_radius.py,explore_scale_clock.py
Nesting
- The floor theorem theorem —
explore_minimal_cell.py,explore_pinned_freshening.py,explore_bootstrap_cures.py,explore_move_set.py - The nesting neighbour rule —
explore_shift_telescope.py,explore_seed_exclusion.py,explore_chain_persistence.py,explore_pinned_telescope.py,explore_pinned_composite.py - The chain-preferring nesting theorem theorem —
explore_ladder_entry.py,explore_chain_persistence.py - The door inequalities rule —
explore_reference_families.py,explore_g2_separator.py - The decision lemma rule —
explore_stall_unresourced.py,explore_decision_trade.py
The substrate door
- Growth is hitting-set cover rule —
explore_collision_growth.py - The grown substrate is a counter rule —
explore_collision_growth.py - The flip condition observation —
explore_collision_growth.py - The encoding is what the substrate tracks observation —
explore_grammar_growth.py,explore_vsa_encoder.py - The embedding factors through the abelianization rule —
explore_embedding.py
Forgetting
- The four grades and their two witnesses rule —
explore_forgetting_certificate.py - The two clauses are independent observation —
explore_forgetting_certificate.py - The count leak rule —
explore_forgetting_certificate.py - Refinement never cures, coarsening exposes rule —
explore_working_amnesiac.py - The no-majority criterion criterion —
explore_working_amnesiac.py - The strict amnesiac and the tie desert observation —
explore_working_amnesiac.py,explore_tie_world.py
Menu collisions
- The normalizer semiring is not factorial observation —
explore_rogue_world.py,explore_menu_factorization.py,explore_menu_reach.py - Up to ten terms, non-uniqueness is one-variable on a face rule —
explore_menu_faces.py,explore_descent_hunt.py,explore_seed_confine.py - Full dimension occurs, and in the widest box walked it occurs once observation —
explore_descent26.py,explore_descent26_wide.py
Collision mechanisms
- The full-dimension witness is a parallelism that fails criterion —
explore_descent26_why.py,explore_descent26_close.py,explore_descent26_mix.py,explore_face_accident.py - A mixing pair at twelve terms is one family, or one-variable theorem —
explore_mixing34.py,explore_mixing26.py - Between two binomials, mixing is a cycle with a nonzero closing sum criterion —
explore_mixing26.py - At a two-factor seed the collision condition is one sign scan rule —
explore_descent26.py,explore_descent26_wide.py
Menu seeds
- Which menus are seeds, in closed form at two sizes rule —
explore_seed_shape.py - A seed's core has dimension at most half its size theorem —
explore_seed_rank_law.py,explore_seed_rank_nine.py,explore_seed_confine.py - A seed's negative factor is generically free of roots of unity rule —
explore_seed_torsion.py,explore_seed_line_floor.py,explore_seed_plane_floor.py - Four members are closed off every line: the cofactor theorem theorem —
explore_seed_cofactor.py,explore_seed_plane_floor.py - Five members: a free factor beside a rooted one theorem —
explore_seed_pentanomial.py,explore_seed_line_floor.py
Deletion audits
- The flip and the band observation —
explore_deletion_ruler.py,explore_flip_level.py - Two silent failures, two cuts of one number observation —
explore_noroot_margin.py,explore_flip_level.py - The self-report is compressed rule —
explore_flip_risk.py,explore_flip_inbox.py,explore_flip_floor.py - The floor is a trade, not a wall rule —
explore_flip_floor.py - Split-half wins where no derivation holds observation —
explore_flip_floor.py - The exact call and the miscalibrated probability observation —
explore_membership_ruler.py
Prediction sets
- The abandoned atom property —
explore_ruler_barecell.py,explore_ruler_exchange.py,explore_ruler_abandon.py,explore_ruler_dual.py - The overshoot bounds the error rule —
explore_ruler_surplus.py - The level-excess identity property —
explore_ruler_excess.py - The exactness threshold rule —
explore_ruler_surplus.py,explore_ruler_boundedgap.py - The flattening law property —
explore_ruler_gaplaw.py,explore_flatten_height.py
The swap
- The feasibility window and the swap property —
explore_ruler_swap.py,explore_ruler_multiswap.py,explore_ruler_gain.py
Ceilings
- The sign bit and the parity dial rule —
explore_eval_ceiling.py - The threshold law rule —
explore_ceiling_anatomy.py - The orientation ceiling and the inverted dial rule —
explore_ceiling_anatomy.py - The comparison ceiling and the constant dial rule —
explore_ceiling_dials.py - The skew unit and the price of doing less observation —
explore_eval_ceiling.py,explore_ceiling_anatomy.py,explore_ceiling_dials.py - Deadness is score-relative rule —
explore_ceiling_anatomy.py,explore_ceiling_dials.py - The window law and the resonance rule —
explore_ceiling_dials.py,explore_tilt_resonance.py - The k-ary ceiling and the live arc rule —
explore_kary_ceiling.py
Stated uncertainty
- The coverage map observation —
explore_ceiling_ruler.py,explore_ruler_divergence.py - Placement on a thin edge rule —
explore_ceiling_ruler.py,explore_ruler_boundary.py - One bracket, correct and empty rule —
explore_ceiling_ruler.py,explore_ruler_divergence.py - The tree the data does not fix observation —
explore_ruler_divergence.py - The uncounted term observation —
explore_uncounted_term.py - A bound over a parameter the data cannot pin observation —
explore_nonidentified_statement.py - The coordinate that decides is seen only while it moves observation —
explore_uncounted_inside.py,explore_uncounted_corner.py