SocialChoice.Voting.updateProfile
defimported Lean
Replace one voter's ballot.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in @[reducible] noncomputable def SocialChoice.Voting.updateProfile [Fintype N] [Fintype A] (P : Profile N A) (i : N) (r : LinearOrder A) : Profile N A
- Defined in
- EconCSLib, `SocialChoice.Voting.updateProfile`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.SocialChoice.Voting.updateProfile← SocialChoice.Voting.updateProfile (EconCSLib/SocialChoice/Voting/Basic.lean:174): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- SocialChoice.Voting.ProfileA voting profile assigns each voter a strict linear order over alternatives.
- Used by 6
- SocialChoice.Voting.PessimistStrategyproofnessPessimist strategyproofness for set-valued rules.
- SocialChoice.Voting.strategyproof_insert_preserves_choiceSocialChoice.Voting.strategyproof_insert_preserves_choice
- SocialChoice.Voting.ResoluteStrategyproofnessStrategyproofness for resolute rules: changing one ballot cannot produce a strictly better unique winner for the deviating voter.
- SocialChoice.Voting.OptimistStrategyproofnessOptimist strategyproofness for set-valued rules.
- SocialChoice.Voting.hybridProfile_erase_eq_updateSocialChoice.Voting.hybridProfile_erase_eq_update
- SocialChoice.Voting.hybridProfile_insert_eq_updateSocialChoice.Voting.hybridProfile_insert_eq_update
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in /-- Replace one voter's ballot. -/ @[reducible] noncomputable def SocialChoice.Voting.updateProfile [Fintype N] [Fintype A] (P : Profile N A) (i : N) (r : LinearOrder A) : Profile N A := by classical exact { pref := fun j => if j = i then r else P.pref j }