{"id":"https://openalex.org/W7168464702","doi":"https://doi.org/10.4230/lipics.itp.2026.34","title":"Three Roads to de Finetti\u2019s Theorem in Lean 4 (Short Paper)","display_name":"Three Roads to de Finetti\u2019s Theorem in Lean 4 (Short Paper)","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168464702","doi":"https://doi.org/10.4230/lipics.itp.2026.34"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:27008","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol382-itp2026/LIPIcs.ITP.2026.34/LIPIcs.ITP.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol382-itp2026/LIPIcs.ITP.2026.34/LIPIcs.ITP.2026.34.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037836079","display_name":"Cameron E. Freer","orcid":"https://orcid.org/0000-0003-1791-6843"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Freer, Cameron","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0003-1791-6843","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037836079"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.73536775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.47760000824928284,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.47760000824928284,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.10040000081062317,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13500","display_name":"Probability and Statistical Research","score":0.025299999862909317,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7799999713897705},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.5745000243186951},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.44110000133514404},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4171000123023987},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.41670000553131104},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4156000018119812},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.39239999651908875},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.37779998779296875}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7799999713897705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6850000023841858},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.5745000243186951},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4648999869823456},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.44110000133514404},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4171000123023987},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.41670000553131104},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4156000018119812},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.39239999651908875},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.37779998779296875},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3052999973297119},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C113843644","wikidata":"https://www.wikidata.org/wiki/Q901882","display_name":"Interface (matter)","level":4,"score":0.27239999175071716},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.2515999972820282},{"id":"https://openalex.org/C201779956","wikidata":"https://www.wikidata.org/wiki/Q5426803","display_name":"Ergodicity","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:27008","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol382-itp2026/LIPIcs.ITP.2026.34/LIPIcs.ITP.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.itp.2026.34","is_oa":true,"landing_page_url":"https://github.com/cameronfreer/exchangeability","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.itp.2026.34","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itp.2026.34","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:27008","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2026.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol382-itp2026/LIPIcs.ITP.2026.34/LIPIcs.ITP.2026.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168464702.pdf","grobid_xml":"https://content.openalex.org/works/W7168464702.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,59,115,132,153],"Lean":[3,117],"4":[4],"formalization":[5],"of":[6,14,36,44,97,108],"the":[7,45,49,83,87,126,142,148],"de":[8],"Finetti\u2013Ryll-Nardzewski":[9],"theorem":[10],"for":[11,54,120],"infinite":[12],"sequences":[13],"random":[15],"variables":[16],"on":[17,71,155],"standard":[18],"Borel":[19],"spaces,":[20],"establishing":[21],"that":[22],"every":[23],"exchangeable":[24],"sequence":[25],"is":[26],"conditionally":[27],"i.i.d.":[28],"The":[29,91,128],"development":[30],"closely":[31],"follows":[32],"Kallenberg\u2019s":[33],"modern":[34],"treatment":[35],"probabilistic":[37],"symmetries":[38],"and":[39,51,74,77,86,99,110],"formalizes":[40],"three":[41,103,129],"distinct":[42],"proofs":[43,130],"key":[46],"implication,":[47],"with":[48,105,114],"second":[50],"third":[52],"formalized":[53],"real-valued":[55],"square-integrable":[56],"sequences:":[57],"(i)":[58],"reverse\u2011martingale":[60],"argument":[61],"due":[62],"to":[63,140],"Aldous,":[64],"(ii)":[65],"an":[66,79],"elementary":[67],"L\u00b2":[68],"approach":[69],"based":[70],"contractability":[72],"bounds":[73],"Ces\u00e0ro":[75],"convergence,":[76],"(iii)":[78],"ergodic\u2011theoretic":[80],"proof":[81],"via":[82],"Koopman":[84],"operator":[85],"mean":[88],"ergodic":[89],"theorem.":[90],"library":[92],"contains":[93],"over":[94],"42,000":[95],"lines":[96],"code":[98],"was":[100],"completed":[101],"in":[102],"months":[104],"extensive":[106],"use":[107],"Claude":[109],"GPT":[111],"models,":[112],"together":[113],"reusable":[116],"proof-engineering":[118],"skill":[119],"agentic":[121],"coding":[122],"systems":[123],"developed":[124],"during":[125,159],"project.":[127],"share":[131],"uniform":[133],"common":[134],"ending,":[135],"so":[136],"each":[137],"route":[138],"had":[139],"produce":[141],"same":[143],"finite":[144],"conditional-factorization":[145],"interface":[146],"before":[147],"final":[149],"conclusion.":[150],"This":[151],"provided":[152],"cross-check":[154],"these":[156],"independent":[157],"routes":[158],"AI-assisted":[160],"development.":[161]},"counts_by_year":[],"updated_date":"2026-08-29T07:29:34.045763","created_date":"2026-07-17T00:00:00"}