Every retained alternative precedes every rejected alternative
ProvedAppliedModelingLib.FiniteChoice.linearTopQChoice_priorityaml-gs62-stable-marriage-20260915college-admissionsgame-theorystable-matching
Let be any linearly ordered type with decidable equality, , and a finite offered set. Let contain its first elements in increasing order, or all of when . If and , then . This is the strict priority property used when a college keeps its best applicants; its college order is decreasing in the college's values. No finiteness or nonemptiness assumption is imposed on the ambient type.
Preamble
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Lattice.Basic
import Mathlib.Data.Finset.Sort
import Mathlib.Data.Fintype.Basic
import Mathlib.Data.Prod.Lex
import Mathlib.Tactic
import Definitions.Def_AMLGS62_AppliedModelingLib_Markets_Matching_Basic
import Definitions.Def_AMLGS62_AppliedModelingLib_Markets_Matching_DeferredAcceptance
import Definitions.Def_AMLGS62_AppliedModelingLib_Markets_Matching_ManyToOne
import Definitions.Def_AMLGS62_GS62CollegeAdmissions_MainTheorems
import Definitions.Def_AMLGS62Rest_AppliedModelingLib_Foundations_Math_FiniteChoice
import Definitions.Def_AMLGS62Rest_AppliedModelingLib_Markets_Matching_ManyToOne
import Definitions.Def_AMLGS62Rest_GS62CollegeAdmissions_ExactCollegeBatchedProcedure
import Definitions.Def_AMLGS62Rest_GS62CollegeAdmissions_PaperInterface
import Definitions.Def_AMLGS62Rest_GS62CollegeAdmissions_SourceCompletion
import Definitions.Def_AMLGS62Rest_GS62CollegeAdmissions_SourceModel
open AppliedModelingLib
open AppliedModelingLib.FiniteChoice
variable {α : Type*} [DecidableEq α]
variable [LinearOrder α]
Formal statement
theorem AppliedModelingLib.FiniteChoice.linearTopQChoice_priority (q : ℕ)
{X : Finset α} {x y : α}
(hx : x ∈ linearTopQChoice q X)
(hyX : y ∈ X)
(hyNot : y ∉ linearTopQChoice q X) :
x < y := by sorrySource