AFTD Auto-Formalizing Theoretical Domains

straight_line_cuts_card_ge_sub_one_of_transitions

theoremverified

If a transition count T satisfies 2(k - 1) ≤ T and T ≤ 2 * L_card, then L_card ≥ k - 1.

Statement

theorem straight_line_cuts_card_ge_sub_one_of_transitions (k : ℕ) (T : ℕ) (L_card : ℕ)
    (h_low : 2 * (k - 1) ≤ T) (h_up : T ≤ 2 * L_card) :
    k - 1 ≤ L_card
Source
arXiv:2610.27956 Proposition 1
Verified
22 Oct 2026
Axioms
Quot.soundpropext

Read back from the Lean

For all natural numbers $k$, $T$, and $L_{\text{card}}$, if $2(k - 1) \le T$ and $T \le 2 L_{\text{card}}$, then $k - 1 \le L_{\text{card}}$ (where subtraction is truncated natural number subtraction).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The result follows directly by combining the lower and upper bounds on T to obtain 2(k - 1) ≤ 2 * L_card, and dividing by 2. This linear integer arithmetic deduction is verified automatically by the omega tactic.

  1. k - 1 ≤ L_card

    Chaining the hypotheses 2(k - 1) ≤ T and T ≤ 2 * L_card gives 2(k - 1) ≤ 2 * L_card by transitivity, from which dividing by 2 yields k - 1 ≤ L_card. The linear integer arithmetic decision procedure omega closes the goal directly.

    line 5

      omega

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- If the number of transitions along a circular necklace is at least 2(k-1) and at most 2 * |L|, then |L| ≥ k - 1. -/theorem straight_line_cuts_card_ge_sub_one_of_transitions (k : ℕ) (T : ℕ) (L_card : ℕ)    (h_low : 2 * (k - 1) ≤ T) (h_up : T ≤ 2 * L_card) :    k - 1 ≤ L_card := by  omega
See it in the graphDiscuss this resultChallenge it